Cellular-Automaton Decoders with Provable Thresholds for Topological Codes
Open accessThe DOI matches its Crossref record; 8 of the 8 references it cites were found in a registry or an index.
Abstract
We propose a new cellular automaton (CA), the sweep rule, which generalizes Toom's rule to any locally Euclidean lattice. We use the sweep rule to design a local decoder for the toric code in d≥3 dimensions, the sweep decoder, and rigorously establish a lower bound on its performance. We also numerically estimate the sweep decoder threshold for the three-dimensional toric code on the cubic and body-centered cubic lattices for phenomenological phase-flip noise. Our results lead to new CA decoders with provable error-correction thresholds for other topological quantum codes including the color code.
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
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
Quantum error correction for quantum memories
Terhal, B. M. (2015) · Reviews of Modern Physics · doi:10.1103/revmodphys.87.307 · Cited by 1,354
Class 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
Preskill, 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
Self-citationTopological Quantum Distillation
Bombin, H., & Martin-Delgado, M. A. (2006) · Physical Review Letters · doi:10.1103/physrevlett.97.180501 · Cited by 700
Quantum codes on a lattice with boundary
Bravyi, S. B., & Kitaev, A. Y. (1998) · arXiv · doi:10.48550/arxiv.quant-ph/9811052 · Cited by 394
Almost-linear time decoding algorithm for topological codes
Delfosse, N., & Nickerson, N. H. (2021) · Quantum · doi:10.22331/q-2021-12-02-595 · Cited by 242
NP-hardness of decoding quantum error-correction codes
Hsieh, M.-H., & Le Gall, F. (2011) · Physical Review A · doi:10.1103/physreva.83.052331 · Cited by 71
Cited by
Beverland, M. E., Kubica, A., & Svore, K. M. (2021) · PRX Quantum · doi:10.1103/prxquantum.2.020341 · Cited by 82
Self-citationDecoding algorithms for surface codes
deMarti iOlius, A., Fuentes, P., Orús, R., Crespo, P. M., & Etxezarreta Martinez, J. (2024) · Quantum · doi:10.22331/q-2024-10-10-1498 · Cited by 60
“In the case of cellular automaton decoders, the repository Sweep-Decoder-Boundaries by Michael Vasmer (Vasmer, 2021) implements the version of the decoder using the sweep rule as presented in (Kubica and Preskill, 2019; Vasmer et al., 2021).”
BackgroundMethodInfluentialGeneral tensor network decoding of 2D Pauli codes
Chubb, C. T. (2021) · arXiv · doi:10.48550/arxiv.2101.04125 · Cited by 20
Metadata
- Authors
- Kubica, A., & Preskill, J.
- Venue
- Physical Review Letters
- Publisher
- American Physical Society (APS)
- Published
- 2019-07-08
- Volume
- 123
- Issue
- 2
- Pages
- 020501-020501
- ISSN
- 0031-9007 (ISSN-L)
- 1079-7114
- OpenAlex
- W2894247456
- Cited by
- 65
- References
- 8
- FWCI
- 3.80
- Type
- journal article
- Language
- en
- Open access
- bronze
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: Cellular-Automaton Decoders with Provable Thresholds for Topological Codes. https://app.cochat.ai/papers/10.1103/physrevlett.123.020501
- The paper
- Kubica, A., & Preskill, J. (2019). Cellular-Automaton Decoders with Provable Thresholds for Topological Codes. Physical Review Letters. https://doi.org/10.1103/physrevlett.123.020501
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.