Cited by 159Quantum Computing Algorithms and ArchitectureQuantum Information and CryptographyCoding theory and cryptography

Flag fault-tolerant error correction with arbitrary distance codes

Open access
Chamberland, Christopher, Beverland, Michael E.·2018·Quantum

Abstract

In this paper we introduce a general fault-tolerant quantum error correction protocol using flag circuits for measuring stabilizers of arbitrary distance codes. In addition to extending flag error correction beyond distance-three codes for the first time, our protocol also applies to a broader class of distance-three codes than was previously known. Flag circuits use extra ancilla qubits to signal when errors resulting from v faults in the circuit have weight greater than v . The flag error correction protocol is applicable to stabilizer codes of arbitrary distance which satisfy a set of conditions and uses fewer qubits than other schemes such as Shor, Steane and Knill error correction. We give examples of infinite code families which satisfy these conditions and analyze the behaviour of distance-three and -five examples numerically. Requiring fewer resources than Shor error correction, flag error correction could potentially be used in low-overhead fault-tolerant error correction protocols using low density parity check quantum codes of large code length.

Integrity signals

Registry

Crossref · 10.22331/q-2018-02-08-53

Cites

8 of 8 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?

  • To detect errors and perform corrections, often additional auxiliary qubits are used, increasing the actual number of physical qubits required for QEC.

    “To detect errors and perform corrections, often additional auxiliary qubits are being used.Thus, the actual number of physical qubits required for QEC is increased further [59,60].”

Cites

Flagged first, then by citations

Cited by

Sorted by citations

Authors
Chamberland, C., & Beverland, M. E.
Affiliations
  • University of Waterloo (CA)
  • Microsoft (United States) (US)
Venue
Quantum
Published
2018-02-08
Volume
2
Pages
53
ISSN
2521-327X (ISSN-L)
OpenAlex
W2744938842
Cited by
159
References
8
Citations by year
2026: 13 · 2025: 26 · 2024: 25 · 2023: 18 · 2022: 18 · 2021: 19 · 2020: 17 · 2019: 13 · 2018: 9 · 2017: 1
FWCI
8.16
Type
journal article
Language
en
Open access
Locations
  • Quantum (publishedVersion, cc-by)
  • arXiv (Cornell University) (acceptedVersion)
  • DOAJ (DOAJ: Directory of Open Access Journals) (submittedVersion, cc-by-sa)
  • arXiv (Cornell University) (cc-by)
Topics
  • Physical Sciences › Computer Science › Artificial Intelligence › Quantum Computing Algorithms and Architecture
  • Physical Sciences › Computer Science › Artificial Intelligence › Quantum Information and Cryptography
  • Physical Sciences › Computer Science › Artificial Intelligence › Coding theory and cryptography
Keywords
fault-tolerant quantum error correction, stabilizer codes, ancilla qubits, LDPC codes, quantum error-correcting codes

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