Block-based quantum-logic synthesis

Quantum Information and Computation

Volumn 11, Issue 3-4, 2011, Pages 262-277

  Saeedi, Mehdi ^a   Arabzadeh, Mona ^a   Zamani, Morteza Saheb ^a   Sedighi, Mehdi ^a  

^a AMIRKABIR UNIVERSITY OF TECHNOLOGY   (Iran)

Author keywords

Logic synthesis; Matrix decomposition; Quantum computing

Indexed keywords

COMPUTATION THEORY; COMPUTER CIRCUITS; LOGIC GATES; QUANTUM THEORY; QUBITS;

COSINE-SINE DECOMPOSITIONS; MATRIX DECOMPOSITION; NEAREST NEIGHBORS; NEAREST-NEIGHBOR INTERACTIONS; QUANTUM CIRCUIT; QUANTUM COMPUTING; SHANNON DECOMPOSITION; SYNTHESIS METHOD;

LOGIC SYNTHESIS;

EID: 78651380001     PISSN: 15337146     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Article

References (39)

1. C. Elliott. Quantum cryptography. IEEE Security Privacy, 2(4):57 - 61, July-August 2004.
2. P. W. Shor. Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer. SIAM Journal on Computing, 26:1484-1509, 1997.
3. L. K. Grover. A fast quantum mechanical algorithm for database search. ACM symposium on Theory of computing, pages 212-219, 1996.
4. R. Feynman. Simulating physics with computers. International Journal of Theoretical Physics, 21:467-488, 1982.
5. M. Mosca. Quantum algorithms. Springer Encyclopedia of Complexity and Systems Science, pages 7088-7118, 2009.
6. M. Ross and M. Oskin. Quantum computing. Commun. ACM, 51(7):12-13, July 2008.
7. D. Deutsch. Quantum computational networks. Proc. Roy. Soc. Lond., A425(73), 1989.
8. D. P. DiVincenzo. Two-bit gates are universal for quantum computation. APS Physical Review A, 50(1015), 1995.
9. A. Barenco et al. Elementary gates for quantum computation. APS Physical Review A, 52:3457-3467, 1995.
10. S. Lloyd. Almost any quantum logic gate is universal. Physical Review Letters, 75(2):346-349, 1995.
11. M. Nielsen and I. Chuang. Quantum computation and quantum information. Cambridge University Press, 2000.
12. G. Cybenko. Reducing quantum computations to elementary unitary operations. Computing in Science and Engg., 3(2):27-32, 2001.
13. E. Knill. Approximation by Quantum Circuits. LANL report LAUR-95-2225, 1995.
14. V. V. Shende, I. L. Markov, and S. S. Bullock. Minimal universal two-qubit quantum circuits. APS Physical Review A, 69:062321, 2004.
15. J. J. Vartiainen, M. M̈otẗonen, and M. M. Salomaa. Efficient decomposition of quantum gates. Physical Review Letters, 92:177902, 2004.
16. M. M̈otẗonen, J. J. Vartiainen, V. Bergholm, and M. M. Salomaa. Quantum circuits for general multiqubit gates. Physical Review Letters, 93(13):130502, 2004.
17. V. Bergholm, J. J. Vartiainen, M. M̈otẗonen, and M. M. Salomaa. Quantum circuits with uniformly controlled one-qubit gates. Physical Review A, 71:052330, 2005.
18. V. V. Shende, S. S. Bullock, and I. L. Markov. Synthesis of quantum logic circuits. Proceedings of the Asia and South Pacific Design Automation Conference, pages 272-275, 2005.
19. M. M̈otẗonen and J. J. Vartiainen. Decompositions of general quantum gates. Ch. 7 in Trends in Quantum Computing Research, NOVA Publishers, 2006.
20. V. V. Shende, S. S. Bullock, and I. L. Markov. Synthesis of quantum-logic circuits. IEEE Trans. on CAD, 25(6):1000-1010, June 2006.
21. Y. Nakajima, Y. Kawano, and H. Sekigawa. A new algorithm for producing quantum circuits using kak decompositions. Quantum Information and Computation, 6(1):67-80, 2006.
22. B. Drury and P. Love. Constructive quantum shannon decomposition from cartan involutions. Journal of Physics A: Mathematical and Theoretical, 41(39):395305, 2008.
23. V. V. Shende, I. L. Markov, and S. S. Bullock. Smaller two-qubit circuits for quantum communication and computation. Design, Automation and Test in Europe, pages 980-985, 2004.
24. G. Vidal and C. M. Dawson. A universal quantum circuit for two-qubit transformations with three CNOT gates. Physical Review A, 69:010301, 2004.
25. F. Vatan and C. Williams. Optimal quantum circuits for general two-qubit gates. Physical Review A, 69:032315, 2004.
26. J. Zhang, J. Vala, S. Sastry, and K. B. Whaley. Minimum construction of two-qubit quantum operations. Physical Review Letters, 93:020502, 2004.
27. F. Vatan and C. P. Williams. Realization of a general three-qubit quantum gate. e-print, quant- ph/0401178, 2004.
28. V. V. Shende and I. L. Markov. On the CNOT-cost of Toffoli gates. Quantum Information and Computation, 9(5-6):461-486, May 2009.
29. S. S. Bullock and I. L. Markov. Asymptotically optimal circuits for arbitrary n-qubit diagonal computations. Quantum Information and Computation, 4(1):27-47, 2004.
30. G. Song and A. Klappenecker. Optimal realizations of controlled unitary gates. Quantum Infor- mation and Computation, 3(2):139-155, 2003.
31. M. M̈otẗonen, J. J. Vartiainen, V. Bergholm, and M. M. Salomaa. Transformation of quantum states using uniformly controlled rotations. Quantum Information and Computation, 5(6):467-473, 2005.
32. R. R. Tucci. Qc paulinesia. Los Alamos e-print, quant-ph/0407215, 2004.
33. C. Lomont. Quantum circuit identities. e-print, quant-ph/0307111, 2003.
34. C. C. Paige and M. Wei. History and generality of the CS decomposition. Linear Algebra and Applications, 208:303-326, 1994.
35. R. K. Guy. Unsolved Problems in Number Theory, 2nd ed. Springer-Verlag, New York, 1994.
36. E. Knill, R. Laflamme, and G. J. Milburn. A scheme for efficient quantum computation with linear optics. Nature, 409:46-52, January 2001.
37. A. G. Fowler, S. J. Devitt, and L. C. L. Hollenberg. Implementation of shor's algorithm on a linear nearest neighbour qubit array. Quantum Information and Computation, 4(4):237-245, 2004.
38. M. Laforest et al. Using error correction to determine the noise model. Physical Review A, 75, 2007.
39. B. Kane. A silicon-based nuclear spin quantum computer. Nature, 393:133-137, May 1998.