The DOI matches its Crossref record; 61 of the 61 references it cites were found in a registry or an index.
Realizing repeated quantum error correction in a distance-three surface code
Open accessPublished version of a preprint
Abstract
Quantum computers hold the promise of solving computational problems that are intractable using conventional methods1. For fault-tolerant operation, quantum computers must correct errors occurring owing to unavoidable decoherence and limited control accuracy2. Here we demonstrate quantum error correction using the surface code, which is known for its exceptionally high tolerance to errors3–6. Using 17 physical qubits in a superconducting circuit, we encode quantum information in a distance-three logical qubit, building on recent distance-two error-detection experiments7–9. In an error-correction cycle taking only 1.1 μs, we demonstrate the preservation of four cardinal states of the logical qubit. Repeatedly executing the cycle, we measure and decode both bit-flip and phase-flip error syndromes using a minimum-weight perfect-matching algorithm in an error-model-free approach and apply corrections in post-processing. We find a low logical error probability of 3% per cycle when rejecting experimental runs in which leakage is detected. The measured characteristics of our device agree well with a numerical model. Our demonstration of repeated, fast and high-performance quantum error-correction cycles, together with recent advances in ion traps10, support our understanding that fault-tolerant quantum computation will be practically realizable. By using 17 physical qubits in a superconducting circuit to encode quantum information in a surface-code logical qubit, fast (1.1 μs) and high-performance (logical error probability of 3%) quantum error-correction cycles are demonstrated.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
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?
The cited source says what the claim attributes to it.
In the citing paper
“Overall, we find that addressing leakage is crucial for operating surface codes with transmon qubits15,32,38.”
From Quantum error correction below the surface code threshold (2025) · cites this paper as [15]
The cited source says what the claim attributes to it.
In the citing paper
“Although many platforms have demonstrated different features of quantum error correction14–20, no quantum processor has definitively shown below-threshold performance.”
From Quantum error correction below the surface code threshold (2025) · cites this paper as [15]
The cited source says what the claim attributes to it.
In the citing paper
“Recently, QEC experiments have been performed in various hardware platforms, including superconducting quantum circuits25–28, trapped ions29 and neutral atoms30.”
From Hardware-efficient quantum error correction via concatenated bosonic qubits (2025) · cites this paper as [25]
The cited source says what the claim attributes to it.
In the citing paper
“Correcting for both types of error requires QEC codes such as the surface code25–27, which have a relatively high overhead penalty1.”
From Hardware-efficient quantum error correction via concatenated bosonic qubits (2025) · cites this paper as [25]
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
Quantum Computing in the NISQ era and beyond
Preskill, J. (2018) · Quantum · doi:10.22331/q-2018-08-06-79 · Cited by 8,830 · cited 1×
“Quantum computers hold the promise of solving computational problems which are intractable using conventional methods [1].”
BackgroundFault-tolerant quantum computation by anyons
Kitaev, A. Y. (2003) · Annals of Physics · doi:10.1016/s0003-4916(02)00018-0 · Cited by 7,238 · cited 1×
“The surface code [4, 11] is a planar realization of Kitaev’s toric code [3] which uses topological features of a qubit lattice to correct errors in quantum information processing systems.”
BackgroundCharge-insensitive qubit design derived from the Cooper pair box
Koch, J., Yu, T. M., Gambetta, J., Houck, A. A., Schuster, D. I., Majer, J., Blais, A., Devoret, M. H., Girvin, S. M., & Schoelkopf, R. J. (2007) · Physical Review A · doi:10.1103/physreva.76.042319 · Cited by 3,351 · cited 1×
“We realized this arrangement in a superconducting circuit using 17 transmon qubits [30] (yellow) capacitively coupled to each other along the edges of the square array with ∼ 1 mm long coplanar waveguide segments (turquoise), see Fig.”
MethodSelf-citationSurface 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
Dennis, E., Kitaev, A., Landahl, A., & Preskill, J. (2002) · Journal of Mathematical Physics · doi:10.1063/1.1499754 · Cited by 1,768 · cited 2×
“We collectively process successive syndromes σm to determine which data and auxiliary qubits have most likely suffered an error [4, 14, 31].”
BackgroundMethodQuantum error correction for quantum memories
Terhal, B. M. (2015) · Reviews of Modern Physics · doi:10.1103/revmodphys.87.307 · Cited by 1,354 · cited 4×
“We collectively process successive syndromes σm to determine which data and auxiliary qubits have most likely suffered an error [4, 14, 31].”
BackgroundMethodInfluentialExtending the lifetime of a quantum bit with error correction in superconducting circuits
Ofek, N., Petrenko, A., Heeres, R., Reinhold, P., Leghtas, Z., Vlastakis, B., Liu, Y., Frunzio, L., Girvin, S. M., Jiang, L., et al. (2016) · Nature · doi:10.1038/nature18949 · Cited by 941
State preservation by repetitive error detection in a superconducting quantum circuit
Kelly, J., Barends, R., Fowler, A. G., Megrant, A., Jeffrey, E., White, T. C., Sank, D., Mutus, J. Y., Campbell, B., Chen, Y., et al. (2015) · Nature · doi:10.1038/nature14270 · Cited by 916
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 · cited 2×
“The number of required cycles scales in general with d in planar architectures and in architectures allowing for transversal execution of logical two-qubit gates [5, 6, 23, 52, 53].”
Background
Research works printed but not linked: 5
- Shor, P. W. Fault-tolerant quantum computation. In Proc. 37th Conference on Foundations of Computer Science 56 pp (IEEE, 1996).
- Gottesman, D. Stabilizer Codes and Quantum Error Correction. PhD thesis, California Institute of Technology (1997).
- Aliferis, P. & Terhal, B. M. Fault-tolerant quantum computation for local leakage faults. Quantum Inf. Comput. 7, 139–156 (2007).
- Suchara, M., Cross, A. W. & Gambetta, J. M. Leakage suppression in the toric code. Quantum Inf. Comput. 15, 997–1016 (2015).
- Landahl, A. J. & Ryan-Anderson, C. Quantum computing by color-code lattice surgery. Preprint at https://arxiv.org/abs/1407.5103 (2014). · arXiv
Cited by
Logical quantum processor based on reconfigurable atom arrays
Bluvstein, D., Evered, S. J., Geim, A. A., Li, S. H., Zhou, H., Manovitz, T., Ebadi, S., Cain, M., Kalinowski, M., Hangleiter, D., et al. (2024) · Nature · doi:10.1038/s41586-023-06927-3 · Cited by 1,119
“For this reason, deep circuits require repetitive error correction 6,88 to constantly remove errors and continuously benefit from, for example, the p 2 suppression.”
BackgroundSuppressing 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
The Variational Quantum Eigensolver: A review of methods and best practices
Tilly, J., Chen, H., Cao, S., Picozzi, D., Setia, K., Li, Y., Grant, E., Wossnig, L., Rungger, I., Booth, G. H., et al. (2022) · Physics Reports · doi:10.1016/j.physrep.2022.08.003 · Cited by 1,031
Quantum error correction below the surface code threshold
Collaborators, G. Q. A. A., Acharya, R., Abanin, D. A., Aghababaie-Beni, L., Aleiner, I., Andersen, T. I., Ansmann, M., Arute, F., Arya, K., Asfaw, A., et al. (2025) · Nature · doi:10.1038/s41586-024-08449-y · Cited by 778
“Overall, we find that addressing leakage is crucial to operating surface codes with transmon qubits [15, 33, 39].”
Cai, Z., Babbush, R., Benjamin, S. C., Endo, S., Huggins, W. J., Li, Y., McClean, J. R., & O’Brien, T. E. (2023) · Reviews of Modern Physics · doi:10.1103/revmodphys.95.045005 · Cited by 591
“Meanwhile other experiments have indeed demonstrated early-stage fault-tolerant potentials [see e.g. Abobeih et al. (2022); Egan et al. (2021); Google Quantum AI (2023); Krinner et al. (2022); Postler et al. (2022); Ryan-Anderson et al. (2022); and Takeda et al. (2022)].”
Background
Metadata
- Authors
- Krinner, S., Lacroix, N., Remm, A., Di Paolo, A., Genois, E., Leroux, C., Hellings, C., Lazar, S., Swiadek, F., Herrmann, J., Norris, G. J., Andersen, C. K., Müller, M., Blais, A., Eichler, C., & Wallraff, A.
- Affiliations
- ETH Zurich (CH)
- Université de Sherbrooke (CA)
- Forschungszentrum Jülich (DE)
- Canadian Institute for Advanced Research (CA)
- Corresponding author
- Krinner, Sebastian
- ORCID
- Venue
- Nature
- Published
- 2022-05-25
- Volume
- 605
- Issue
- 7911
- Pages
- 669-674
- ISSN
- 0028-0836 (ISSN-L)
- 1476-4687
- OpenAlex
- W4200634137
- Semantic Scholar
- b2a57179e23d49b7c2ffe1ffb7fbb0713249d68f
- Cited by
- 686
- References
- 57
- Citations by year
- 2026: 117 · 2025: 214 · 2024: 168 · 2023: 146 · 2022: 40
- FWCI
- 46.75
- Type
- journal article
- Language
- en
- Open access
- green
- arxiv.org
- Licence
- www.springer.com/tdm (tdm)
- www.springer.com/tdm (vor)
- Locations
- Nature (publishedVersion)
- PubMed (publishedVersion)
- arXiv (Cornell University) (submittedVersion)
- RePEc: Research Papers in Economics (submittedVersion)
- RWTH Publications (RWTH Aachen) (submittedVersion)
- Repository for Publications and Research Data (ETH Zurich) (submittedVersion, cc-by)
- arXiv (Cornell University)
- ETH Zürich Research Collection
- 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 Mechanics and Applications
- Keywords
- quantum error correction, surface code, superconducting qubits, fault-tolerant quantum computing, minimum-weight perfect matching, error syndromes
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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Realizing repeated quantum error correction in a distance-three surface code. https://app.cochat.ai/papers/10.1038/s41586-022-04566-8
- The paper
- Krinner, S., Lacroix, N., Remm, A., Di Paolo, A., Genois, E., Leroux, C., Hellings, C., Lazar, S., Swiadek, F., Herrmann, J., Norris, G. J., Andersen, C. K., Müller, M., Blais, A., Eichler, C., & Wallraff, A. (2022). Realizing repeated quantum error correction in a distance-three surface code. Nature. https://doi.org/10.1038/s41586-022-04566-8
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.