The Solovay-Kitaev algorithm

Quantum Information and Computation

Volumn 6, Issue 1, 2006, Pages 081-095

  Dawson, Christopher M ^a   Nielsen, Michael A ^a  

^a UNIVERSITY OF QUEENSLAND   (Australia)

Author keywords

Fault tolerance; Solovay Kitaev algorithm; Universality

Indexed keywords

LOGIC GATES; QUANTUM CHANNEL; QUANTUM THEORY; QUBITS;

CONTROLLED NOT; FAULT-TOLERANT; FINITE SET; QUANTUM GATES; QUBIT GATES; SHOR'S ALGORITHMS; SINGLE-QUBIT GATES; UNIVERSALITY;

FAULT TOLERANCE;

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

References (24)

1. V. I. Arnold and A. L. Krylov. Soviet Math. Dokl., 4:1, 1962.
2. A. Barenco, C. H. Bennett, R. Cleve, D. P. DiVincenzo, N. Margolus, P. Shor, T. Sleator, J. A. Smolin, and H. Weinfurter. Elementary gates for quantum computation. Phys. Rev. A, 52:3457-3467, 1995. arXiv:quant-ph/9503016.
3. E. Bernstein and U. Vazirani. Quantum complexity theory. SIAM J. Comp., 26(5): 1411-1473, 1997. arXiv:quant-ph/9701001.
4. A. G. Fowler. Constructing arbitrary single-qubit fault-tolerant gates. arXiv:quant-ph/0411206, 2004.
5. M. Freedman, A. Kitaev, and J. Lurie. Diameters of homogeneous spaces. arXiv:quant-ph/0209113, 2002.
6. A. Gamburd, D. Jakobson, and P. Sarnak. Spectra of elements in the group ring of su(2). J. Eur. math. Soc., 1(1):51-85, 1999.
7. Lov K. Grover. A fast quantum mechanical algorithm for database search. In 28th ACM Symposium on Theory of Computation, page 212, New York, 1996. Association for Computing Machinery.
8. Lov K. Grover. Quantum mechanics helps in searching for a needle in a haystack. Phys. Rev. Lett., 79(2):325, 1997. arXiv:quant-ph/9706033.
9. A. Harrow, B. Recht, and I. L. Chuang. Efficient discrete approximations of quantum gates. J. Math. Phys., 43:4445, 2002. arXiv:quant-ph/0111031.
10. A. W. Harrow. Quantum compiling. MIT undergraduate thesis, 2001.
11. R. R. Tucci. A rudimentary quantum compiler. arXiv:quant-ph/9805015, 1998.
12. R. A. Horn and C. R. Johnson. Topics in matrix analysis. Cambridge University Press, Cambridge, 1991.
13. A. Y. Kitaev. Quantum computations: algorithms and error correction. Russ. Math. Surv., 52(6):1191-1249, 1997.
14. A. Y. Kitaev. Quantum error correction with imperfect gates. In A. S. Holevo O. Hirota and C. M. Caves, editors, Quantum Communication, Computing, and Measurement, pages 181-188, New York, 1997. Plenum Press.
15. A. Y. Kitaev, A. H. Shen, and M. N. Vyalyi. Classical and quantum computation, volume 47 of Graduate Studies in Mathematics. American Mathematical Society, Providence, Rhode Island, 2002.
16. A. Yu. Kitaev. Quantum measurements and the Abelian stabilizer problem. arXiv:quant-ph/9511026, 1995.
17. D. E. Knuth. Computer science and its relation to mathematics. Amer. Math. Month., 81(4), April 1974.
18. A. Lubotsky, R. Phillips, and P. Sarnak. Hecke operators and distributing points on the sphere i. I. Comm. Pure Appl. Math., 39:8149-8186, 1986.
19. A. Lubotsky, R. Phillips, and P. Sarnak. Hecke operators and distributing points on the sphere ii. I. Comm. Pure Appl. Math., 40:401-420, 1987.
20. M. A. Nielsen and I. L. Chuang. Quantum computation and quantum information. Cambridge University Press, Cambridge, 2000.
21. J. Preskill. Reliable quantum computers. Proc. Roy. Soc. A: Math., Phys. and Eng., 454(1969):385-410, 1998.
22. W. Rossmann. Lie Groups: An Introduction Through Linear Groups. Oxford University Press, Oxford, 2002.
23. P. W. Shor. Algorithms for quantum computation: discrete logarithms and factoring. In Proceedings, 35th Annual Symposium on Fundamentals of Computer Science, Los Alamitos, 1994. IEEE Press.
24. P. W. Shor. Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer. SIAM J. Comp., 26(5):1484-1509, 1997.