Demonstration of fault-tolerant universal quantum gate operations
Open accessThe 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.
Integrity signals
Registry
Cites
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.
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?
The source backs part of the claim, not all of it — or backs it for a different population, condition or comparison.
In the citing paper
“As a result, error suppression by increasing the colour code size has not yet been demonstrated, to our knowledge, on any experimental platform.”
From Scaling and logic in the colour code on a superconducting quantum processor (2025) · cites this paper as [13]
Experimental — accuracy not yet measuredThe source backs part of the claim, not all of it — or backs it for a different population, condition or comparison.
In the citing paper
“This capability provides a route to robust logical qubit encodings at network nodes [64], separate communication and information processing functionalities within each node [5,21], and quantum repeaters requiring Bell state measurements and either purification or error correction [65].”
From Entanglement of Trapped-Ion Qubits Separated by 230 Meters (2023) · cites this paper as [64]
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.
Citations
Cites
Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer
Shor, P. W. (1997) · SIAM Journal on Computing · doi:10.1137/s0097539795293172 · Cited by 8,472
Quantum Computation and Quantum Information: 10th Anniversary Edition
Nielsen, M. A., & Chuang, I. L. (2012) · doi:10.1017/cbo9780511976667 · Cited by 8,436
Simulating physics with computers
Feynman, R. P. (1982) · International Journal of Theoretical Physics · doi:10.1007/bf02650179 · Cited by 7,691 · cited 1×
“Quantum computers promise to efficiently solve important computational tasks that are beyond the capabilities of classical computers, such as prime factorization or the simulation of complex quantum systems [1, 2].”
BackgroundQuantum Computation and Quantum Information: 10th Anniversary Edition
Nielsen, M. A., & Chuang, I. L. (2011) · Cited by 2,724
Universal quantum computation with ideal Clifford gates and noisy ancillas
Bravyi, S., & Kitaev, A. (2005) · Physical Review A · doi:10.1103/physreva.71.022316 · Cited by 1,525 · cited 1×
“This leads to the difficulty that to reach universal fault-tolerant computation at least one logical gate must be implemented by other means, such as magic state injection [10] or code switching [11].”
BackgroundQuantum error correction for quantum memories
Terhal, B. M. (2015) · Reviews of Modern Physics · doi:10.1103/revmodphys.87.307 · Cited by 1,354 · cited 8×
“SX (2) = X4X5X6X7 SZ (2) = Z4Z5Z6Z7 SX (3) = X2X3X6X7 SZ (3) = Z2Z3Z6Z7”
BackgroundInfluentialMultiple-particle interference and quantum error correction
(1996) · Proceedings of the Royal Society of London. Series A: Mathematical, Physical and Engineering Sciences · doi:10.1098/rspa.1996.0136 · Cited by 1,284 · cited 1×
“ T ψ Y T ψ = 1 2 | + i⟩ | ⟩ + | − i⟩exp i π 4 | ⟩ (12)”
Quantum computing with realistically noisy devices
Knill, E. (2005) · Nature · doi:10.1038/nature03350 · Cited by 1,184 · cited 1×
“Quantum state tomography of the experimentally prepared logical magic state is shown compared with the theoretical values in equation (41) in Fig.”
ResultPreskill, J. (1998) · Proceedings of the Royal Society of London. Series A: Mathematical, Physical and Engineering Sciences · doi:10.1098/rspa.1998.0167 · Cited by 994
Fault-tolerant quantum computation
Shor, P. W. (2002) · Proceedings of 37th Conference on Foundations of Computer Science · doi:10.1109/sfcs.1996.548464 · Cited by 892 · cited 6×
“SX (2) = X4X5X6X7 SZ (2) = Z4Z5Z6Z7 SX (3) = X2X3X6X7 SZ (3) = Z2Z3Z6Z7”
BackgroundInfluential
Research works printed but not linked: 1
- Ryan-Anderson, C. Quantum Algorithms, Architecture, and Error Correction. PhD thesis, The Univ. New Mexico (2018).
Cited by
Logical quantum processor based on reconfigurable atom arrays
Bluvstein, D., Evered, S. J., Geim, A. A., Li, S. H., Zhou, H., Manovitz, T., Ebadi, S., Cain, M., Kalinowski, M., Hangleiter, D., et al. (2024) · Nature · doi:10.1038/s41586-023-06927-3 · Cited by 1,119
The Variational Quantum Eigensolver: A review of methods and best practices
Tilly, J., Chen, H., Cao, S., Picozzi, D., Setia, K., Li, Y., Grant, E., Wossnig, L., Rungger, I., Booth, G. H., et al. (2022) · Physics Reports · doi:10.1016/j.physrep.2022.08.003 · Cited by 1,031
Cai, Z., Babbush, R., Benjamin, S. C., Endo, S., Huggins, W. J., Li, Y., McClean, J. R., & O’Brien, T. E. (2023) · Reviews of Modern Physics · doi:10.1103/revmodphys.95.045005 · Cited by 591
“Meanwhile other experiments have indeed demonstrated early-stage fault-tolerant potentials [see e.g. Abobeih et al. (2022); Egan et al. (2021); Google Quantum AI (2023); Krinner et al. (2022); Postler et al. (2022); Ryan-Anderson et al. (2022); and Takeda et al. (2022)].”
BackgroundFault-tolerant operation of a logical qubit in a diamond quantum processor
Abobeih, M. H., Wang, Y., Randall, J., Loenen, S. J. H., Bradley, C. E., Markham, M., Twitchen, D. J., Terhal, B. M., & Taminiau, T. H. (2022) · Nature · doi:10.1038/s41586-022-04819-6 · Cited by 230
Entanglement of Trapped-Ion Qubits Separated by 230 Meters
Krutyanskiy, V., Galli, M., Krcmarsky, V., Baier, S., Fioretto, D. A., Pu, Y., Mazloom, A., Sekatski, P., Canteri, M., Teller, M., et al. (2023) · Physical Review Letters · doi:10.1103/physrevlett.130.050803 · Cited by 217
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
- ORCID
- 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
- green
- arxiv.org
- Licence
- www.springer.com/tdm (tdm)
- www.springer.com/tdm (vor)
- 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.