Low-overhead fault-tolerant quantum computing using long-range connectivity
Open accessThe DOI matches its Crossref record; 93 of the 93 references it cites were found in a registry or an index.
Abstract
Vast numbers of qubits will be needed for large-scale quantum computing because of the overheads associated with error correction. We present a scheme for low-overhead fault-tolerant quantum computation based on quantum low-density parity-check (LDPC) codes, where long-range interactions enable many logical qubits to be encoded with a modest number of physical qubits. In our approach, logic gates operate via logical Pauli measurements that preserve both the protection of the LDPC codes and the low overheads in terms of the required number of additional qubits. Compared with surface codes with the same code distance, we estimate order-of-magnitude improvements in the overheads for processing around 100 logical qubits using this approach. Given the high thresholds demonstrated by LDPC codes, our estimates suggest that fault-tolerant quantum computation at this scale may be achievable with a few thousand physical qubits at comparable error rates to what is needed for current approaches.
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
Figures








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
“As shown in Fig. 1c, extensions of the Tanner graph leveraging techniques by Cohen et al.50 enable fault-tolerant measurement operations involving an ancillary surface code.”
From High-threshold and low-overhead fault-tolerant quantum memory (2024) · cites this paper as Cohen et al.50
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 supremacy using a programmable superconducting processor
Arute, F., Arya, K., Babbush, R., Bacon, D., Bardin, J. C., Barends, R., Biswas, R., Boixo, S., Brandao, F. G. S. L., Buell, D. A., et al. (2019) · Nature · doi:10.1038/s41586-019-1666-5 · Cited by 7,720
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
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 · cited 4×
“These logical operations then yield a universal gate set for fault-tolerant quantum computing when supplemented with noisy ancilla state injection via magic-state distillation [50].”
BackgroundMethodInfluentialDennis, E., Kitaev, A., Landahl, A., & Preskill, J. (2001) · CERN Document Server (European Organization for Nuclear Research) · Cited by 1,485
Hamiltonian Simulation by Qubitization
Low, G. H., & Chuang, I. L. (2019) · Quantum · doi:10.22331/q-2019-07-12-163 · Cited by 854
How to factor 2048 bit RSA integers in 8 hours using 20 million noisy qubits
Gidney, C., & Ekerå, M. (2021) · Quantum · doi:10.22331/q-2021-04-15-433 · Cited by 830
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
Demonstration of a small programmable quantum computer with atomic qubits
Debnath, S., Linke, N. M., Figgatt, C., Landsman, K. A., Wright, K., & Monroe, C. (2016) · Nature · doi:10.1038/nature18648 · Cited by 777
Research works printed but not linked: 1
- B. J. Brown, K. Laubscher, M. S. Kesselring, J. R. Wootton, Poking holes and cutting corners to achieve clifford gates with the surface code. Phys. Rev. X 7, 021029 (2017).
Cited by
High-threshold and low-overhead fault-tolerant quantum memory
Bravyi, S., Cross, A. W., Gambetta, J. M., Maslov, D., Rall, P., & Yoder, T. J. (2024) · Nature · doi:10.1038/s41586-024-07107-7 · Cited by 456
“1c, extensions of the Tanner graph leveraging techniques by Cohen et al. 50 enable fault-tolerant measurement operations involving an ancillary surface code.”
MethodEncoding 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
Self-citationEarly Fault-Tolerant Quantum Computing
Katabarwa, A., Gratsea, K., Caesura, A., & Johnson, P. D. (2024) · PRX Quantum · doi:10.1103/prxquantum.5.020101 · Cited by 103
“For a specific quantum error correcting code and a noise model it is then left to prove and find error thresholds, with early works being [16–19]; this continues to be an active area of research [20–23].”
BackgroundConstant-Overhead Quantum Error Correction with Thin Planar Connectivity
Tremblay, M. A., Delfosse, N., & Beverland, M. E. (2022) · Physical Review Letters · doi:10.1103/physrevlett.129.050504 · Cited by 83
How to Wire a 1000 -Qubit Trapped-Ion Quantum Computer
Malinowski, M., Allcock, D. T. C., & Ballance, C. J. (2023) · PRX Quantum · doi:10.1103/prxquantum.4.040313 · Cited by 54
“For example, can we reduce the system resource cost if we specialize the WISE architecture for implementing a specific fault-tolerant quantum errorcorrection code, and if so, which quantum error correction code is optimal [94, 95]? What is the optimal chip size and connectivity for encoding logical qubits [96–98]? Doe…”
BackgroundImplementing Fault-tolerant Entangling Gates on the Five-qubit Code and the Color Code
Ryan-Anderson, C., Brown, N. C., Allman, M. S., Arkin, B., Asa-Attuah, G., Baldwin, C., Berg, J., Bohnet, J. G., Braxton, S., Burdick, N., et al. (2022) · arXiv · doi:10.48550/arxiv.2208.01863 · Cited by 38
Entangling Four Logical Qubits beyond Break-Even in a Nonlocal Code
Hong, Y., Durso-Sabina, E., Hayes, D., & Lucas, A. (2024) · Physical Review Letters · doi:10.1103/physrevlett.133.180601 · Cited by 29
Distance-preserving stabilizer measurements in hypergraph product codes
Manes, A. G., & Claes, J. (2025) · Quantum · doi:10.22331/q-2025-01-30-1618 · Cited by 17
Low-overhead quantum computing with the color code
Thomsen, F., Kesselring, M. S., Bartlett, S. D., & Brown, B. J. (2024) · Physical Review Research · doi:10.1103/physrevresearch.6.043125 · Cited by 15
Self-citationEfficient fault-tolerant code switching via one-way transversal CNOT gates
Heußen, S., & Hilder, J. (2025) · Quantum · doi:10.22331/q-2025-09-03-1846 · Cited by 12
Metadata
- Authors
- Cohen, L. Z., Kim, I. H., Bartlett, S. D., & Brown, B. J.
- Affiliations
- The University of Sydney (AU)
- Corresponding author
- Brown, Benjamin J.
- Venue
- Science Advances
- Published
- 2022-05-20
- Volume
- 8
- Issue
- 20
- Pages
- eabn1717-eabn1717
- ISSN
- 2375-2548 (ISSN-L)
- PMC
- PMC10926894
- OpenAlex
- W3205637696
- Cited by
- 98
- References
- 93
- Citations by year
- 2026: 16 · 2025: 39 · 2024: 27 · 2023: 11 · 2022: 5
- FWCI
- 6.72
- Type
- journal article
- Language
- en
- Open access
- gold
- doi.org
- Licence
- cc-by
- Locations
- Science Advances (publishedVersion, cc-by)
- PubMed Central (publishedVersion, cc-by)
- PubMed (publishedVersion)
- arXiv (Cornell University) (submittedVersion)
- eScholarship (California Digital Library) (submittedVersion)
- arXiv (Cornell University) (public-domain)
- Funders
- Australian Research Council (CE170100009)
- Army Research Office (W911NF-21-1-, W911NF-21-1-0007, 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 many-body systems
- Keywords
- fault-tolerant quantum computing, quantum LDPC codes, long-range interactions, logical qubit encoding, surface code, error correction overhead, fault-tolerant threshold
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
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.