The DOI matches its Crossref record; 53 of the 53 references it cites were found in a registry or an index.
Real-time quantum error correction beyond break-even
Open accessAbstract
The ambition of harnessing the quantum for computation is at odds with the fundamental phenomenon of decoherence. The purpose of quantum error correction (QEC) is to counteract the natural tendency of a complex system to decohere. This cooperative process, which requires participation of multiple quantum and classical components, creates a special type of dissipation that removes the entropy caused by the errors faster than the rate at which these errors corrupt the stored quantum information. Previous experimental attempts to engineer such a process^ 1 – 7 faced the generation of an excessive number of errors that overwhelmed the error-correcting capability of the process itself. Whether it is practically possible to utilize QEC for extending quantum coherence thus remains an open question. Here we answer it by demonstrating a fully stabilized and error-corrected logical qubit whose quantum coherence is substantially longer than that of all the imperfect quantum components involved in the QEC process, beating the best of them with a coherence gain of G = 2.27 ± 0.07. We achieve this performance by combining innovations in several domains including the fabrication of superconducting quantum circuits and model-free reinforcement learning. A study demonstrates the extension of a lifetime of a quantum memory using active quantum error correction and reinforcement learning.
Overview
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
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
“Our logical memory beyond breakeven extends previous results using bosonic codes16,35,36 to multiqubit codes, and it is a critical step towards logical operation breakeven.”
From Quantum error correction below the surface code threshold (2025) · cites this paper as [16]
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 [16]
In the citing paper
“Experiments demonstrating this exploitation at the single bosonic mode level have been performed using cat codes21–23,33–35, binominal codes36 and GKP codes37–39.”
From Hardware-efficient quantum error correction via concatenated bosonic qubits (2025) · cites this paper as [39]
In the citing paper
“Using a reinforcement learning agent21,22, we optimized the Gottesman–Kitaev–Preskill qutrit (ququart) as a ternary (quaternary) quantum memory and achieved beyond break-even error correction with a gain of 1.82 ± 0.03 (1.87 ± 0.03).”
From Quantum error correction of qudits beyond break-even (2025) · cites this paper as [22]
In the citing paper
“As with the GKP qubit22,33, we found longer lifetimes for the ‘Cartesian’ eigenstates of X3 and Z3 than for the remaining ‘diagonal’ eigenstates, as the latter were more susceptible to both cavity photon-loss errors and ancilla bit-flip errors33.”
From Quantum error correction of qudits beyond break-even (2025) · cites this paper as [22]
4 more claims about this paper
Create a free account to see every claim other papers make about this one.
Citations
Cites
Proximal Policy Optimization Algorithms
Schulman, J., Wolski, F., Dhariwal, P., Radford, A., & Klimov, O. (2017) · arXiv · doi:10.48550/arxiv.1707.06347 · Cited by 10,625 · cited 1×
“learning algorithm called proximal policy optimization (PPO) [25, 26].”
BackgroundScheme for reducing decoherence in quantum computer memory
Shor, P. W. (1995) · Physical Review A · doi:10.1103/physreva.52.r2493 · Cited by 4,479
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
Error Correcting Codes in Quantum Theory
Steane, A. M. (1996) · Physical Review Letters · doi:10.1103/physrevlett.77.793 · Cited by 2,677
Theory of quantum error-correcting codes
Knill, E., & Laflamme, R. (1997) · Physical Review A · doi:10.1103/physreva.55.900 · Cited by 1,593
Encoding a qubit in an oscillator
Gottesman, D., Kitaev, A., & Preskill, J. (2001) · Physical Review A · doi:10.1103/physreva.64.012310 · Cited by 1,532
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
Extending 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
Self-citationA simple formula for the average gate fidelity of a quantum dynamical operation
Nielsen, M. A. (2002) · Physics Letters A · doi:10.1016/s0375-9601(02)01272-0 · Cited by 725
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
Research works printed but not linked: 1
- Sutton, R. S. & Barto, A. G. Reinforcement Learning: an Introduction (MIT Press, 2018).
Cited by
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
“[16] for the surface code and train the prior on a “calibration dataset” of duration 13 cycles, which precedes the rest of the ex-periment.”
InfluentialSelf-citationBeating the break-even point with a discrete-variable-encoded logical qubit
Ni, Z., Li, S., Deng, X., Cai, Y., Zhang, L., Wang, W., Yang, Z.-B., Yu, H., Yan, F., Liu, S., et al. (2023) · Nature · doi:10.1038/s41586-023-05784-4 · Cited by 176
IBM quantum computers: evolution, performance, and future directions
AbuGhanem, M. (2025) · The Journal of Supercomputing · doi:10.1007/s11227-025-07047-7 · Cited by 336
High-Fidelity, Frequency-Flexible Two-Qubit Fluxonium Gates with a Transmon Coupler
Ding, L., Hays, M., Sung, Y., Kannan, B., An, J., Paolo, A. D., Karamlou, A. H., Hazard, T., Azar, K., Kim, D. K., et al. (2023) · Physical Review X · doi:10.1103/physrevx.13.031035 · Cited by 180
Encoding a magic state with beyond break-even fidelity
Gupta, R. S., Sundaresan, N., Alexander, T., Wood, C. J., Merkel, S. T., Healy, M. B., Hillenbrand, M., Jochym-O’Connor, T., Wootton, J. R., Yoder, T. J., et al. (2024) · Nature · doi:10.1038/s41586-023-06846-3 · Cited by 115
Metadata
- Authors
- Sivak, V. V., Eickbusch, A., Royer, B., Singh, S., Tsioutsios, I., Ganjam, S., Miano, A., Brock, B. L., Ding, A. Z., Frunzio, L., Girvin, S. M., Schoelkopf, R. J., & Devoret, M. H.
- Affiliations
- Google (United States) (US)
- Yale University (US)
- Université de Sherbrooke (CA)
- Corresponding author
- Sivak, V. V.
- Devoret, M. H.
- ORCID
- Venue
- Nature
- Published
- 2023-03-22
- Volume
- 616
- Issue
- 7955
- Pages
- 50-55
- ISSN
- 0028-0836 (ISSN-L)
- 1476-4687
- OpenAlex
- W4353055437
- Semantic Scholar
- aa1bad7cc4deec0b79f1678d7639dc841c36912d
- Cited by
- 407
- References
- 50
- Citations by year
- 2026: 89 · 2025: 160 · 2024: 106 · 2023: 52
- FWCI
- 38.37
- Type
- journal article
- Language
- en
- Open access
- green
- arxiv.org
- Licence
- www.springernature.com/gp/researchers/text-and-data-mining (tdm)
- www.springernature.com/gp/researchers/text-and-data-mining (vor)
- Locations
- Nature (publishedVersion)
- PubMed (publishedVersion)
- arXiv (Cornell University) (submittedVersion)
- RePEc: Research Papers in Economics (submittedVersion)
- OSTI OAI (U.S. Department of Energy Office of Scientific and Technical Information) (submittedVersion)
- arXiv (Cornell University)
- Funders
- Army Research Office (W911NF-18-1-0212, W911NF-16- 1-0349)
- 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, decoherence, logical qubits, quantum coherence, superconducting quantum circuits, reinforcement learning, energy dissipation
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: Real-time quantum error correction beyond break-even. https://app.cochat.ai/papers/10.1038/s41586-023-05782-6
- The paper
- Sivak, V. V., Eickbusch, A., Royer, B., Singh, S., Tsioutsios, I., Ganjam, S., Miano, A., Brock, B. L., Ding, A. Z., Frunzio, L., Girvin, S. M., Schoelkopf, R. J., & Devoret, M. H. (2023). Real-time quantum error correction beyond break-even. Nature. https://doi.org/10.1038/s41586-023-05782-6
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.