Protecting expressive circuits with a quantum error detection code
Open accessThe DOI matches its Crossref record; 44 of the 44 references it cites were found in a registry or an index.
Abstract
A successful quantum error correction protocol would allow quantum computers to run algorithms without suffering from the effects of noise. However, fully fault-tolerant quantum error correction is too resource intensive for existing quantum computers. In this context, we develop a quantum error detection code for implementations on existing trapped-ion computers. By encoding k logical qubits into k + 2 physical qubits, this code presents fault-tolerant state-initialization and syndrome-measurement circuits that can detect any single-qubit error. It provides a universal set of local and global logical rotations that have physical support on only two qubits. A high-fidelity—although non fault-tolerant—compilation of this universal gate set is possible thanks to the two-qubit physical rotations present in trapped-ion computers with all-to-all connectivity. Given the particular structure of the logical operators, we nickname it the Iceberg code. We demonstrate the protection of circuits of eight logical qubits with up to 256 layers, saturate the logical quantum volume of 2^8 and show the positive effect of increasing the frequency of syndrome measurements in the circuit. These results illustrate the practical usefulness of the Iceberg code to protect expressive circuits on existing trapped-ion quantum computers. An error detecting code running on a trapped-ion quantum computer protects expressive circuits of eight logical qubits with a high-fidelity and partially fault-tolerant implementation of a universal gate set.
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 cited source says what the claim attributes to it.
In the citing paper
“Recent experiments have achieved milestone demonstrations of two logical qubits and one entangling gate5,6 and explorations of new encodings25–28.”
From Logical quantum processor based on reconfigurable atom arrays (2024) · cites this paper as [25]
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 Algorithm for Linear Systems of Equations
Harrow, A. W., Hassidim, A., & Lloyd, S. (2009) · Physical Review Letters · doi:10.1103/physrevlett.103.150502 · Cited by 3,325 · cited 1×
“ing quantum systems [3], solving large systems of equations [4], or factoring large numbers [5].”
A Quantum Approximate Optimization Algorithm
Farhi, E., Goldstone, J., & Gutmann, S. (2014) · arXiv · doi:10.48550/arxiv.1411.4028 · Cited by 1,789
Trapped-ion quantum computing: Progress and challenges
Bruzewicz, C. D., Chiaverini, J., McConnell, R., & Sage, J. M. (2019) · Applied Physics Reviews · doi:10.1063/1.5088164 · Cited by 1,483
Parameterized quantum circuits as machine learning models
Benedetti, M., Lloyd, E., Sack, S., & Fiorentini, M. (2019) · Quantum Science and Technology · doi:10.1088/2058-9565/ab4eb5 · Cited by 1,144
Self-citationSuppressing quantum errors by scaling a surface code logical qubit
Google Quantum, A. I., Acharya, R., Aleiner, I., Allen, R., Andersen, T. I., Ansmann, M., Arute, F., Arya, K., Asfaw, A., Atalaya, J., et al. (2023) · Nature · doi:10.1038/s41586-022-05434-1 · Cited by 1,103
Multiparticle Entanglement of Hot Trapped Ions
Mølmer, K., & Sørensen, A. (1999) · Physical Review Letters · doi:10.1103/physrevlett.82.1835 · Cited by 1,019
Goals and opportunities in quantum simulation
Cirac, J. I., & Zoller, P. (2012) · Nature Physics · doi:10.1038/nphys2275 · Cited by 891 · cited 1×
“In this regime, a useful quantum advantage is still expected for tasks such as the simulation of many-body quantum systems involving substantial amounts of entan-glement 14 or the sampling of classically intractable distributions 15,16 .”
How to factor 2048 bit RSA integers in 8 hours using 20 million noisy qubits
Gidney, C., & Ekerå, M. (2021) · Quantum · doi:10.22331/q-2021-04-15-433 · Cited by 830
Validating quantum computers using randomized model circuits
Cross, A. W., Bishop, L. S., Sheldon, S., Nation, P. D., & Gambetta, J. M. (2019) · Physical Review A · doi:10.1103/physreva.100.032328 · Cited by 704
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
A Race-Track Trapped-Ion Quantum Processor
Moses, S. A., Baldwin, C. H., Allman, M. S., Ancona, R., Ascarrunz, L., Barnes, C., Bartolotta, J., Bjork, B., Blanchard, P., Bohn, M., et al. (2023) · Physical Review X · doi:10.1103/physrevx.13.041052 · Cited by 391
Correlated Decoding of Logical Algorithms with Transversal Gates
Cain, M., Zhao, C., Zhou, H., Meister, N., Ataides, J. P. B., Jaffe, A. M., Bluvstein, D., & Lukin, M. D. (2024) · Physical Review Letters · doi:10.1103/physrevlett.133.240602 · Cited by 135
Large-scale quantum reservoir learning with an analog quantum computerPreprint
Kornjača, M., Hu, H.-Y., Zhao, C., Wurtz, J., Weinberg, P., Hamdan, M., Zhdanov, A., Cantu, S., Zhou, H., Bravo, R. A., et al. (2024) · arXiv (Cornell University) · doi:10.48550/arxiv.2407.02553 · Cited by 123
Demonstration of quantum computation and error correction with a tesseract codePreprint
Reichardt, B. W., Aasen, D., Chao, R., Chernoguzov, A., van Dam, W., Gaebler, J., Gresh, D., Lucchetti, D., Mills, M., Moses, S. A., et al. (2024) · arXiv (Cornell University) · doi:10.48550/arxiv.2409.04628 · Cited by 123
Metadata
- Authors
- Self, C. N., Benedetti, M., & Amaro, D.
- Corresponding author
- Self, Chris N.
- Benedetti, Marcello
- Amaro, David
- Venue
- Nature Physics
- Published
- 2024-01-05
- Volume
- 20
- Issue
- 2
- Pages
- 219-224
- ISSN
- 1745-2473 (ISSN-L)
- 1745-2481
- OpenAlex
- W4390615653
- Cited by
- 31
- References
- 44
- Citations by year
- 2026: 10 · 2025: 10 · 2024: 8
- FWCI
- 4.13
- Type
- journal article
- Language
- en
- Open access
- green
- arxiv.org
- Licence
- www.springernature.com/gp/researchers/text-and-data-mining (tdm)
- www.springernature.com/gp/researchers/text-and-data-mining (vor)
- Locations
- Nature Physics (publishedVersion)
- arXiv (Cornell University) (publishedVersion)
- arXiv (Cornell University)
- 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 many-body systems
- Keywords
- trapped-ion quantum computer, fault-tolerant quantum error correction, logical qubits, syndrome measurement, state initialization, quantum volume, all-to-all connectivity
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: Protecting expressive circuits with a quantum error detection code. https://app.cochat.ai/papers/10.1038/s41567-023-02282-2
- The paper
- Self, C. N., Benedetti, M., & Amaro, D. (2024). Protecting expressive circuits with a quantum error detection code. Nature Physics. https://doi.org/10.1038/s41567-023-02282-2
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.