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

Error Mitigation for Universal Gates on Encoded Qubits

Open access
Piveteau, Christophe, Sutter, David, Bravyi, Sergey, Gambetta, Jay M., Temme, Kristan·2021·Physical Review Letters

Abstract

The Eastin-Knill theorem states that no quantum error-correcting code can have a universal set of transversal gates. For Calderbank-Shor-Steane codes that can implement Clifford gates transversally, it suffices to provide one additional non-Clifford gate, such as the T gate, to achieve universality. Common methods to implement fault-tolerant T gates, e.g., magic state distillation, generate a significant hardware overhead that will likely prevent their practical usage in the near-term future. Recently, methods have been developed to mitigate the effect of noise in shallow quantum circuits that are not protected by error correction. Error mitigation methods require no additional hardware resources but suffer from a bad asymptotic scaling and apply only to a restricted class of quantum algorithms. In this Letter, we combine both approaches and show how to implement encoded Clifford+T circuits where Clifford gates are protected from noise by error correction while errors introduced by noisy encoded T gates are mitigated using the quasiprobability method. As a result, Clifford+T circuits with a number of T gates inversely proportional to the physical noise rate can be implemented on small error-corrected devices without magic state distillation. We argue that such circuits can be out of reach for state-of-the-art classical simulation algorithms.

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1103/physrevlett.127.200505

Cites

41 of 41 references verified0 citation errors · 0 not checkable

Statistics

Claims the paper makes

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

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?

  • Piveteau et al. mitigated the error for universal gates on programmed qubits.

    “Similarly, Piveteau etal. mitigated the error for universal gates on programmed qubits [55].”

    From Quantum Computing in the Next-Generation Computational Biology Landscape: From Protein Folding to Molecular Dynamics (2024) · cites this paper as [55]

    The paper states on p. 1 that it mitigates errors introduced by noisy encoded T-gates in encoded Clifford+T circuits, enabling a universal gate set. It discusses encoded qubits, not “programmed qubits,” and does not claim to mitigate errors in every gate of the set. (LLM, conf=0.86)

    Experimental — accuracy not yet measured

Self-check

Percentages, sums and reported differences re-computed from the paper’s own numbers.

The self-check needs the paper’s full text.

Cites

Flagged first, then by citations

Cited by

Sorted by citations

Authors
Piveteau, C., Sutter, D., Bravyi, S., Gambetta, J. M., & Temme, K.
Affiliations
  • ETH Zurich (CH)
  • IBM Research - Zurich (CH)
  • IBM (United States) (US)
Venue
Physical Review Letters
Published
2021-11-12
Volume
127
Issue
20
Pages
200505-200505
ISSN
  • 0031-9007 (ISSN-L)
  • 1079-7114
OpenAlex
W3135181313
Cited by
81
References
37
Citations by year
2026: 6 · 2025: 27 · 2024: 16 · 2023: 22 · 2022: 7 · 2021: 3
FWCI
4.24
Type
journal article
Language
en
Open access
Locations
  • Physical Review Letters (publishedVersion)
  • arXiv (Cornell University) (publishedVersion)
  • PubMed (publishedVersion)
  • arXiv (Cornell University) (submittedVersion)
  • arXiv (Cornell University)
Funders
  • Schweizerischer Nationalfonds zur Förderung der Wissenschaftlichen Forschung
  • National Center of Competence in Research Quantum Science and Technology
  • IBM Research Frontiers Institute
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
error mitigation, encoded qubits, Calderbank-Shor-Steane codes, Clifford+T circuits, transversal gates, T-gate, fault-tolerant quantum computing, shallow quantum circuits, magic state distillation, quantum error correction, classical simulation of 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