Quantum error correction of qudits beyond break-even
Open accessThe DOI matches its Crossref record; 65 of the 69 references it cites were found in a registry or an index; 14 of the 28 sources its claims cite were checked for support.
Abstract
Hilbert space dimension is a key resource for quantum information processing1,2. Not only is a large overall Hilbert space an essential requirement for quantum error correction, but a large local Hilbert space can also be advantageous for realizing gates and algorithms more efficiently3–7. As a result, there has been considerable experimental effort in recent years to develop quantum computing platforms using qudits (d-dimensional quantum systems with d > 2) as the fundamental unit of quantum information8–19. Just as with qubits, quantum error correction of these qudits will be necessary in the long run, but so far, error correction of logical qudits has not been demonstrated experimentally. Here we report the experimental realization of an error-corrected logical qutrit (d = 3) and ququart (d = 4), which was achieved with the Gottesman–Kitaev–Preskill bosonic code20. 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). This work represents a novel way of leveraging the large Hilbert space of a harmonic oscillator to realize hardware-efficient quantum error correction. Quantum error correction of a logical qutrit and ququart were experimentally realized beyond the break-even point with the Gottesman–Kitaev–Preskill bosonic code.
Overview
CoChat Summary
## TL;DR
The paper reports the experimental realization of error-corrected logical qudits beyond the qubit case: a logical qutrit and ququart encoded in a GKP bosonic code. Using reinforcement learning to optimize the error-correction protocol, the authors achieved beyond break-even quantum-memory performance with gains of 1.82 ± 0.03 for the qutrit and 1.87 ± 0.03 for the ququart.
## Key findings
- The experiment demonstrated experimental error correction of logical qudits with d > 2, specifically a logical qutrit (d = 3) and ququart (d = 4).
- The optimized logical qutrit outperformed the best physical qutrit in the system by a factor of 1.82 ± 0.03, and the optimized logical ququart outperformed the best physical ququart by 1.87 ± 0.03.
- The authors report that the QEC gain stayed roughly constant at about 1.8 as the logical GKP qudit dimension increased from 2 to 4.
- For the ququart, the paper says the QEC gain was “well beyond the break-even point,” and for the qutrit it says the gain was “well beyond the break-even point.”
## Methods
- Experimental platform: a tantalum transmon dispersively coupled to a three-dimensional superconducting microwave cavity; the cavity hosted the oscillator modes used for the logical GKP states.
- Code and protocol: the authors used the single-mode square GKP code and adapted the small-big-small (SBS) autonomous stabilization protocol; they optimized protocol parameters with a reinforcement learning agent.
- Evaluation: they prepared representative eigenstates, applied the optimized QEC protocol for varying numbers of rounds, measured output probabilities in generalized Pauli bases, and fit exponential decay to obtain effective decay rates and QEC gain.
## Limitations
- The paper states that the logical measurements and generalized controlled-Pauli gates were designed for the ideal code and “incur infidelity” when applied to the finite-energy code.
- The paper states that the optimized GKP qudits had more energy and thus were expected to suffer increased photon loss and dephasing as d increased; the discussion identifies cavity dephasing as the dominant source of logical error.
- Evident from the text: the work demonstrates only single-system memory error correction; the paper does not report full-scale multi-qudit computation or entangling-gate demonstrations here.
Model-written summary. Check it against the paper before relying on it.
Integrity signals
Registry
Cites
Statistics
Figures




Verification
Claims the paper makes
9 Valid · 0 Not valid · 5 Not checked · 26 Own results and interpretations
The sources with a verdict support this claim; the rest weren’t checked yet, have no full text we could read, or their verdicts aren’t rated yet.
In the 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.”
§ Quantum error correction of qudits beyond break-even > Logical qutrit beyond break-even
What the sources say
- Not checked — no full text of the sourcecites [22] Sivak, V. V. et al. Real-time quantum error correction beyond break-even. Nature 616, 50–55 (2023). source
- Supportedcites [33] Campagne-Ibarcq, P. et al. Quantum error correction of a qubit encoded in grid states of an oscillator. Nature 584, 368–372 (2020). source
The citation supports the sentence’s comparison with a GKP qubit, not the citing authors’ qutrit result. Section IV (p. 3) reports longer lifetimes for the square-code qubit’s X and Z eigenstates than for Y, and attributes Y’s shorter lifetime partly to photon dissipation. The supplement’s “Bit-flips of the transmon” section (p. 24) likewise gives a shorter bit-flip-limited lifetime for Y than for X and Z. (LLM, conf=0.91)
plainstates an association- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: unclear — It is unclear whether the paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
Every source the paper cites for this claim was checked and supports it.
In the paper
“Here we report the experimental realization of an error-corrected logical qutrit (d = 3) and ququart (d = 4), which was achieved with the Gottesman–Kitaev–Preskill bosonic code20.”
- Also stated in: § Main · boosted
“In this work we experimentally demonstrate QEC of logical qudits with d > 2, using the Gottesman–Kitaev–Preskill (GKP) bosonic code20 to realize a logical qutrit (d = 3) and ququart (d = 4) encoded in grid states of an oscillator.”
- Also stated in: § Discussion · boosted
“In summary, we have demonstrated QEC of logical qudits with d > 2, which represents a milestone achievement in the development of qudits for useful quantum technologies.”
§ Quantum error correction of qudits beyond break-even > Abstract
What the sources say
- Supportedcites [20] Gottesman, D., Kitaev, A. & Preskill, J. Encoding a qubit in an oscillator. Phys. Rev. A 64, 012310 (2001). source
The citation in the citing sentence identifies the Gottesman–Kitaev–Preskill code used in the citing authors’ own experiment; it does not attribute the experimental realization to this source. The Introduction (p. 1) describes the source’s error-correcting codes for finite-dimensional states encoded in oscillators, supporting that identification. (LLM, conf=0.93)
boostedstates a cause- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
- Also stated in: § Main · boosted
The cited sources support only part of this claim — read each source’s verdict below.
In the 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).”
- Also stated in: § Main · plain
“Our optimized GKP qutrit (ququart) lived longer, on average, than the best physical qutrit (ququart) available in our system by a factor of 1.82 ± 0.03 (1.87 ± 0.03), making this one of only a handful of experiments to beat the break-even point of QEC for quantum memories22,28–30.”
§ Quantum error correction of qudits beyond break-even > Abstract
What the sources say
- Partly supportedcites [21] Sivak, V. et al. Model-free quantum control with reinforcement learning. Phys. Rev. X 12, 011059 (2022). sourceExperimental — accuracy not yet measured
Section B, “Preparation of stabilizer states” (page unavailable), describes training a reinforcement-learning agent to prepare a GKP grid state. It does not report an optimized GKP ququart memory, beyond break-even error correction, or a gain of 1.87 ± 0.03. (LLM, conf=0.86)
- Not checked — no full text of the sourcecites [22] Sivak, V. V. et al. Real-time quantum error correction beyond break-even. Nature 616, 50–55 (2023). source
plainstates a cause- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
- Rests on an assumption not shown here.
- Also stated in: § Main · plain
The sources with a verdict support this claim; the rest weren’t checked yet, have no full text we could read, or their verdicts aren’t rated yet.
In the 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).”
- Also stated in: § Main · plain
“Our optimized GKP qutrit (ququart) lived longer, on average, than the best physical qutrit (ququart) available in our system by a factor of 1.82 ± 0.03 (1.87 ± 0.03), making this one of only a handful of experiments to beat the break-even point of QEC for quantum memories22,28–30.”
§ Quantum error correction of qudits beyond break-even > Abstract
What the sources say
- Supportedcites [21] Sivak, V. et al. Model-free quantum control with reinforcement learning. Phys. Rev. X 12, 011059 (2022). source
The citation is attached to “Using a reinforcement learning agent,” not to the citing authors’ reported qutrit gain. In “Preparation of stabilizer states” (page unavailable), the source describes training an agent to prepare a GKP state, supporting the cited method. The gain of 1.82 ± 0.03 is presented as the citing authors’ own result. (LLM, conf=0.90)
- Not checked — no full text of the sourcecites [22] Sivak, V. V. et al. Real-time quantum error correction beyond break-even. Nature 616, 50–55 (2023). source
plainstates a cause- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
- Rests on an assumption not shown here.
- Also stated in: § Main · plain
The cited sources support only part of this claim — read each source’s verdict below.
In the paper
“As our cavity dephasing was primarily due to the thermal population nth = 2.2 ± 0.1% of the transmon40, the lifetimes of our logical GKP qudits could be substantially improved by either reducing nth or using an ancilla that can be actively decoupled from the cavity when not in use49,50.”
§ Quantum error correction of qudits beyond break-even > Discussion
What the sources say
- Partly supportedcites [40] Reagor, M. et al. Quantum memory with millisecond coherence in circuit QED. Phys. Rev. B 94, 014506 (2016). sourceExperimental — accuracy not yet measured
Quantum Memory Characterization (pp. 4–5) finds that thermal excitation of the transmon accounts for the measured cavity dephasing. But the paper estimates its transmon’s equilibrium excited-state population at approximately 0.8%, not 2.2 ± 0.1%; it does not establish the quoted value for the citing authors’ cavity. (LLM, conf=0.88)
plainstates a cause- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
- Partly supported
15 more claims · 2 with their cited sources checked
Create a free account to see all 40 claims and to verify the 6 references still open.
- It may state two separate claims as one. 13
- Probably not a substantial claim. 10
- The quote only partly states this claim. 2
Citations
Cites
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
On-chip generation of high-dimensional entangled quantum states and their coherent control
Kues, M., Reimer, C., Roztocki, P., Cortés, L. R., Sciara, S., Wetzel, B., Zhang, Y., Cino, A., Chu, S. T., Little, B. E., et al. (2017) · Nature · doi:10.1038/nature22986 · Cited by 1,177 · cited 1×
“…considerable experimental effort has been spent in recent years on developing qudit-based platforms for quantum computing, using donor spins in silicon 8 , ultracold atoms and molecules 9,10 , optical photons 11,12 , superconducting circuits 13–15 , trapped ions 16,17 , and vacancy centers 18,19 .”
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-citationMultidimensional quantum entanglement with large-scale integrated optics
Wang, J., Paesani, S., Ding, Y., Santagati, R., Skrzypczyk, P., Salavrakos, A., Tura, J., Augusiak, R., Mančinska, L., Bacco, D., et al. (2018) · Science · doi:10.1126/science.aar7053 · Cited by 816
Negativity of the Wigner function as an indicator of non-classicality
Kenfack, A., & yczkowski, K. (2004) · Journal of Optics B: Quantum and Semiclassical Optics · doi:10.1088/1464-4266/6/10/003 · Cited by 779
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 · cited 2×
“Our optimized GKP qutrit (ququart) lived longer, on average, than the best physical qutrit (ququart) available in our system by a factor of 1.82 ± 0.03 (1.87 ± 0.03), making this one of only a handful of experiments to beat the break-even point of QEC for quantum memories 22,28–30 .”
InfluentialSelf-citationSchwinger, J. (1960) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.46.4.570 · Cited by 776
A 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
Place, A. P. M., Rodgers, L. V. H., Mundada, P., Smitham, B. M., Fitzpatrick, M., Leng, Z., Premkumar, A., Bryon, J., Vrajitoarea, A., Sussman, S., et al. (2021) · Nature Communications · doi:10.1038/s41467-021-22030-5 · Cited by 563
Qudits and High-Dimensional Quantum Computing
Wang, Y., Hu, Z., Sanders, B. C., & Kais, S. (2020) · Frontiers in Physics · doi:10.3389/fphy.2020.589504 · Cited by 478
Cited by
Quantum Machine Learning in Drug Discovery: Applications in Academia and Pharmaceutical Industries
Smaldone, A. M., Shee, Y., Kyro, G. W., Xu, C., Vu, N. P., Dutta, R., Farag, M. H., Galda, A., Kumar, S., Kyoseva, E. S., et al. (2025) · Chemical Reviews · doi:10.1021/acs.chemrev.4c00678 · Cited by 89
Quantum Technologies for Beyond 5G and 6G Networks: Applications, Opportunities, and Challenges
Zeydan, E., de Alwis, C., Khan, R., Türk, Y., Aydeger, A., Gadekallu, T. R., & Liyanage, M. (2025) · IEEE Open Journal of the Communications Society · doi:10.1109/ojcoms.2025.3591842 · Cited by 66
Liu, Y., Singh, S., Smith, K. C., Crane, E., Martyn, J. M., Eickbusch, A., Schuckert, A., Li, R. D., Sinanan-Singh, J., Soley, M. B., et al. (2025) · PRX Quantum · doi:10.1103/4rf7-9tfx · Cited by 169
Self-citationAdvancements in superconducting quantum computing
Jiang, Y.-Y., Deng, C., Fan, H., Li, B.-Y., Sun, L., Tan, X., Wang, W., Xue, G., Yan, F., Yu, H., et al. (2025) · National Science Review · doi:10.1093/nsr/nwaf246 · Cited by 83
A Perspective on Quantum Computing Applications in Quantum Chemistry Using 25–100 Logical Qubits
Alexeev, Y., Batista, V. S., Bauman, N. P., Bertels, L. W., Claudino, D., Dutta, R., Gagliardi, L., Godwin, S., Govind, N., Head‐Gordon, M., et al. (2025) · Journal of Chemical Theory and Computation · doi:10.1021/acs.jctc.5c01038 · Cited by 53
Metadata
- Authors
- Brock, B. L., Singh, S., Eickbusch, A., Sivak, V. V., Ding, A. Z., Frunzio, L., Girvin, S. M., & Devoret, M. H.
- Affiliations
- Yale University (US)
- Google (United States) (US)
- University of California, Santa Barbara (US)
- Corresponding author
- Brock, Benjamin L.
- Devoret, Michel H.
- ORCID
- Venue
- Nature
- Published
- 2025-05-14
- Volume
- 641
- Issue
- 8063
- Pages
- 612-618
- ISSN
- 0028-0836 (ISSN-L)
- 1476-4687
- PMC
- PMC12078179
- OpenAlex
- W4410362117
- Cited by
- 64
- References
- 69
- Citations by year
- 2026: 38 · 2025: 26
- FWCI
- 25.47
- Type
- journal article
- Language
- en
- Open access
- hybrid
- doi.org
- Licence
- cc-by-nc-nd
- creativecommons.org/licenses/by-nc-nd/4.0 (tdm)
- creativecommons.org/licenses/by-nc-nd/4.0 (vor)
- Locations
- Nature (publishedVersion, cc-by-nc-nd)
- PubMed Central (publishedVersion, cc-by-nc-nd)
- PubMed (publishedVersion)
- arXiv (Cornell University) (submittedVersion)
- RePEc: Research Papers in Economics (submittedVersion)
- arXiv (Cornell University)
- Funders
- U.S. Department of Energy (DE‐SC0012704, SC0012704.)
- Yale University
- Office of Science (DE-SC-0012704, SC0012704)
- Air Force Office of Scientific Research (FA9550-, FA9550-19-1-0399)
- Army Research Office (W911-NF-23-1-0051, W911NF)
- 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, qudits, qutrits, ququarts, Gottesman-Kitaev-Preskill code, bosonic codes, harmonic oscillator, reinforcement learning optimization, quantum memory
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.
The claim verdicts this report counts are experimental: their accuracy is not yet measured.
A language model drew the claims from the paper on 2026-10-10, under version 3 of the claim definition (model deepseek-v4.1-flash, prompt extract-v3).
A second model labelled each claim on 2026-10-10 (model jev-1.13-20260917, definition revision gold-guideline-v0.2).
Cited sources are checked with a language model’s help (gpt-6-sol).
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: Quantum error correction of qudits beyond break-even. https://app.cochat.ai/papers/10.1038/s41586-025-08899-y
- The paper
- Brock, B. L., Singh, S., Eickbusch, A., Sivak, V. V., Ding, A. Z., Frunzio, L., Girvin, S. M., & Devoret, M. H. (2025). Quantum error correction of qudits beyond break-even. Nature. https://doi.org/10.1038/s41586-025-08899-y
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.