Fault-tolerant quantum computation with constant error rate

SIAM Journal on Computing

Volumn 38, Issue 4, 2008, Pages 1207-1282

  Aharonov, Dorit ^a   Ben Or, Michael ^a  

^a HEBREW UNIVERSITY OF JERUSALEM   (Israel)

Author keywords

Concatenated codes; Density matrices; Noise and decoherence; Polynomial codes; Quantum computation; Quantum error correction; Quantum fault tolerance; Quantum Reed Solomon codes; Universal set of gates

Indexed keywords

CODES (SYMBOLS); COMPUTATIONAL LINGUISTICS; COMPUTER SCIENCE; COMPUTERS; DECODING; ERROR CORRECTION; ERRORS; GALLIUM; LEARNING SYSTEMS; LOGIC CIRCUITS; POLYNOMIAL APPROXIMATION; PROBABILITY; QUALITY ASSURANCE; QUANTUM COMPUTERS; QUANTUM OPTICS; QUANTUM THEORY; REED-SOLOMON CODES; RELIABILITY; SYSTEMATIC ERRORS; TERMINOLOGY;

CONCATENATED CODES; DENSITY MATRICES; NOISE AND DECOHERENCE; POLYNOMIAL CODES; QUANTUM COMPUTATION; QUANTUM ERROR CORRECTION; QUANTUM FAULT TOLERANCE; QUANTUM REED-SOLOMON CODES; UNIVERSAL SET OF GATES;

FAULT TOLERANCE;

EID: 55049086510     PISSN: 00975397     EISSN: None     Source Type: Journal    
DOI: 10.1137/S0097539799359385     Document Type: Article

References (103)

1. D. AHARONOV, Quantum Computation, Annual Reviews of Computational Physics 6, D. Stauffer, ed., World Scientific, Singapore, 1998.
2. D. AHARONOV, A quantum to classical phase transition in noisy quantum computers, Phys. Rev. A, 62 (2000), 062311.
3. D. AHARONOV AND M. BEN-OR, Fault-tolerant quantum computation with constant error, in Proceedings of the 29th Annual ACM Symposium on Theory of Computing (STOC), El Paso, TX, 1997, pp. 176-188.
4. D. AHARONOV AND M. BEN-OR, Fault-Tolerant Quantum Computation with Constant Error Rate, preliminary extended version of [3], available online at http://arxiv.org/abs/quantph/ 9906129 (1999).
5. D. AHARONOV AND M. BEN-OR, Polynomial simulations of decohered quantum computers, in Proceedings of the 37th Annual Symposium on Foundations of Computer Science (FOCS), IEEE, Los Alamitos, CA, 1996, pp. 46-55.
6. D. AHARONOV, A. Y. KITAEV, AND N. NISAN, Quantum circuits with mixed states, in Proceedings of the 30th Annual ACM Symposium on Theory of Computing (STOC), Dallas, TX, 1998, pp. 20-30.
7. D. AHARONOV, M. BEN-OR, R. IMPAGLIAZZO, AND N. NISAN, Limitations of Noisy Reversible Computation, available online at http://arxiv.org/abs/quant-ph/ 9611028 (1996).
8. -4? Presentation at ITP Conference of Quantum Information, 2001, available online at http://online.itp.ucsb.edu/online/qinfo_c01/aharonov/.
9. D. AHARONOV, A. Y. KITAEV, AND J. PRESKILL, Fault tolerant quantum computation with long-range correlated noise, Phys. Rev. Lett., 96 (2006), 050504.
10. C. S. AHN, Extending Quantum Error Correction: New Continuous Measurement Protocols and Improved Fault-Tolerant Overhead, Ph.D. thesis, Caltech, Pasadena, CA, 2004.
11. R. ALICKI, M. HORODEOKI, P. HORODECKI, AND R. HORODEOKI, Dynamical description of quantum computing: Generic nonlocality of quantum noise, Phys. Rev. A, 65 (2002), 062101.
12. R. ALICKI, D. A. LIDAR, AND P. ZANARDI, Internal consistency of fault-tolerant quantum error correction in light of rigorous derivations of the quantum Markovian limit. Phys. Rev. A, 73 (2006), 052311.
13. P. ALIFERIS AND A. CROSS, Subsystem fault tolerance with the Bacon-Shor code, Phys. Rev. Lett., 98 (2007), 220502.
14. P. ALIFERIS, D. GOTTESMAN, AND J. PRESKILL, Quantum accuracy threshold for concatenated distance-3 codes, Quant. Inf. Comput., 6 (2006), pp. 97-165.
15. P. ALIFERIS, D. GOTTESMAN, AND J. PRESKILL, Accuracy threshold for postselected quantum computation, Quant. Inf. Comput., 8 (2008), pp. 181-244.
16. D. BACON, Operator quantum error correcting subsystems for self-correcting quantum memories, Phys. Rev. A, 73 (2006), 012340.
17. D. BACON, J. KEMPE, D. LIDAR, AND B. K. WHALEY, Universal fault-tolerant computation on decoherence-free subspaces, Phys. Rev. Lett., 85 (2000), pp. 1758-1761.
18. J. KEMPE, D. BACON, D. LIDAR, AND B. K. WHALEY, Theory of decoherence-free fault-tolerant universal quantum computation, Phys. Rev. A, 63 (2001), 042307.
19. A. BARENCO, C. H. BENNETT, R. CLEVE, D. P. DIVINCENZO, N. MARGQLUS, P. SHOR, T. SLEATOR, J. A. SMOLIN, AND H. WEINFURTER, Elementary gates for quantum computation, Phys. Rev. A, 52 (1995), pp. 3457-3467.
20. A. BARENCO, A. EKERT, K. A. SUOMINEN, AND P. TORMA, Approximate quantum Fourier transform and decoherence, Phys. Rev. A, 54 (1996), pp. 139-146.
21. C. H. BENNETT, E. BERNSTEIN, G. BRASSARD, AND U. VAZIKANI, Strengths and weaknesses of quantum computing, SIAM J. Comput., 26 (1997), pp. 1510-1523.
22. C. H. BENNETT, D. P. DIVINCENZO, J. A. SMOLIN, AND W. K. WOOTTERS, Mixed state entanglement and quantum error correction, Phys. Rev. A, 54 (1996), pp. 3824-3851.
23. M. BEN-OR AND R. CLEVE, Computing algebraic formulas using a, constant number of registers, SIAM J. Comput., 21 (1992), pp. 54-58.
24. M. BEN-OR, S. GOLDWASSER, AND A. WIGDERSON, Completeness theorems for fault-tolerant distributed computing, in Proceedings for the 20th Annual ACM Symposium on Theory of Computing (STOC), Chicago, 1988, pp. 1-10.
25. A. BERTHIAUME AND G. BRASSARD, Oracle quantum, computing, in Proceedings of the Workshop on Physics of Computation: PhysComp '92, IEEE Computer Society Press, Los Alamitos, CA, 1992, pp. 60-62.
26. P. O. BOYKIN, T. MOR, M. PULVER, V. ROYCHOWDHURY, AND F. VATAN, A new universal and fault-tolerant quantum basis, Inform. Process. Lett., 75 (2000), pp. 101-107.
27. S. BRAVYI AND A. Y. KITAEV, Universal quantum computation with ideal Clifford gates and noisy ancillas, Phys. Rev. A, 71 (2005), 022316.
28. A. R. CALDERBANK AND P. W. SHOR, Good quantum error-correcting codes exist, Phys. Rev. A, 54 (1996), pp. 1098-1105.
29. M. D. CHOI, Completely positive linear maps on complex matrices, Linear Algebra Appl., 10 (1975), pp. 285-290.
30. I. L. CHUANG, R. LAFLAMME, P. W. SHOR, AND W. H. ZUREK, Quantum computers, factoring, and decoherence, Science, 270 (1995), pp. 1633-1635.
31. I. L. CHUANG, W. C. D. LEUNG, AND Y. YAMAMOTO, Bosonic quantum codes for amplitude damping, Phys. Rev. A, 56 (1997), pp. 1114-1125.
32. B. CIREL'SON (TSIRELSON), Reliable Storage of Information in a System of Unreliable Components with Local Interactions, Lecture Notes in Math. 653, Springer-Verlag, New York, 1978, pp. 15-30.
33. R. CLEVE, D. GOTTESMAN, AND H.-K. LO, HOW to share a quantum secret, Phys. Rev. Lett., 83 (1999), pp. 648-651.
34. C. COHEN-TANOUDJI Quantum Mechanics. Wiley, New York. 1977.
35. D. COPPERSMITH AND E. GROSSMAN, Generators for certain alternating groups with Applications to cryptography. SIAM J. Appl. Math., 29 (1975), pp. 624-627.
36. C. CRÉPEAU, D. GOTTESMAN, AND A. SMITH, Secure multi-party quantum computation, in Proceedings of the 34th Annual ACM Symposium on Theory of Computing, Montreal, Quebec, Canada, 2002, pp. 643-652.
37. E. DENNIS, A. Y. KITAEV, A. LANDAHL, AND J. PRESKILL, Topological quantum memory, J. Math. Phys., 43 (2002), pp. 4452-4505.
38. D. DEUTSCH, Quantum theory, the Church-Turing principle, and the universal quantum computer, Proc, R. Soc. Lond. Ser. A, 400 (1985), pp. 97-117.
39. D. DEUTSCH, Quantum computational networks, Proc. R. Soc. Lond. Ser. A, 425 (1989), pp. 73-90.
40. D. P. DIVINCENZO, Two-bit gates are universal for quantum computation, Phys. Rev. A, 51 (1995), pp. 1015-1022.
41. L.-M. DUAN AND G.-C. GUO, Reducing decoherence in quantum computer memory with all quantum bits coupling to the same environment, Phys. Rev. A, 57 (1998), pp. 737-741.
42. P. GÁCS, Self correcting two dimensional arrays, in Advances in Computing Research: A Research Annual: Randomness and Computation, S. Micali, ed., JAI Press, Greenwich, CT, 1989, pp. 223-326 (see, in particular, pp. 240-241 and 246-248).
43. C. W. GARDINER, Quantum Noise, Springer, Berlin, 1991.
44. D. GOTTESMAN, A theory of fault-tolerant quantum computation, Phys. Rev. A, 57 (1998), pp. 127-137.
45. D. GOTTESMAN, Stabilizer Codes and Quantum Error Correction, Ph.D. thesis, Caltech, Pasadena, CA; available online at http://arxiv.org/abs/quant-ph/9705052 (1997).
46. D. GOTTESMAN, Fault-tolerant quantum computation with higher-dimensional systems, Chaos Solitons Fractals, 10 (1999), pp. 1749-1758.
47. D. GOTTESMAN, Fault-tolerant quantum computation with local gates, J. Modern Opt., 47 (2000), pp. 333-345.
48. D. GOTTESMAN AND I CHUANG, Demonstrating the viability of universal quantum computation using teleportation and single-qubit operations, Nature, 402 (1999), pp. 390-393.
49. L. A. KHALFIN AND B. S. TSIRELSON, Quantum/classical correspondence in the light of Bell's inequalities, Found. Phys. 22 (1992), pp. 879-948.
50. A. Y. KITAEV, Quantum computations: Algorithms and error corrections, Russian Math, Surveys, 52 (1997), pp. 1191-1249.
51. A. Y. KITAEV, Fault-tolerant quantum computation by anyons, Ann. Physics, 303 (2003), Pp. 2-30.
52. A. Y. KITAEV, A. H. SHEN, AND M. N. VYALYI, Classical and Quantum Computation, Grad. Stud. Math. 47, American Mathematical Society, Providence, RI, 2002.
53. E. KNILL, Non-Binary Unitary Error Bases and Quantum Codes, available online at http://arxiv.org/abs/quant-ph/9608048 (1996).
54. E. KNILL, Quantum computing with very noisy devices, Nature, 434 (2005), pp. 30-44.
55. E. KNILL AND L. VIOLA, Theory of quantum error correction for general noise, Phys. Rev. Lett., 84 (2000), pp. 2525-2528.
56. E. KNILL, R. LAFLAMME, AND W. ZUREK, Resilient quantum computation, Science, 279 (1998), pp. 342-345.
57. E. KNILL, R. LAFLAMME, AND W. H. ZUREK, Resilient Quantum Computation: Error Models and Thresholds, available online at http://arxiv.org/abs/quant-ph/9702058 (1997).
58. E. KNILL AND R. LAFLAMME, Concatenated Quantum Codes, available online at http://arxiv.org/abs/quant-ph/9608012 (1996).
59. D. W. KRIBS, R. LAFLAMME, D. POULIN, AND M. LESOSKY, Operator quantum error correction, Quantum. Inf. Comput., 6 (2006), pp. 383-399.
60. K. HELLWIG AND K. KRAUS, Operations and measurements. II, Comm. Math. Phys. 16 (1970), pp. 142-147.
61. K. KRAUS, States, Effects and Operations. Fundamental Notions of Quantum Theory, Springer-Verlag, Berlin, 1983.
62. R. LANDAUER, Is quantum, mechanics useful?, Philos. Trans. Roy. Soc. London Ser. A, 353 (1995), pp. 367-376.
63. D. A. LIDAR, L. C. ISAAC, AND B. K. WHALEY, Decoherence free subspaces for quantum computation, Phys. Rev. Lett., 81 (1998), pp. 2594-2597.
64. J. H. VAN LINT, An Introduction to Coding Theory, 2nd ed., Springer-Verlag, New York, 1992.
65. C. MIQUEL, J. P. PAZ, AND R. PERAZZO, Factoring in a dissipative quantum computer, Phys. Rev. A, 54 (1996), pp. 2605-2613.
66. C. MIQUEL, J. P. PAZ, AND W. H. ZUREK, Quantum computation with phase drift errors, Phys. Rev. Lett., 78 (1997), pp. 3971-3974.
67. J. VON NEUMANN, Probabilistic logic and the synthesis of reliable organisms from unreliable components, in Automata Studies, C. E. Shanon and J. McCarthy, eds., Princeton University Press, Princeton, NJ, 1956, pp. 43-98.
68. M. NIELSEN AND I. CHUANG, Quantum Computation and Quantum Information, Cambridge University Press, Cambridge, UK, 2000.
69. A. OSTERLOH, L. AMICO, G. EALCI, AND R. FAZIO, Scaling of entanglement close to a quantum, phase transition, Nature, 416 (2002), pp. 608-610.
70. T. OSBORNE AND M. NIELSEN, Entanglement in a simple quantum phase transition, Phys. Rev. A, 66 (2002), 032110.
71. G. M. PALMA, K.-A. SUOMINEN, AND A. K. EKERT, Quantum, computers and dissipation, Proc. R. Soc. Lond. Ser. A, 452 (1996), pp. 567-584.
72. A. PERES, Quantum Theory: Concepts and Methods, Kluwer Academic Press, Dordrecht, The Netherlands, 1993.
73. J. PRESKILL, Fault tolerant quantum computation, in Introduction to Quantum Computation and Information, H.-K. Lo, S. Popescu, and T. P. Spiller, eds., World Scientific, River Edge, NJ, 1998, pp. 213-269.
74. J. PRESKILL, Reliable quantum computation, Proc. Roy. Soc. London Ser, A, 454 (1998), pp. 385-410.
75. R. RAUSSENDORF AND J. HARRINGTON, Fault tolerant quantum computation with high threshold in two dimensions, Phys. Rev. Lett., 98 (2007), 190504.
76. B. W. REICHARDT, Error-Detection-Based Quantum Fault Tolerance Against Discrete Pauli Noise, Ph.D. thesis, University of California, Berkeley, CA, 2006. Available online at http://arxiv.org/abs/quant- ph/0612004.
77. B. W. REICHARDT, Improved Ancilla, Preparation Scheme Increases Fault-Tolerant Threshold; available online at http://arxiv.org/ abs/quant-ph/0406025 (2004).
78. B. W. REICHARDT, Threshold for a Distance-Three Quantum Code; available online at http://arxiv.org/abs/quant-ph/0509203 (2005).
79. J. J. SAQURAI, Modern Quantum Mechanics, revised ed., Addison-Wesley, Reading, MA, 1994.
80. B. W. SCHUMACHER AND M. A. NIELSEN, Quantum data processing and error correction, Phys. Rev. A, 54 (1996), pp. 2629-2635.
81. A. SHAMIR, How to share a secret, Comm. ACM, 22 (1979), pp. 612-613.
82. P. W. SHOR, Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer, SIAM J. Comput., 26 (1997), pp. 1484-1509.
83. P. W. SHOR, Scheme for reducing decoherence in quantum computer memory, Phys. Rev. A, 52 (1995), pp. 2493-2496.
84. P. W. SHOR, Fault tolerant quantum computation, in Proceedings of the 37th Symposium on the Foundations of Computer Science, IEEE Press, Los Alamitos, CA, 1996, pp. 56-65.
85. R. SOLOVAY AND A. C.-C. YAO, manuscript, 1996.
86. D. A. SPIELMAN, Highly fault-tolerant parallel computation, in Proceedings of the 37th Annual IEEE Conference on Foundations of Computer Science, 1996, pp. 154-163.
87. A. STEANE, Quantum computing and error correction, in Decoherence and Its Implications in Quantum Computation and Information Transfer, A. Gonis and P. E. A. Turchi, eds., IOS Press, Amsterdam, 2001, pp. 284-298.
88. A. STEANE, Error correcting codes in quantum theory, Phys. Rev. Lett., 77 (1996), pp. 793-797.
89. A. STEANE, Multiple particle interference and quantum error correction, Proc. R. Soc. Lond. Ser. A, 452 (1996), pp. 2551-2577.
90. A. STEANE, Active stabilisation, quantum computation and quantum state synthesis, Phys. Rev. Lett., 78 (1997), pp. 2252-2255.
91. A. M. STEANE, Space, time, parallelism and noise requirements for reliable quantum computing, Fortschr. Phys., 46 (1998), pp. 443-458.
92. A. M. STEPHENS, A. G. FOWLER, AND L. C. L. HOLLENBERG, Universal fault tolerant quantum computation on bilinear nearest neighbor arrays, Quant. Inf. Comput., 8 (2008), p. 330-344.
93. A. STERN, Y. AHARONOV, AND Y. IMRY, Phase uncertainty and loss of interference: A general picture, Phys. Rev. A, 41 (1990), pp. 3436-3448.
94. A. STERN, Y. AHARONOV, AND Y. IMRY, Dephasing of interference by a back reacting environment, in Quantum Coherence, J. Anandan, ed., World Scientific, Singapore, 1991, p. 201.
95. K. M. SVORE, D. P. DIVINCENZO, AND B. M. TERHAL, Noise threshold for a fault-tolerant two-dimensional lattice architecture, Quantum Inf. Comput., 7 (2007), pp. 297-318.
96. B. TERHAL AND G. BURKARD, Fault-tolerant quantum computation for local non-Markovian noise, Phys. Rev. A, 71 (2005), 012336.
97. W. G. UNRUH, Maintaining coherence in quantum computers, Phys. Rev. A, 51 (1995), pp. 992-997.
98. L. C. WASHINGTON, Introduction to Cyclotomic Fields, Grad. Texts in Math. 83, Springer-Verlag, New York, 1982.
99. W. K. WOOTTERS AND W. H. ZUREK, A single quantum cannot be cloned, Nature, 299 (1982), pp. 802-803.
100. A. C.-C. YAO, Quantum circuit complexity, Proceedings of the 33th Annual Symposium on Foundations of Computer Science (FOCS), IEEE, Los Alamitos, CA, 1993, pp. 352-361.
101. P. ZANARDI, Dissipation and decoherence in a quantum, register, Phys. Rev. A, 57 (1998), pp. 3276-3284.
102. P. ZANARDI AND M. RASSETI, Noiseless quantum codes, Phys. Rev. Lett., 79 (1997), pp. 3306-3309.
103. W. H. ZUREK, Decoherence and the transition from quantum to classical, Physics Today, 44 (1991), pp. 36-44.