Asymptotically optimal circuits for arbitrary n-qubit diagonal comutations

Quantum Information and Computation

Volumn 4, Issue 1, 2004, Pages 27-47

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

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

^b UNIVERSITY OF MICHIGAN   (United States)

Author keywords

Character; Diagonal; Exclusive or; Gate; Quantum circuit

Indexed keywords

QUANTUM COMPUTERS; QUANTUM OPTICS; TIMING CIRCUITS;

ASYMPTOTICALLY OPTIMAL; BLOCH SPHERE; CHARACTER; CONTROLLED-NOT GATES; DIAGONAL; EXCLUSIVE-OR; GATE; N QUBITS; OPTIMAL CIRCUIT; QUANTUM CIRCUIT;

TENSORS;

EID: 1642619018     PISSN: 15337146     EISSN: None     Source Type: Journal    
DOI: 10.26421/qic4.1-3     Document Type: Article

References (17)

1. A. Barenco et al., "Elementary Gates For Quantum Computation," Physical Review A vol. 52, 1995, 3457-3467.
2. S.S.Bullock and I.L. Markov, "An Elementary Two-Qubit Quantum Computation In Twenty-Three Elementary Gates," Physical Review A vol. 68, 2003, 012318-012325, quant-ph/0211002.
3. G. Cybenko, "Reducing Quantum Computations to Elementary Unitary Operations," Comp. in Sci. and Engin., March/April 2001, pp. 27-32.
4. G. H. Golub and C. F. Van Loan, Matrix Computations, Johns Hopkins Press, Baltimore, 1996.
5. V. Guillemin and A. Pollack, Differential Topology, Prentice-Hall, Inc., Englewoods Cliffs New Jersey, 1974.
6. G. Hachtel and F. Somenzi, Synthesis and Verification of Logic Circuits, 3rd ed., Kluwer, 2000.
7. T. Hogg, C. Mochon, W. Polak, and E. Rieffel, "Tools For Quantum Algorithms," International Journal of Modern Physics C, (10) 1999, 1347-1361, quant-ph/9811073.
8. N. Khaneja, R. Brockett and S. J. Glaser, "Time Optimal Control In Spin Systems," 2001 quant-ph/0006114.
9. A. W. Knapp, Lie Groups Beyond an Introduction, Progress in Mathematics, vol. 140, Birkhäuser, 1996.
10. E. Knill, "Approximation by Quantum Circuits," 1995, quant-ph/9508006.
11. A. Mishchenko and M.Perkowski, "Fast Heuristic Minimization of Exclusive Sum-of-Products," Reed-Muller Workshop 2001, pp. 242-250.
12. M. Nielsen and I. Chuang, Quantum Computation and Quantum Information, Cambridge Univ. Press, 2000.
13. Y.Shi, "Both Toffoli and Controlled-NOT need little help to universal quantum computing," Quantum Information and Computing, vol. 3, no. 1, pp84-92, quant-ph/0205115.
14. "Optimal realizations of controlled unitary gates," G. Song and A. Klappenecker, Quantum Information and Computing, vol. 3, no. 2, pp139-155 quant-ph/0301078.
15. B. Steinbach and A. Mishchenko, "A New Approach to Exact ESOP Minimization", Reed-Muller Workshop '01, pp. 66-81.
16. B. Travaglione et al. "ROM-based Computation: Quantum Versus Classical," Quantum Information and Computation Vol. 2, No. 4, 2002 quant-ph/0109016.
17. R. Tucci, "A Rudimentary Quantum Compiler," 1999, quant-ph/9902062.