Arbitrary two-qubit computation in 23 elementary gates

Physical Review A - Atomic, Molecular, and Optical Physics

Volumn 68, Issue 1, 2003, Pages

  Bullock, Stephen S ^a,b   Markov, Igor L ^a  

^a UNIVERSITY OF MICHIGAN   (United States)

^b NATIONAL INSTITUTE OF STANDARDS AND TECHNOLOGY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; ELEMENTARY PARTICLES; NUMERICAL METHODS; OPTIMIZATION; SEMICONDUCTOR DEVICE MANUFACTURE;

ELEMENTARY QUANTUM GATES; QUANTUM CIRCUITS; QUANTUM COMPUTATION; QUBIT;

QUANTUM THEORY;

EID: 0141573241     PISSN: 10502947     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Article

References (20)

1. M. Nielsen and I. Chuang, Quantum Computation and Quantum Information (Cambridge University Press, Cambridge, 2000).
2. A. Barenco et al., Phys. Rev. A 52, 3457 (1995).
3. G. Hachtel and F. Somenzi, Synthesis and Verification of Logic Circuits, 3rd ed. (Kluwer, Dordrecht, 2000).
4. G. Cybenko, Comput. Sci. Eng. 3, 27 (2001).
5. R. Tucci, e-print quant-ph/9902062.
6. G. Song and A. Klappenecker, Quantum Inf. Comput. 2, 139 (2003).
7. V.V. Shende, A.K. Prasad, I.L. Markov and J.P. Hayes, IEEE Trans. Comput.-Aided Des. 22, 6 (2003).
8. N. Khaneja, R. Brockett, and S.J. Glaser, e-print quant-ph/0006114.
9. T. Hogg, C. Mochon, W. Polak and E. Rieffel, e-print quant-ph/9811073.
10. N. Khaneja and S. Glaser, e-print quant-ph/0010100.
11. M. Lewenstein, B. Kraus, P. Horodecki, and I. Cirac, Phys. Rev. A 63, 044304 (2001).
12. A.Yu. Kitaev, Russ. Math. Surveys 52, 1191 (1997).
13. M.J. Bremner, C.M. Dawson, J.L. Dodd, A. Gilchrist, A.W. Harrow, D. Mortimer, M.A. Nielsen, and T.J. Osborne, Phys. Rev. Lett. 89, 247902 (2002).
14. C. Dawson and A. Gilchrist, GQC: A Quantum Compiler, 2002. http://www.physics.uq.edu.au/gqc/
15. C. Bennett, D. DiVincenzo, J. Smolin, and W. Wooters, Phys. Rev. A 54, 3824 (1996).
16. S. Hill and K. Wooters, Phys. Rev. Lett. 78, 5022 (1997).
17. G.H. Golub and C.F. Van Loan, Matrix Computations (Johns Hopkins Press, Baltimore, 1996).
18. A.W. Knapp, Lie Groups Beyond an Introduction, Progress in Mathematics Vol. 140 (Birkhäuser, Boston, 1996).
19. É Cartan, Ann. Sci. Ec. Normale Super. 44, 345 (1927).
20. That program inputs a 4×4 unitary U and returns a canonial decomposition which is not, in a strict sense, a circuit in terms of elementary gates. It also returns a circuit that computes CNOT using U and one-qubit gtes. When U is used only once, this easily yields a circuit decomposition of U in terms of elementary gates. However, it appears that not all input matrices can be processed successfully.