Threshold error rates for the toric and planar codes

Quantum Information and Computation

Volumn 10, Issue 5-6, 2010, Pages 456-469

  Wang, D S ^a   Fowler, A G ^a   Stephens, A M ^a   Hollenberg, L C L ^a  

^a UNIVERSITY OF MELBOURNE   (Australia)

Author keywords

[No Author keywords available]

Indexed keywords

CODES (SYMBOLS); ERROR CORRECTION; POLYNOMIAL APPROXIMATION; QUANTUM COMPUTERS;

2D-ARRAYS; CODE SCHEME; COUPLED QUBITS; ERROR RATE; ERROR-CORRECTION PROCEDURES; GRAPH MATCHINGS; NEAREST-NEIGHBOUR; NONIDEAL; ORDERS OF MAGNITUDE; POLYNOMIAL-TIME;

EXTRACTION;

EID: 77952062038     PISSN: 15337146     EISSN: None     Source Type: Journal    
DOI: 10.26421/qic10.5-6-6     Document Type: Article

References (22)

1. R. Raussendorf, J. Harrington, and K. Goyal. Topological fault-tolerance in cluster state quantum computation. New J. Phys., 9:199, 2007. quant-ph/0703143.
2. M. A. Nielson and I. L. Chuang. Quantum Computation and Quantum Information. Cambridge University Press, Cambridge, 2000.
3. P. W. Shor. Algorithms for quantum computation: Discrete logarithms and factoring. In Proc. 35th Annual Symposium on Foundations of Computer Science, pages 124-134, 1994.
4. L. K. Grover. A fast quantum mechanical algorithm for database search. In Proc. Twenty-Eighth Annual ACM Symposium on the Theory of Computing, pages 212-219, 1996. quant-ph/9605043.
5. P. W. Shor. Scheme for reducing decoherence in quantum computer memory. Phys. Rev. A, 52:R2493, 1995.
6. A. R. Calderbank and P. W. Shor. Good quantum error-correcting codes exist. Phys. Rev. A, 54(2):1098-1105, 1996. quant-ph/9512032.
7. A. M. Steane. Multiple particle interference and quantum error correction. Proc. R. Soc. Lond. A, 425:2551-2576, 1996. quant-ph/9601029.
8. E. Knill, R. Laflamme, and W. H. Zurek. Accuracy threshold for quantum computation. Technical Report LAUR-96-2199, Los Alamos National Laboratory, 1996. quant-ph/9610011.
9. E. Knill. Quantum computing with realistically noisy devices. Nature, 434:39, 2005. quantph/0410199.
10. A. M. Stephens and Z. W. E. Evans. Accuracy threshold for concatenated error detection in one dimension. Phys. Rev. A, 80(022313), 2009. arXiv:0902.2658.
11. A. Yu. Kitaev. Fault-tolerant quantum computation by anyons. Ann. Phys., 303(1):2-30, 2003. quant-ph/9707021.
12. E. Dennis, A. Kitaev, A. Landahl, and J. Preskill. Topological quantum memory. J. Math. Phys., 43:4452-4505, 2002. quant-ph/0110143.
13. C. Wang, J. Harrington, and J. Preskill. Confinement-Higgs transition in a disordered gauge theory and the accuracy threshold for quantum memory. Ann. Phys., 303(1):31-58, 2003.
14. R. Raussendorf and J. Harrington. Fault-tolerant quantum computation with high threshold in two dimensions. Phys. Rev. Lett., 98:190504, 2007. quant-ph/0610082.
15. A. G. Fowler, A. M. Stephens, and P. Groszkowski. High threshold universal quantum computation on the surface code. arXiv:0803.0272, 2008.
16. K. M. Svore, D. DiVincenzo, and B. Terhal. Noise threshold for a fault-tolerant two-dimensional lattice architecture. Quant. Info. Comp., 7:297, 2007. quant-ph/0604090.
17. F. M. Spedalieri and V. P. Roychowdhury. Latency in local, two-dimensional, fault-tolerant quantum computing. arXiv:0805.4213, 2008.
18. S. B. Bravyi and A. Y. Kitaev. Quantum Codes on a Lattice with Boundary. Quantum Computers and Computing, 2(1):43-48, 2001. quant-ph/9811052.
19. G. S. Agarwal. Mesoscopic superpositions of states-approach to classicality and diagonalization in coherent state basis. Phys. Rev. A, 59(3071), 1999. quant-ph/9810052.
20. M. F. Freedman and D. A. Meyer. Projective plane and planar quantum codes. Foundations of Computational Mathematics, 1(3):325-332, 2001. quant-ph/9810055.
21. J. Edmonds. Paths, trees, and flowers. Canadian Journal of Mathematics, 17(3):449-467, 1965.
22. W. Cook, A. Rohe, and Universität Bonn. Computing Minimum-Weight Perfect Matchings. Rheinische Friedrich-Wilhelms-Universität Bonn, 1997.