CoChat

Demonstration of fault-tolerant universal quantum gate operations

Open access

The DOI matches its Crossref record; 52 of the 53 references it cites were found in a registry or an index, and 1 are not checked yet.

Abstract

Quantum computers can be protected from noise by encoding the logical quantum information redundantly into multiple qubits using error-correcting codes 1,2. When manipulating the logical quantum states, it is imperative that errors caused by imperfect operations do not spread uncontrollably through the quantum register. This requires that all operations on the quantum register obey a fault-tolerant circuit design 3-5, which, in general, increases the complexity of the implementation. Here we demonstrate a fault-tolerant universal set of gates on two logical qubits in a trapped-ion quantum computer. In particular, we make use of the recently introduced paradigm of flag fault tolerance, where the absence or presence of dangerous errors is heralded by the use of auxiliary flag qubits 6-10. We perform a logical two-qubit controlled-NOT gate between two instances of the seven-qubit colour code 11,12, and fault-tolerantly prepare a logical magic state 8,13. We then realize a fault-tolerant logical T gate by injecting the magic state by teleportation from one logical qubit onto the other 14. We observe the hallmark feature of fault tolerance-a superior performance compared with a non-fault-tolerant implementation. In combination with recently demonstrated repeated quantum error-correction cycles 15,16, these results provide a route towards error-corrected universal quantum computation.

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.

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

Integrity signals

Registry

Crossref · 10.1038/s41586-022-04721-1

Cites

52 of 53 references verified0 citation errors · 0 not checkable

Statistics

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.

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?

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

Show all 53 references

Research works printed but not linked: 1

  1. Ryan-Anderson, C. Quantum Algorithms, Architecture, and Error Correction. PhD thesis, The Univ. New Mexico (2018).

Cited by

See all 290

Metadata

Authors
Postler, L., Heuβen, S., Pogorelov, I., Rispler, M., Feldker, T., Meth, M., Marciniak, C. D., Stricker, R., Ringbauer, M., Blatt, R., Schindler, P., Müller, M., & Monz, T.
Affiliations
  • Universität Innsbruck (AT)
  • Forschungszentrum Jülich (DE)
  • Austrian Academy of Sciences (AT)
Corresponding author
Schindler, Philipp
Venue
Nature
Published
2022-05-25
Volume
605
Issue
7911
Pages
675-680
ISSN
  • 0028-0836 (ISSN-L)
  • 1476-4687
OpenAlex
W3216176305
Cited by
287
References
50
Citations by year
2026: 31 · 2025: 93 · 2024: 83 · 2023: 57 · 2022: 23
FWCI
21.05
Type
journal article
Language
en
Open access
Licence
Locations
  • Nature (publishedVersion)
  • PubMed (publishedVersion)
  • arXiv (Cornell University) (submittedVersion)
  • RePEc: Research Papers in Economics (submittedVersion)
  • RWTH Publications (RWTH Aachen) (submittedVersion)
  • arXiv (Cornell University)
  • Zenodo (CERN European Organization for Nuclear Research) (cc-by)
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 Mechanics and Applications
Keywords
fault-tolerant quantum computing, trapped-ion quantum computer, error correction, universal quantum gate set

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: Demonstration of fault-tolerant universal quantum gate operations. https://app.cochat.ai/papers/10.1038/s41586-022-04721-1
The paper
Postler, L., Heuβen, S., Pogorelov, I., Rispler, M., Feldker, T., Meth, M., Marciniak, C. D., Stricker, R., Ringbauer, M., Blatt, R., Schindler, P., Müller, M., & Monz, T. (2022). Demonstration of fault-tolerant universal quantum gate operations. Nature. https://doi.org/10.1038/s41586-022-04721-1

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.