Efficient circuits for exact-universal computation with qudits

Quantum Information and Computation

Volumn 6, Issue 4-5, 2006, Pages 436-454

  Brennen, G K ^a,d   Bullock, S S ^b   O'Leary, D P ^a,c  

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

^b INSTITUTE FOR DEFENSE ANALYSES   (United States)

^c University of Maryland   (United States)

^d ERICH SCHMID INSTITUTE OF MATERIALS SCIENCE   (Austria)

Author keywords

[No Author keywords available]

Indexed keywords

QUANTUM THEORY; TIMING CIRCUITS;

ASYMPTOTICALLY OPTIMAL; EFFICIENT IMPLEMENTATION; GATE LIBRARIES; ORIGINAL ALGORITHMS; QR MATRIX DECOMPOSITIONS; QUANTUM CIRCUIT; SYNTHESIS CIRCUITS; UNIVERSAL COMPUTATIONS;

QUANTUM EFFICIENCY;

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

References (16)

1. E. Knill, Approximation by Quantum Circuits, http://arxiv.org/abs/quant- ph/9508006.
2. A. Muthukrishnan and C.R.Stroud Jr., Multivalued Logic Gates for Quantum Computation, Phys. Rev. A, 62, 052309 (2000).
3. J.J.Vartiainen, M.Möttönen, M.M.Salomaa, Efficient Decomposition of Quantum Gates, Phys. Rev. Lett., 92, 177902 (2004).
4. S.S. Bullock, D.P. O'Leary, and G.K. Brennen, Asymptotically Optimal Quantum Circuits for d-level Systems, Phys. Rev. Lett., 94, 230502 (2005).
5. D. Deutsch, A. Barenco, A. Ekert, Universality in Quantum Computation, Proc. R. Soc. London A, 449, 669 (1995).
6. V. Shende, S. Bullock, and I. Markov, Synthesis of Quantum Logic Circuits, Proceedings on Asia and South Pacific Design Automation Conference, 272 (2005), quant-ph/0406176.
7. R. Tucci, A Rudimentary Quantum Compiler, http://arxiv.org/abs/quant-ph/ 9805015.
8. ES. Khan and M. Perkowski, Synthesis of multi-qudit Hybrid and d-valued Quantum Logic Circuits by Decomposition, http://arxiv.org/abs/quant-ph/0511019.
9. V. Bergholm, J. Vartiainen, M.Möttönen, and M. Salomaa, Quantum Circuits with Uniformly Controlled one-qubit Gates, Phys. Rev. A, 71 052330 (2005).
10. G.K. Brennen, D.P. O'Leary, and S.S. Bullock, Criteria for Exact Qudit Universality, Phys. Rev A, 71 052318 (2005).
11. G. Song and A. Klappenecker, Optimal Realizations of Controlled Unitary Gates, Quantum Inf. Comput., 3(2) 139 (2003).
12. A. Barenco, C. Bennett, R. Cleve, D. DiVincenzo, N. Margolus, P. Shor, T. Sleator, J. Smolin, and H. Weinfurter, Elementary Gates for Quantum Computation, Phys. Rev A, 52, 3457 (1995).
13. G. Cybenko, Reducing Quantum Computations to Elementary Unitary Operations, Comp. in Sci. and Eng., 3, March/April, 27(2001).
14. G.H. Golub and C. van Loan, Matrix Computations, Johns Hopkins Press (Baltimore), (1989).
15. M. Grassl, M. Roetteler, T. Beth, Efficient Quantum Circuits for Non-Qubit Quantum Error-Correcting Codes, International Journal of Foundations of Computer Science, 14, pp. 757 (2003).
16. K.G.H. Vollbrecht and R.F. Werner, Why two qubits are special, J. Math. Phys. 41, 6772 (2000).