Cited by 137Quantum Computing Algorithms and ArchitectureQuantum Information and CryptographyQuantum many-body systems

Fault-tolerant quantum computation with few qubits

Open access
Chao, Rui, Reichardt, Ben W.·2018·npj Quantum Information

Abstract

Reliable qubits are difficult to engineer, but standard fault-tolerance schemes use seven or more physical qubits to encode each logical qubit, with still more qubits required for error correction. The large overhead makes it hard to experiment with fault-tolerance schemes with multiple encoded qubits. Here, we study the 15-qubit Hamming code, which protects seven encoded qubits to distance three. We give fault-tolerant procedures for applying arbitrary Clifford operations on these encoded qubits, using only two extra qubits, 17 in total. In particular, individual encoded qubits within the code block can be targeted. Fault-tolerant universal computation is possible with four extra qubits, 19 in total. The procedures could enable testing more sophisticated protected circuits in small-scale quantum devices. Our main technique is to use gadgets to protect gates against correlated faults. We also take advantage of special code symmetries, and use pieceable fault tolerance.

Integrity signals

Registry

Crossref · 10.1038/s41534-018-0085-z

Cites

4 of 4 references verified0 citation errors · 0 not checkable

Statistics

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

Claims the paper makes

We couldn’t retrieve this paper’s full text, so its claims and self-check weren’t run. The registry and citation checks still apply.

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?

  • If several layers of encoding are implemented, the qubit overhead multiplies and up to thousands of physical qubits might be needed to encode one logical qubit.

    “Moreover, if several layers of encoding are implemented, the qubit overhead multiplies and up to thousands of physical qubits might be needed to encode one logical qubit [61].”

Cites

Flagged first, then by citations

Cited by

Sorted by citations

Authors
Chao, R., & Reichardt, B. W.
Affiliations
University of Southern California (US)
Corresponding author
Chao, Rui
Venue
npj Quantum Information
Published
2018-09-12
Volume
4
Issue
1
ISSN
2056-6387 (ISSN-L)
OpenAlex
W2616847007
Cited by
137
References
4
Citations by year
2026: 10 · 2025: 20 · 2024: 14 · 2023: 17 · 2022: 18 · 2021: 16 · 2020: 25 · 2019: 11 · 2018: 5 · 2017: 1
FWCI
8.02
Type
journal article
Language
en
Open access
Locations
  • npj Quantum Information (publishedVersion, cc-by)
  • arXiv (Cornell University) (submittedVersion)
  • DOAJ (DOAJ: Directory of Open Access Journals) (submittedVersion)
  • arXiv (Cornell University)
Funders
  • National Science Foundation (CCF-1254119)
  • DOD | Army Research Office (W911NF-12-1-0541)
Topics
  • Physical Sciences › Computer Science › Artificial Intelligence › Quantum Computing Algorithms and Architecture
  • Physical Sciences › Computer Science › Artificial Intelligence › Quantum Information and Cryptography
  • Physical Sciences › Physics and Astronomy › Atomic and Molecular Physics, and Optics › Quantum many-body systems
Keywords
fault-tolerant quantum computing, Hamming codes, encoded qubits, Clifford operations

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