New universal and fault-tolerant quantum basis

Information Processing Letters

Volumn 75, Issue 3, 2000, Pages 101-107

  Boykin, P Oscar ^a   Mor, Tal ^a,b   Pulver, Matthew ^a   Roychowdhury, Vwani ^a   Vatan, Farrokh ^a  

^a University of California   (United States)

^b ARIEL UNIVERSITY   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL METHODS; QUANTUM THEORY;

QUANTUM COMPUTATION;

DATA PROCESSING;

EID: 0034249254     PISSN: 00200190     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0020-0190(00)00084-3     Document Type: Article

References (21)

1. Adleman L.M., Demarrais J., Huang M.-D.A. Quantum computability. SIAM J. Comput. Vol. 26:1997;1524-1540.
2. Aharonov D., Ben-Or M. Fault-tolerant quantum computation with constant error. Proc. 29th Annual ACM Symposium on Theory of Computing (STOC'97). 1997;46-55.
3. Barenco A. A universal two-bit gate for quantum computation. Proc. Roy. Soc. London Ser. A. Vol. 449:1995;679-683.
4. Barenco A., Bennett C.H., Cleve R., DiVincenzo D.P., Margolus N., Shor P., Sleator T., Smolin J., Weinfurter H. Elementary gates for quantum computation. Phys. Rev. A. Vol. 52:1995;3457-3467.
5. Bernstein E., Vazirani U. Quantum complexity theory. SIAM J. Comput. Vol. 26:1997;1411-1473.
6. Boykin P.O., Mor T., Pulver M., Roychowdhury V., Vatan F. On universal and fault-tolerant quantum computing. Proc. 40th Annual Symposium on Foundations of Computer Science. 1999;IEEE Computer Society Press. LANL eprint quant-ph/9906054.
7. Deutsch D. Quantum theory, the Church-Turing principle and the universal quantum computer. Proc. Roy. Soc. London Ser. A. Vol. 400:1985;97-117.
8. Deutsch D. Quantum computational networks. Proc. Roy. Soc. London Ser. A. Vol. 245:1989;73-90.
9. Dummit D.S., Foote R.M. Abstract Algebra. 1991;Prentice-Hall, Inc. Englewood Cliffs, NJ.
10. Gottesman D. Theory of fault-tolerant quantum computation. Phys. Rev. A. Vol. 57:1998;127-137.
11. Gottesman D., Chuang I.L. Demonstrating the viability of universal quantum computation using teleportation and single-qubit operations. Nature. Vol. 402:1999;390-393.
12. Grover L. A fast quantum mechanical algorithm for database search. Proc. 28th ACM Symposium on Theory of Computing. 1996;212-219.
13. Kitaev A. Quantum computations: Algorithms and error correction. Russian Math. Surveys. Vol. 52:1997;1191-1249.
14. Knill E., Laflamme R., Zurek W.H. Accuracy threshold for quantum computation. LANL eprint quant-ph/9611025:1996.
15. Knill E., Laflamme R., Zurek W.H. Resilient quantum computation: Error models and thresholds. Proc. Roy. Soc. London Ser. A. Vol. 454:1998;365-384.
16. Preskill J. Reliable quantum computers. Proc. Roy. Soc. London Ser. A. Vol. 454:1998;385-410.
17. Sakurai J.J. Modern Quantum Mechanics. rev. edn. 1994;Addison-Wesley, Reading, MA.
18. Shor P. Scheme for reducing decoherence in quantum computer memory. Phys. Rev. A. Vol. 52:1995;2493-2496.
19. Shor P. Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer. SIAM J. Comput. Vol. 26:1997;1484-1509.
20. Shor P. Fault-tolerant Quantum Computation. Proc. 37th Annual Symposium on Foundations of Computer Science. 1996;56-65 IEEE Computer Society Press.
21. R. Solovay, A. Yao, Preprint, 1996.