The DOI matches its Crossref record; 52 of the 52 references it cites were found in a registry or an index.
Fault-tolerant thresholds for quantum error correction with the surface code
Open accessAbstract
The surface code is a promising candidate for fault-tolerant quantum computation, achieving a high threshold error rate with nearest-neighbor gates in two spatial dimensions. Here, through a series of numerical simulations, we investigate how the precise value of the threshold depends on the noise model, measurement circuits, and decoding algorithm. We observe thresholds between 0.502(1)% and 1.140(1)% per gate, values which are generally lower than previous estimates.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Claims other papers make about this one
Each is checked against this paper’s own text: does it say what the citing paper says it does?
In the citing paper
“This threshold behaviour can be subtle58, and there exists a crossover regime in which, owing to finite-size effects, increasing system size initially suppresses the logical error per cycle before later increasing it.”
From Suppressing quantum errors by scaling a surface code logical qubit (2023) · cites this paper as [58]
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Fault-tolerant quantum computation by anyons
Kitaev, A. Y. (2003) · Annals of Physics · doi:10.1016/s0003-4916(02)00018-0 · Cited by 7,238
Surface codes: Towards practical large-scale quantum computation
Fowler, A. G., Mariantoni, M., Martinis, J. M., & Cleland, A. N. (2012) · Physical Review A · doi:10.1103/physreva.86.032324 · Cited by 3,059
Edmonds, J. (1965) · Canadian Journal of Mathematics · doi:10.4153/cjm-1965-045-4 · Cited by 2,428
Monte Carlo and quasi-Monte Carlo methods
Caflisch, R. E. (1998) · Acta Numerica · doi:10.1017/s0962492900002804 · Cited by 1,783
Dennis, E., Kitaev, A., Landahl, A., & Preskill, J. (2002) · Journal of Mathematical Physics · doi:10.1063/1.1499754 · Cited by 1,768
Universal quantum computation with ideal Clifford gates and noisy ancillas
Bravyi, S., & Kitaev, A. (2005) · Physical Review A · doi:10.1103/physreva.71.022316 · Cited by 1,525
Dennis, E., Kitaev, A., Landahl, A., & Preskill, J. (2001) · CERN Document Server (European Organization for Nuclear Research) · Cited by 1,485
Quantum computations: algorithms and error correction
Kitaev, A. Y. (1997) · Russian Mathematical Surveys · doi:10.1070/rm1997v052n06abeh002155 · Cited by 1,424
Quantum computing with realistically noisy devices
Knill, E. (2005) · Nature · doi:10.1038/nature03350 · Cited by 1,184
Fault-Tolerant Quantum Computation with High Threshold in Two Dimensions
Raussendorf, R., & Harrington, J. (2007) · Physical Review Letters · doi:10.1103/physrevlett.98.190504 · Cited by 812
An introduction to quantum error correction and fault-tolerant quantum computation
Gottesman, D. (2010) · Proceedings of symposia in applied mathematics · doi:10.1090/psapm/068/2762145 · Cited by 795
Topological Quantum Distillation
Bombin, H., & Martin-Delgado, M. A. (2006) · Physical Review Letters · doi:10.1103/physrevlett.97.180501 · Cited by 700
Topological fault-tolerance in cluster state quantum computation
Raussendorf, R., Harrington, J., & Goyal, K. (2007) · New Journal of Physics · doi:10.1088/1367-2630/9/6/199 · Cited by 617
Introduction to Quantum Computation and Information
Lo, H.-K., Spiller, T. P., & Popescu, S. (1998) · WORLD SCIENTIFIC eBooks · doi:10.1142/9789812385253 · Cited by 488
High-threshold universal quantum computation on the surface code
Fowler, A. G., Stephens, A. M., & Groszkowski, P. (2009) · Physical Review A · doi:10.1103/physreva.80.052312 · Cited by 486
Self-citationBlossom V: a new implementation of a minimum cost perfect matching algorithm
Kolmogorov, V. (2009) · Mathematical Programming Computation · doi:10.1007/s12532-009-0002-8 · Cited by 435
A fault-tolerant one-way quantum computer
Raussendorf, R., Harrington, J., & Goyal, K. (2006) · Annals of Physics · doi:10.1016/j.aop.2006.01.012 · Cited by 397
Resilient quantum computation: error models and thresholds
Knill, E., Laflamme, R., & Zurek, W. H. (1998) · Proceedings of the Royal Society of London. Series A: Mathematical, Physical and Engineering Sciences · doi:10.1098/rspa.1998.0166 · Cited by 346
Surface code quantum computing with error rates over 1%
Wang, D. S., Fowler, A. G., & Hollenberg, L. C. L. (2011) · Physical Review A · doi:10.1103/physreva.83.020302 · Cited by 345
Wang, C., Harrington, J., & Preskill, J. P. (2003) · Annals of Physics · doi:10.1016/s0003-4916(02)00019-2 · Cited by 330
Quantum Self-Correction in the 3D Cubic Code Model
Bravyi, S. B., & Haah, J. (2013) · Physical Review Letters · doi:10.1103/physrevlett.111.200501 · Cited by 289
Scalable architecture for a room temperature solid-state quantum information processor
Yao, N. Y., Jiang, L., Gorshkov, A. V., Maurer, P. C., Giedke, G., Cirac, J. I., & Lukin, M. D. (2012) · Nature Communications · doi:10.1038/ncomms1788 · Cited by 245
Fast Decoders for Topological Quantum Codes
Duclos-Cianci, G., & Poulin, D. (2010) · Physical Review Letters · doi:10.1103/physrevlett.104.050504 · Cited by 244
Monte Carlo and Quasi-Monte Carlo Methods 2008
Ecuyer, P. L., & Owen, A. B. (2009) · Springer eBooks · doi:10.1007/978-3-642-04107-5 · Cited by 240
Nickerson, N., Li, Y., & Benjamin, S. C. (2013) · Nature Communications · doi:10.1038/ncomms2773 · Cited by 238
Towards Practical Classical Processing for the Surface Code
Fowler, A. G., Whiteside, A. C., & Hollenberg, L. C. L. (2012) · Physical Review Letters · doi:10.1103/physrevlett.108.180501 · Cited by 203
Projective Plane and Planar Quantum Codes
Freedman, M. H., & MEYER, D. A. (2001) · Foundations of Computational Mathematics · doi:10.1007/s102080010013 · Cited by 184
Monte Carlo and Quasi-Monte Carlo Methods
Baldeaux, J. F., & Platen, E. (2013) · Bocconi & Springer Series · doi:10.1007/978-3-319-00747-2_12 · Cited by 177
Fault Tolerant Quantum Computation with Very High Threshold for Loss Errors
Barrett, S. D., & Stace, T. M. (2010) · Physical Review Letters · doi:10.1103/physrevlett.105.200502 · Cited by 165
Two-dimensional random-bond Ising model, free fermions, and the network model
Merz, F., & Chalker, J. T. (2002) · Physical review. B, Condensed matter · doi:10.1103/physrevb.65.054425 · Cited by 144
Architectural design for a topological cluster state quantum computer
Devitt, S. J., Fowler, A. G., Stephens, A. M., Greentree, A. D., Hollenberg, L. C. L., Munro, W. J., & Nemoto, K. (2009) · New Journal of Physics · doi:10.1088/1367-2630/11/8/083032 · Cited by 115
Self-citationDISTRIBUTED QUANTUM COMPUTATION ARCHITECTURE USING SEMICONDUCTOR NANOPHOTONICS
VAN METER, R., LADD, T. D., FOWLER, A. G., & YAMAMOTO, Y. (2010) · International Journal of Quantum Information · doi:10.1142/s0219749910006435 · Cited by 109
Universality Class of the Nishimori Point in the 2D ± J Random-Bond Ising Model
Honecker, A., Picco, M., & Pujol, P. (2001) · Physical Review Letters · doi:10.1103/physrevlett.87.047201 · Cited by 106
Optimal and efficient decoding of concatenated quantum block codes
Poulin, D. (2006) · Physical Review A · doi:10.1103/physreva.74.052333 · Cited by 105
High Threshold Error Correction for the Surface Code
Wootton, J. R., & Loss, D. (2012) · Physical Review Letters · doi:10.1103/physrevlett.109.160503 · Cited by 100
Error correction and degeneracy in surface codes suffering loss
Stace, T. M., & Barrett, S. D. (2010) · Physical Review A · doi:10.1103/physreva.81.022317 · Cited by 99
Surface code with decoherence: An analysis of three superconducting architectures
Ghosh, J., Fowler, A. G., & Geller, M. R. (2012) · Physical Review A · doi:10.1103/physreva.86.062318 · Cited by 91
Decoding color codes by projection onto surface codes
Delfosse, N. (2014) · Physical Review A · doi:10.1103/physreva.89.012317 · Cited by 90
Ohno, T., Arakawa, G., Ichinose, I., & Matsui, T. (2004) · Nuclear Physics B · doi:10.1016/j.nuclphysb.2004.07.003 · Cited by 81
Requirements for fault-tolerant factoring on an atom-optics quantum computer
Devitt, S. J., Stephens, A. M., Munro, W. J., & Nemoto, K. (2013) · Nature Communications · doi:10.1038/ncomms3524 · Cited by 78
Self-citationSimulation of rare events in quantum error correction
Bravyi, S. B., & Vargo, A. (2013) · Physical Review A · doi:10.1103/physreva.88.062308 · Cited by 68
Locations of multicritical points for spin glasses on regular lattices
Ohzeki, M. (2009) · Physical Review E · doi:10.1103/physreve.79.021129 · Cited by 62
Scalable, High-Speed Measurement-Based Quantum Computer Using Trapped Ions
Stock, R., & James, D. F. V. (2009) · Physical Review Letters · doi:10.1103/physrevlett.102.170501 · Cited by 62
Fault Tolerant Quantum Computation with Nondeterministic Gates
Li, Y., Barrett, S. D., Stace, T. M., & Benjamin, S. C. (2010) · Physical Review Letters · doi:10.1103/physrevlett.105.250502 · Cited by 60
Efficient decoding of topological color codes
Sarvepalli, P. K., & Raussendorf, R. (2012) · Physical Review A · doi:10.1103/physreva.85.022317 · Cited by 51
Fault-Tolerant Topological One-Way Quantum Computation with Probabilistic Two-Qubit Gates
Fujii, K., & Tokunaga, Y. (2010) · Physical Review Letters · doi:10.1103/physrevlett.105.250503 · Cited by 46
Surface Code Threshold in the Presence of Correlated Errors
Novais, E., & Mucciolo, E. R. (2013) · Physical Review Letters · doi:10.1103/physrevlett.110.010502 · Cited by 40
High-threshold topological quantum error correction against biased noise
Stephens, A. M., Munro, W. J., & Nemoto, K. (2013) · Physical Review A · doi:10.1103/physreva.88.060301 · Cited by 34
Self-citationLocation and properties of the multicritical point in the Gaussian and ± J Ising spin glasses
de Queiroz, S. L. A. (2009) · Physical Review B · doi:10.1103/physrevb.79.174408 · Cited by 27
Accuracy threshold for concatenated error detection in one dimension
Stephens, A. M., & Evans, Z. W. E. (2009) · Physical Review A · doi:10.1103/physreva.80.022313 · Cited by 27
Self-citationFidelity of the surface code in the presence of a bosonic bath
Jouzdani, P., Novais, E., & Mucciolo, E. R. (2013) · Physical Review A · doi:10.1103/physreva.88.012336 · Cited by 13
Optimal correction of concatenated fault-tolerant quantum codes
Evans, Z. W. E., & Stephens, A. M. (2011) · Quantum Information Processing · doi:10.1007/s11128-011-0312-4 · Cited by 12
Self-citation
Flagged first, then by citations
Research works printed but not linked: 7
- P. Aliferis, 2006, Quantum Inf. Comput., 6, 97
- D. Aharonov, 1998, Proceedings of the 29th Annual ACM Symposium on the Theory of Computation
- K. M. Svore, 2007, Quantum Inf. Comput., 7, 297
- A. M. Stephens, 2008, Quantum Inf. Comput., 8, 330
- F. M. Spedalieri, 2009, Quantum Inf. Comput., 9, 666
- D. S. Wang, 2010, Quantum Inf. Comput., 10, 456
- G. Duclos-Cianci, 2014, Quantum Inf. Comput., 14, 721
Cited by
Sorted by citations
Quantum computational chemistry
McArdle, S., Endo, S., Aspuru-Guzik, A., Benjamin, S. C., & Yuan, X. (2020) · Reviews of Modern Physics · doi:10.1103/revmodphys.92.015003 · Cited by 1,621
Suppressing quantum errors by scaling a surface code logical qubit
Google Quantum, A. I., Acharya, R., Aleiner, I., Allen, R., Andersen, T. I., Ansmann, M., Arute, F., Arya, K., Asfaw, A., Atalaya, J., et al. (2023) · Nature · doi:10.1038/s41586-022-05434-1 · Cited by 1,103
Realizing repeated quantum error correction in a distance-three surface code
Krinner, S., Lacroix, N., Remm, A., Di Paolo, A., Genois, E., Leroux, C., Hellings, C., Lazar, S., Swiadek, F., Herrmann, J., et al. (2022) · Nature · doi:10.1038/s41586-022-04566-8 · Cited by 686
A Survey on quantum computing technology
Gyongyosi, L., & Imre, S. (2019) · Computer Science Review · doi:10.1016/j.cosrev.2018.11.002 · Cited by 646
Low-distance surface codes under realistic quantum noise
Tomita, Y., & Svore, K. M. (2014) · Physical Review A · doi:10.1103/physreva.90.062320 · Cited by 314
“Figure 2 shows the standard quantum circuit for measuring the stabilizers [1, 9], where data qubit b corresponds to the top (north) qubit and c corresponds to the bottom (south) qubit of each diamond patch in Fig.”
Background
Metadata
- Authors
- Stephens, A. M.
- Affiliations
- National Institute of Informatics (JP)
- Corresponding author
- Stephens, Ashley M.
- ORCID
- Stephens, Ashley M.
- Venue
- Physical Review A
- Publisher
- American Physical Society (APS)
- Published
- 2014-02-14
- Volume
- 89
- Issue
- 2
- ISSN
- 0556-2791 (ISSN-L)
- 1050-2947
- 1094-1622
- OpenAlex
- W2044503188
- Cited by
- 133
- References
- 52
- Citations by year
- 2026: 13 · 2025: 11 · 2024: 15 · 2023: 17 · 2022: 17 · 2021: 8 · 2020: 7 · 2019: 4 · 2018: 11 · 2017: 12 · 2016: 4 · 2015: 6 · 2014: 8
- FWCI
- 9.88
- Type
- journal article
- Language
- en
- Open access
- green
- arxiv.org
- Locations
- Physical Review A (publishedVersion)
- arXiv (Cornell University) (submittedVersion)
- arXiv (Cornell University)
- Topics
- Physical Sciences › Computer Science › Artificial Intelligence › Quantum Computing Algorithms and Architecture
- Physical Sciences › Physics and Astronomy › Atomic and Molecular Physics, and Optics › Quantum Information and Cryptography
- Physical Sciences › Physics and Astronomy › Atomic and Molecular Physics, and Optics › Quantum many-body systems
- Keywords
- surface code, fault-tolerant quantum computing, error threshold, quantum error correction, noise models, measurement circuit, decoding algorithms
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
