Fault-tolerant logical gate networks for Calderbank-Shor-Steane codes
Open accessThe DOI matches its Crossref record; 7 of the 7 references it cites were found in a registry or an index.
Abstract
Fault-tolerant logical operations for qubits encoded by Calderbank-Shor-Steane codes are discussed, with emphasis on methods that apply to codes of high rate, encoding $k$ qubits per block with $k>1$. It is shown that the logical qubits within a given block can be prepared by a single recovery operation in any state whose stabilizer generator separates into $X$ and $Z$ parts. Optimized methods to move logical qubits around and to achieve controlled-NOT and Toffoli gates are discussed. It is found that the number of time steps required to complete a fault-tolerant quantum computation is the same when $k>1$ as when $k=1$.
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.
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
Good quantum error-correcting codes exist
Calderbank, A. R., & Shor, P. W. (1996) · Physical Review A · doi:10.1103/physreva.54.1098 · Cited by 2,516
Gottesman, D., & Chuang, I. L. (1999) · Nature · doi:10.1038/46503 · Cited by 1,860
Multiple-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
Self-citationClass of quantum error-correcting codes saturating the quantum Hamming bound
Gottesman, D. (1996) · Physical Review A · doi:10.1103/physreva.54.1862 · Cited by 1,227
Quantum Error Correction and Orthogonal Geometry
Calderbank, A. R., Rains, E. M., Shor, P. W., & Sloane, N. J. A. (1997) · Physical Review Letters · doi:10.1103/physrevlett.78.405 · Cited by 811
Efficient networks for quantum factoring
Beckman, D., Chari, A. N., Devabhaktuni, S., & Preskill, J. (1996) · Physical Review A · doi:10.1103/physreva.54.1034 · Cited by 268
Both Toffoli and Controlled-NOT need little help to universal quantum computing
Shi, Y.-Y. (2003) · Quantum Information and Computation · doi:10.26421/qic3.1-7 · Cited by 193
Cited by
Creation of a six-atom ‘Schrödinger cat’ state
Leibfried, D., Knill, E., Seidelin, S., Britton, J., Blakestad, R. B., Chiaverini, J., Hume, D. B., Itano, W. M., Jost, J. D., Langer, C., et al. (2005) · Nature · doi:10.1038/nature04251 · Cited by 805
Quantum error correction for beginners
Devitt, S. J., Munro, W. J., & Nemoto, K. (2013) · Reports on Progress in Physics · doi:10.1088/0034-4885/76/7/076001 · Cited by 759
Fast quantum modular exponentiation
Van Meter, R., & Itoh, K. M. (2005) · Physical Review A · doi:10.1103/physreva.71.052320 · Cited by 181
Fault-Tolerant quantum computation with constant overhead
Gottesman, D. (2014) · Quantum Information and Computation · doi:10.26421/qic14.15-16-5 · Cited by 172
Fault-tolerant quantum computation with few qubits
Chao, R., & Reichardt, B. W. (2018) · npj Quantum Information · doi:10.1038/s41534-018-0085-z · Cited by 137
Metadata
- Authors
- Steane, A. M., & Ibinson, B.
- Venue
- Physical Review A
- Publisher
- American Physical Society (APS)
- Published
- 2005-11-30
- Volume
- 72
- Issue
- 5
- ISSN
- 0556-2791 (ISSN-L)
- 1050-2947
- 1094-1622
- OpenAlex
- W1485065009
- Cited by
- 44
- References
- 7
- FWCI
- 3.09
- Type
- journal article
- Language
- en
- Open access
- green
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: Fault-tolerant logical gate networks for Calderbank-Shor-Steane codes. https://app.cochat.ai/papers/10.1103/physreva.72.052335
- The paper
- Steane, A. M., & Ibinson, B. (2005). Fault-tolerant logical gate networks for Calderbank-Shor-Steane codes. Physical Review A. https://doi.org/10.1103/physreva.72.052335
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.