Minimizing resource overheads for fault-tolerant preparation of encoded states of the Steane code
Open accessThe DOI matches its Crossref record; 25 of the 25 references it cites were found in a registry or an index.
Abstract
The seven-qubit quantum error-correcting code originally proposed by Steane is one of the best known quantum codes. The Steane code has a desirable property that most basic operations can be performed easily in a fault-tolerant manner. A major obstacle to fault-tolerant quantum computation with the Steane code is fault-tolerant preparation of encoded states, which requires large computational resources. Here we propose efficient state preparation methods for zero and magic states encoded with the Steane code, where the zero state is one of the computational basis states and the magic state allows us to achieve universality in fault-tolerant quantum computation. The methods minimize resource overheads for the fault-tolerant state preparation and therefore reduce necessary resources for quantum computation with the Steane code. Thus, the present results will open a new possibility for efficient fault-tolerant 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
Figures





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
“The d = 3 code initialization is a special case that does not suffer from this issue38.”
From Logical quantum processor based on reconfigurable atom arrays (2024) · cites this paper as [38]
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
Quantum Computation and Quantum Information
Nielsen, M. A., Chuang, I., & Grover, L. K. (2002) · American Journal of Physics · doi:10.1119/1.1463744 · Cited by 21,895
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
Surface codes: Towards practical large-scale quantum computation
Fowler, A. G., Mariantoni, M., Martinis, J. M., & Cleland, A. N. (2012) · Physical Review A · doi:10.1103/physreva.86.032324 · Cited by 3,059 · cited 1×
“A standard approach to this problem is to use quantum error-correcting codes for fault tolerance 1,5–9 .”
MethodError Correcting Codes in Quantum Theory
Steane, A. M. (1996) · Physical Review Letters · doi:10.1103/physrevlett.77.793 · Cited by 2,677
Quantum Support Vector Machine for Big Data Classification
Rebentrost, P., Mohseni, M., & Lloyd, S. (2014) · Physical Review Letters · doi:10.1103/physrevlett.113.130503 · Cited by 1,951
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 3×
“A recent standard approach to fault-tolerant preparation of encoded magic states is based on magic state distillation 11,19–23 .”
BackgroundImproved simulation of stabilizer circuits
Aaronson, S., & Gottesman, D. (2004) · Physical Review A · doi:10.1103/physreva.70.052328 · Cited by 1,515
Quantum computing with realistically noisy devices
Knill, E. (2005) · Nature · doi:10.1038/nature03350 · Cited by 1,184 · cited 2×
“The Steane code is a [[7,1,3]] stabilizer code, where [[n,k,d]] means that k qubits are encoded into n qubits and the code distance is d.”
BackgroundMethodFault-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
Fault-Tolerant Quantum Computation with High Threshold in Two Dimensions
Raussendorf, R., & Harrington, J. (2007) · Physical Review Letters · doi:10.1103/physrevlett.98.190504 · Cited by 812
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
“38, in which, instead of the eight-gate encoding circuit, we use a nine-gate encoding circuit that is more conveniently mapped to specific atom movements in our system (corresponding to graph-state preparation similar to ref.”
BackgroundMethodInfluentialRealization of Real-Time Fault-Tolerant Quantum Error Correction
Ryan-Anderson, C., Bohnet, J. G., Lee, K., Gresh, D., Hankin, A., Gaebler, J. P., Francois, D., Chernoguzov, A., Lucchetti, D., Brown, N. C., et al. (2021) · Physical Review X · doi:10.1103/physrevx.11.041058 · Cited by 306
Demonstration of fault-tolerant universal quantum gate operations
Postler, L., Heuβen, S., Pogorelov, I., Rispler, M., Feldker, T., Meth, M., Marciniak, C. D., Stricker, R., Ringbauer, M., Blatt, R., et al. (2022) · Nature · doi:10.1038/s41586-022-04721-1 · Cited by 287
“R R Y ≡ (π/2) = exp −i π 4 (13) Y ”
Flag fault-tolerant error correction with arbitrary distance codes
Chamberland, C., & Beverland, M. E. (2018) · Quantum · doi:10.22331/q-2018-02-08-53 · Cited by 159
Demonstration of Fault-Tolerant Steane Quantum Error Correction
Postler, L., Butt, F., Pogorelov, I., Marciniak, C. D., Heußen, S., Blatt, R., Schindler, P., Rispler, M., Müller, M., & Monz, T. (2024) · PRX Quantum · doi:10.1103/prxquantum.5.030326 · Cited by 66
“A single flag qubit is used to verify the prepared logical state such that unsuccessful preparations can be discarded [9, 35] analogous to usage in the distance-5 repetition code.”
BackgroundMethodHigh-fidelity teleportation of a logical qubit using transversal gates and lattice surgery
Ryan-Anderson, C., Brown, N. C., Baldwin, C. H., Dreiling, J. M., Foltz, C., Gaebler, J. P., Gatterman, T. M., Hewitt, N., Holliman, C., Horst, C. V., et al. (2024) · Science · doi:10.1126/science.adp6016 · Cited by 52
Variational Circuit Compiler for Quantum Error Correction
Xu, X., Benjamin, S. C., & Yuan, X. (2021) · Physical Review Applied · doi:10.1103/physrevapplied.15.034068 · Cited by 36
“This circuit can also be fault tolerant given three additional two-qubit gates and one ancilla qubit [49], as shown in Fig.”
BackgroundMethodInfluentialVariational circuit compiler for quantum error correction
Xu, X., Benjamin, S. C., & Yuan, X. (2019) · arXiv · doi:10.48550/arxiv.1911.05759 · Cited by 36
Fault-Tolerant One-Bit Addition with the Smallest Interesting Colour Code
Wang, Y., Simsek, S., Gatterman, T. M., Gerber, J. A., Gilmore, K., Gresh, D., Hewitt, N., Horst, C. V., Matheny, M., Mengle, T., et al. (2023) · arXiv · doi:10.48550/arxiv.2309.09893 · Cited by 32
Efficient Magic State Distillation by Zero-Level Distillation
(2025) · doi:10.1103/thxx-njr6 · Cited by 22
Efficient fault-tolerant code switching via one-way transversal CNOT gates
Heußen, S., & Hilder, J. (2025) · Quantum · doi:10.22331/q-2025-09-03-1846 · Cited by 12
Demonstration of measurement-free universal logical quantum computation
Butt, F., Pogorelov, I., Freund, R., Steiner, A., Meyer, M., Monz, T., & Müller, M. (2026) · Nature Communications · doi:10.1038/s41467-026-68533-x · Cited by 2
“State injection makes use of a suitable resource state 54 , which is injected onto the data qubit by, fi rst, entangling the two qubits, then measuring the resource qubit and, fi nally, applying a Clifford operation to the data qubit conditioned on the measurement outcome in the second step.”
Metadata
- Authors
- Goto, H.
- Affiliations
- Toshiba (Japan) (JP)
- Corresponding author
- Goto, Hayato
- ORCID
- Goto, Hayato
- Venue
- Scientific Reports
- Published
- 2016-01-27
- Volume
- 6
- Issue
- 1
- Pages
- 19578-19578
- ISSN
- 2045-2322 (ISSN-L)
- PMC
- PMC4728394
- OpenAlex
- W2254580066
- Cited by
- 61
- References
- 25
- Citations by year
- 2026: 6 · 2025: 20 · 2024: 11 · 2023: 5 · 2022: 1 · 2021: 3 · 2020: 6 · 2019: 2 · 2018: 3 · 2017: 3 · 2016: 1
- FWCI
- 2.44
- Type
- journal article
- Language
- en
- Update notices
- correction (2022-02-09)
- Open access
- gold
- doi.org
- Licence
- cc-by
- creativecommons.org/licenses/by/4.0 (tdm)
- creativecommons.org/licenses/by/4.0 (vor)
- Locations
- Scientific Reports (publishedVersion, cc-by)
- PubMed Central (publishedVersion, cc-by)
- PubMed (publishedVersion)
- 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
- Steane code, resource overhead, fault-tolerant quantum computing, universality
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
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.