Student or educator? Sign up with your school email and get 6 months of Pro free.
CoChat

The DOI matches its Crossref record; 77 of the 82 references it cites were found in a registry or an index; 22 of the 34 sources its claims cite were checked for support.

High-threshold and low-overhead fault-tolerant quantum memory

Open access

Abstract

The accumulation of physical errors 1–3 prevents the execution of large-scale algorithms in current quantum computers. Quantum error correction 4 promises a solution by encoding k logical qubits onto a larger number n of physical qubits, such that the physical errors are suppressed enough to allow running a desired computation with tolerable fidelity. Quantum error correction becomes practically realizable once the physical error rate is below a threshold value that depends on the choice of quantum code, syndrome measurement circuit and decoding algorithm 5 . We present an end-to-end quantum error correction protocol that implements fault-tolerant memory on the basis of a family of low-density parity-check codes 6 . Our approach achieves an error threshold of 0.7% for the standard circuit-based noise model, on par with the surface code 7–10 that for 20 years was the leading code in terms of error threshold. The syndrome measurement cycle for a length- n code in our family requires n ancillary qubits and a depth-8 circuit with CNOT gates, qubit initializations and measurements. The required qubit connectivity is a degree-6 graph composed of two edge-disjoint planar subgraphs. In particular, we show that 12 logical qubits can be preserved for nearly 1 million syndrome cycles using 288 physical qubits in total, assuming the physical error rate of 0.1%, whereas the surface code would require nearly 3,000 physical qubits to achieve said performance. Our findings bring demonstrations of a low-overhead fault-tolerant quantum memory within the reach of near-term quantum processors.

Overview

CoChat Summary

## TL;DR

The paper presents a family of bivariate bicycle (BB) LDPC quantum codes and an end-to-end fault-tolerant memory protocol with low overhead. In numerical simulations, the authors report an error threshold/pseudo-threshold of about 0.7% and show that a 12-logical-qubit code can be preserved for nearly 1 million syndrome cycles using 288 physical qubits at physical error rate 0.1%.

## Key findings

  • The proposed BB codes have weight-6 check operators, degree-6 Tanner graphs, and thickness 2, meaning their connectivity can be split into two edge-disjoint planar subgraphs.
  • The authors report an error threshold close to 0.7% for the standard circuit-based noise model, “on par with the surface code” and exceeding other high-rate LDPC codes known to them.
  • For the [[144, 12, 12]] code, they state a net encoding rate of 1/24 and that it can preserve 12 logical qubits for nearly 1 million syndrome cycles using 288 physical qubits at physical error rate 0.1%.
  • Compared with separate surface-code patches, they report about a 10× reduction in physical-qubit overhead for the distance-12 BB code in the example they analyze.

## Methods

  • The paper introduces bivariate bicycle (BB) stabilizer codes defined from pairs of bivariate polynomials/matrices \(A\) and \(B\), yielding CSS codes with \(n=2\ell m\) data qubits and six-qubit check operators.
  • They analyze code structure through the Tanner graph, proving results about connectivity, toric layouts, and thickness-2 planar decompositions of the graph.
  • Performance is evaluated with an end-to-end fault-tolerant memory protocol under a circuit-based noise model where each operation fails independently with probability \(p\), using a BP-OSD decoder adapted to circuit noise and numerical simulations of logical error rates.

## Limitations

  • The authors explicitly note that it remains unclear whether the code examples can be scaled up while retaining the high encoding rate in the limit of large code length.
  • They also state that optimization of the code layout satisfying specific hardware constraints is left for future work.
  • Evident from the text: the reported performance is based on numerical simulations and, for lower error rates, extrapolation/fitting, rather than a hardware demonstration.

Model-written summary. Check it against the paper before relying on it.

Integrity signals

Registry

Crossref · 10.1038/s41586-024-07107-7

Cites

77 of 77 references verified0 citation errors · 0 not checkable

Statistics

Nothing to recompute.

Figures

Fig. 1 Tanner graphs of surface and BB codes. a, Tanner graph of a surface code, for comparison. b, Tanner graph of a BB code with parameters [[144, 12, 12]] embedded into a torus. Any edge of the Tanner graph connects a data and a check vertex. Data qubits associated with the registers q(L) and q(R) are shown by blue and orange circles. Each vertex has six incident edges including four short-range edges (pointing north, south, east and west) and two long-range edges. We only show a few long-range edges to avoid clutter. Dashed and solid edges indicate two planar subgraphs spanning the Tanner graph, see the Methods. c, Sketch of a Tanner graph extension for measuring Z¯ and X¯ following ref. 50, attaching to a surface code. The ancilla corresponding to the X¯ measurement can be connected to a surface code, enabling load-store operations for all logical qubits by means of quantum teleportation and some logical unitaries. This extended Tanner graph also has an implementation in a thickness-2 architecture through the A and B edges (Methods).
Fig. 1 Tanner graphs of surface and BB codes. a, Tanner graph of a surface code, for comparison. b, Tanner graph of a BB code with parameters [[144, 12, 12]] embedded into a torus. Any edge of the Tanner graph connects a data and a check vertex. Data qubits associated with the registers q(L) and q(R) are shown by blue and orange circles. Each vertex has six incident edges including four short-range edges (pointing north, south, east and west) and two long-range edges. We only show a few long-range edges to avoid clutter. Dashed and solid edges indicate two planar subgraphs spanning the Tanner graph, see the Methods. c, Sketch of a Tanner graph extension for measuring Z¯ and X¯ following ref. 50, attaching to a surface code. The ancilla corresponding to the X¯ measurement can be connected to a surface code, enabling load-store operations for all logical qubits by means of quantum teleportation and some logical unitaries. This extended Tanner graph also has an implementation in a thickness-2 architecture through the A and B edges (Methods).CC BY · PubMed Central
Fig. 2 Syndrome measurement circuit. Full cycle of syndrome measurements relying on seven layers of CNOTs. We provide a local view of the circuit that only includes one data qubit from each register q(L) and q(R). The circuit is symmetric under horizontal and vertical shifts of the Tanner graph. Each data qubit is coupled by CNOTs with three X-check and three Z-check qubits: see the Methods for more details.
Fig. 2 Syndrome measurement circuit. Full cycle of syndrome measurements relying on seven layers of CNOTs. We provide a local view of the circuit that only includes one data qubit from each register q(L) and q(R). The circuit is symmetric under horizontal and vertical shifts of the Tanner graph. Each data qubit is coupled by CNOTs with three X-check and three Z-check qubits: see the Methods for more details.CC BY · PubMed Central
Fig. 3 Noise properties of BB codes. a, Logical versus physical error rate for small examples of BB LDPC codes. A numerical estimate of pL (diamonds) was obtained by simulating d syndrome cycles for a distance-d code. Most of the data points have error bars roughly equal to pL/10 due to sampling errors. b, Comparison between the BB LDPC code [[144, 12, 12]] and surface codes with 12 logical qubits and distance d ∈ {9, 11, 13, 15}. The distance-d surface code with 12 logical qubits has the length n = 12d2 because each logical qubit is encoded into a separate d × d patch of the surface code lattice.
Fig. 3 Noise properties of BB codes. a, Logical versus physical error rate for small examples of BB LDPC codes. A numerical estimate of pL (diamonds) was obtained by simulating d syndrome cycles for a distance-d code. Most of the data points have error bars roughly equal to pL/10 due to sampling errors. b, Comparison between the BB LDPC code [[144, 12, 12]] and surface codes with 12 logical qubits and distance d ∈ {9, 11, 13, 15}. The distance-d surface code with 12 logical qubits has the length n = 12d2 because each logical qubit is encoded into a separate d × d patch of the surface code lattice.CC BY · PubMed Central
Extended Data Fig. 1 Decomposition of the Tanner graph into planar graphs. Two different grids over a torus defined using different subsets of A1, A2, A3, B1, B2, B3. Edge labels indicate adjacency matrices that generate the respective edges. By extracting either horizontal or vertical strips from these grids, we obtain planar ‘wheel graphs’ whose union contains all edges in the Tanner graph. To avoid clutter, each grid shows only a subset of edges present in the Tanner graph. a, The A wheels (dashed lines) cover A2, A3, B3. b, The B wheels (solid lines) cover B1, B2, A1.
Extended Data Fig. 1 Decomposition of the Tanner graph into planar graphs. Two different grids over a torus defined using different subsets of A1, A2, A3, B1, B2, B3. Edge labels indicate adjacency matrices that generate the respective edges. By extracting either horizontal or vertical strips from these grids, we obtain planar ‘wheel graphs’ whose union contains all edges in the Tanner graph. To avoid clutter, each grid shows only a subset of edges present in the Tanner graph. a, The A wheels (dashed lines) cover A2, A3, B3. b, The B wheels (solid lines) cover B1, B2, A1.CC BY · PubMed Central
Extended Data Fig. 2 Navigating the Tanner graph. a, A ‘compass’ diagram that shows the direction in which matrices A and B are applied to travel between different nodes. b, The unit cell of the construction of a toric layout in the proof of Lemma 4.
Extended Data Fig. 2 Navigating the Tanner graph. a, A ‘compass’ diagram that shows the direction in which matrices A and B are applied to travel between different nodes. b, The unit cell of the construction of a toric layout in the proof of Lemma 4.CC BY · PubMed Central

Verification

Claims the paper makes

12 Valid · 9 Not valid · 10 Not checked · 61 Own results and interpretations

54 more claims · 2 with their cited sources checked

Create a free account to see all 92 claims and every source verdict.

See all claims — free account
  • Probably not a substantial claim. 23
  • It may state two separate claims as one. 12
  • The quote only partly states this claim. 2

Create a free account to see these claims.

Citations

Cites

Show all 82 references

Research works printed but not linked: 1

  1. Groszkowski, P., Fowler, A. & Stephens, A. M. High-threshold surface code quantum computing: threshold calculation. In Proc. APS March Meeting Abstracts W17–002 (APS, 2009).

Cited by

See all 456

Metadata

Authors
Bravyi, S., Cross, A. W., Gambetta, J. M., Maslov, D., Rall, P., & Yoder, T. J.
Affiliations
IBM (United States) (US)
Corresponding author
Maslov, Dmitri
Venue
Nature
Published
2024-03-27
Volume
627
Issue
8005
Pages
778-782
ISSN
  • 0028-0836 (ISSN-L)
  • 1476-4687
OpenAlex
W4393234688
Cited by
456
References
82
Citations by year
2026: 150 · 2025: 223 · 2024: 76
FWCI
65.98
Type
journal article
Language
en
Open access
Licence
Locations
  • Nature (publishedVersion, cc-by)
  • PubMed Central (publishedVersion, cc-by)
  • PubMed (publishedVersion)
  • arXiv (Cornell University) (submittedVersion)
  • RePEc: Research Papers in Economics (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
fault-tolerant quantum memory, quantum error correction, LDPC codes, error threshold, syndrome measurement, logical qubits, qubit connectivity, planar graphs

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: High-threshold and low-overhead fault-tolerant quantum memory. https://app.cochat.ai/papers/10.1038/s41586-024-07107-7
The paper
Bravyi, S., Cross, A. W., Gambetta, J. M., Maslov, D., Rall, P., & Yoder, T. J. (2024). High-threshold and low-overhead fault-tolerant quantum memory. Nature. https://doi.org/10.1038/s41586-024-07107-7

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.