An arbitrary two-qubit computation in 23 elementary gates or less

Proceedings - Design Automation Conference

Volumn , Issue , 2003, Pages 324-329

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

^a UNIVERSITY OF MICHIGAN   (United States)

Author keywords

Algorithms; Circuit Decomposition; CNOT; Elementary Gates; Lie Theory; Lower Bounds; Optimization; Quantum Circuits; Qubit; Synthesis

Indexed keywords

ALGORITHMS; COMPUTATION THEORY; GATES (TRANSISTOR); MATRIX ALGEBRA; PHASE SHIFT; QUANTUM ELECTRONICS;

CIRCUIT DECOMPOSITION;

SYSTEMS ANALYSIS;

EID: 0042635837     PISSN: 0738100X     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/775914.775916     Document Type: Conference Paper

References (18)

1. A. Barenco et al., "Elementary Gates For Quantum Computation," Physical Rev. A (52), 1995, 3457-3467.
2. M. J. Bremner et al., "A Practical Scheme For Quantum Computation With Any Two-qubit Entangling Gate," 2002. http://xxx.lanl.gov/abs/quant-ph/0207072
3. S. S. Bullock and I. L. Markov. "Smaller Circuits for Arbitrary n-qubit Diagonal Computations," http://xxx.lanl.gov/abs/quant-ph/0303039
4. G. Cybenko, "Reducing Quantum Computations to Elementary Unitary Operations," Comp. in Sci. and Engin., March/April 2001, pp. 27-32.
5. W. Dür, G. Vidai and J.I. Cirac, "Three qubits can be entangled in two inequivalent ways," Physical Review A, vol 62, 062314, 2000.
6. G. Hachtel, F. Somenzi, Synthesis and Verification of Logic Circuits, 3rd ed., Kluwer 2000.
7. G. H. Golub, C. F. Van Loan, Matrix Computations, Johns Hopkins Press, Baltimore, 1996.
8. C. Dawson and A. Gilchrist, "GQC: A Quantum Compiler", 2002. http://www.physics.uq.edu.au/gqc/.
9. G. Song and A. Klappenecker, "Optimal Realizations of Controlled Unitary Gates," 2003, http://xxx.lanl.gov/abs/guant-ph/0301078
10. A. W. Knapp, Lie Groups Beyond an Introduction, Progress in Mathematics, vol. 140, Birkhäuser, 1996.
11. N. Khaneja, R. Brockelt and S. J. Glaser, "Time Optimal Control In Spin Systems," 2001 http://xxx.lanl.gov/abs/quant-ph/0006114.
12. M. Lewenstein, B. Kraus, P. Horodecki and I. Cirac, "Characterization of Separable States and Entanglement Witnesses," Physical Review A (3), vol. 63, no. 4, 2001, pp. 044304-7, http://xxx.lanl.gov/abs/quant-ph/0011050.
13. R. B. Lockhart, M. J. Steiner and K. Gerlach, "Geometry and Product States", Quantum Information and Computation, vol. 2 no. 5, Sept. 2002, pp. 333-347.
14. M. Nielsen and I. Chuang, Quantum Computation and Quantum Information, Cambridge Univ. Press, 2000.
15. K. N. Patel, I. L. Markov, J. P. Hayes, "Efficient Synthesis of Linear Reversible Circuits", 2003. http://xxx.lanl.gov/abs/quant-ph/0302002
16. R. Tucci, "A Rudimentary Quantum Compiler", 1999, http://xxx.lanl.gov/abs/quant-ph/9902062
17. V. V. Shende, A. K. Prasad, I. L. Markov and J. P. Hayes, "Reversible Logic Synthesis", to appear in IEEE Trans. on Computer-Aided Design, 2002, http://xxx.lanl.gov/abs/quant-ph/0207001
18. G. F. Viamontes, M. Rajagopalan, I. L. Markov and J. P. Hayes, "Gate-level Simulation of Quantum Circuits", Proc. Asia and South-Pacific Design Automation Conf., Kitakyushu, Japan, January 2003. http://xxx.lanl.gov/abs/quant-ph/0208003