CoChat

Fault-Tolerant quantum computation with constant overhead

Gottesman, Daniel · 2014 · Quantum Information and Computation

The DOI matches its Crossref record; 44 of the 44 references it cites were found in a registry or an index.

Abstract

What is the minimum number of extra qubits needed to perform a large fault-tolerant quantum circuit? Working in a common model of fault-tolerance, I show that in the asymptotic limit of large circuits, the ratio of physical qubits to logical qubits can be a constant. The construction makes use of quantum low-density parity check codes, and the asymptotic overhead of the protocol is equal to that of the family of quantum error-correcting codes underlying the fault-tolerant protocol.

Overview

Integrity signals

Registry

Crossref · 10.26421/qic14.15-16-5

Cites

44 of 44 references verified0 citation errors · 0 not checkable

Statistics

Recomputing p-values needs the paper’s full text.

Verification

Claims the paper makes

This paper’s full text isn’t openly available, so its claims and self-check weren’t run. The registry and citation checks still apply.

Citations

Cites

Show all 44 references

Cited by

See all 172

Metadata

Authors
Gottesman, D.
Affiliations
Perimeter Institute (CA)
Corresponding author
Gottesman, Daniel
Venue
Quantum Information and Computation
Publisher
Rinton Press
Published
2014-11
Volume
14
Issue
15&16
Pages
1339-1371
ISSN
1533-7146 (ISSN-L)
OpenAlex
W1959392488
Cited by
172
References
40
Citations by year
2026: 15 · 2025: 36 · 2024: 25 · 2023: 16 · 2022: 14 · 2021: 15 · 2020: 11 · 2019: 13 · 2018: 8 · 2017: 5 · 2016: 6 · 2015: 7 · 2014: 1
FWCI
6.26
Type
journal article
Language
en
Open access
closed
Locations
Quantum Information and Computation (publishedVersion)
Funders
  • Government of Canada
  • Industry Canada
  • Institut Périmètre de physique théorique
  • Division of Mathematical Sciences
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 low-density parity-check codes, quantum error-correcting codes, quantum circuits

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: Fault-Tolerant quantum computation with constant overhead. https://app.cochat.ai/papers/10.26421/qic14.15-16-5
The paper
Gottesman, D. (2014). Fault-Tolerant quantum computation with constant overhead. Quantum Information and Computation. https://doi.org/10.26421/qic14.15-16-5

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.