Efficient color code decoders in d≥2 dimensions from toric code decoders
Open accessThe DOI matches its Crossref record; 17 of the 17 references it cites were found in a registry or an index.
Abstract
We introduce an efficient decoder of the color code in d≥2 dimensions, the Restriction Decoder, which uses any d-dimensional toric code decoder combined with a local lifting procedure to find a recovery operation. We prove that the Restriction Decoder successfully corrects errors in the color code if and only if the corresponding toric code decoding succeeds. We also numerically estimate the Restriction Decoder threshold for the color code in two and three dimensions against the bit-flip and phase-flip noise with perfect syndrome extraction. We report that the 2D color code threshold p2D≈10.2% on the square-octagon lattice is on a par with the toric code threshold on the square lattice.
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
Scheme for reducing decoherence in quantum computer memory
Shor, P. W. (1995) · Physical Review A · doi:10.1103/physreva.52.r2493 · Cited by 4,479
Quantum information and computation
Bennett, C. H., & DiVincenzo, D. P. (2000) · Nature · doi:10.1038/35005001 · Cited by 3,263
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×
“The formidable qubit overhead of state distillation [9, 10] associated with the necessary non-Clifford gate motivates the search for alternative ways of achieving universality.”
BackgroundGood 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 · cited 1×
“We focus our emphasis on CSS stabilizer codes [36, 37], whose stabilizer group is generated by X- and Z-type stabilizer generators.”
BackgroundEdmonds, J. (1965) · Canadian Journal of Mathematics · doi:10.4153/cjm-1965-045-4 · Cited by 2,428
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×
“The formidable qubit overhead of state distillation [9, 10] associated with the necessary non-Clifford gate motivates the search for alternative ways of achieving universality.”
BackgroundClass 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 · cited 1×
“Stabilizer codes are quantum error correcting codes [34, 35] specified by the stabilizer group S, which is an Abelian subgroup of the Pauli group Pn generated by tensor products of Pauli operators on n qubits.”
MethodQuantum 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 · cited 1×
“We focus our emphasis on CSS stabilizer codes [36, 37], whose stabilizer group is generated by X- and Z-type stabilizer generators.”
BackgroundTopological Quantum Distillation
Bombin, H., & Martin-Delgado, M. A. (2006) · Physical Review Letters · doi:10.1103/physrevlett.97.180501 · Cited by 700
Restrictions on Transversal Encoded Quantum Gate Sets
Eastin, B., & Knill, E. (2009) · Physical Review Letters · doi:10.1103/physrevlett.102.110502 · Cited by 457
Cited by
Sparse blossom: correcting a million errors per core second with minimum-weight matching
Higgott, O., & Gidney, C. (2025) · Quantum · doi:10.22331/q-2025-01-20-1600 · Cited by 180
Sparse Blossom: correcting a million errors per core second with minimum-weight matching
Higgott, O., & Gidney, C. (2023) · arXiv · doi:10.48550/arxiv.2303.15933 · Cited by 148
Decoding 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
“Additionally, it was shown that the decoders for the toric code can be applied to decode color codes (Kubica and Delfosse, 2023) and, thus, cellular automaton decoders can also be applied for this family of QECCs.”
BackgroundVasmer, M., & Kubica, A. (2022) · PRX Quantum · doi:10.1103/prxquantum.3.030319 · Cited by 39
“For regions of L̃ that are the same as the corresponding regions L, the local lift is the color code lift described in [24].”
BackgroundMethodInfluentialSelf-citationColor code decoder with improved scaling for correcting circuit-level noise
Lee, S.-H., Li, A., & Bartlett, S. D. (2025) · Quantum · doi:10.22331/q-2025-01-27-1609 · Cited by 16
Metadata
- Authors
- Kubica, A., & Delfosse, N.
- Venue
- Quantum
- Published
- 2023-02-21
- Volume
- 7
- Pages
- 929
- ISSN
- 2521-327X (ISSN-L)
- OpenAlex
- W4321444449
- Cited by
- 29
- References
- 17
- FWCI
- 2.55
- Type
- journal article
- Language
- en
- Open access
- gold
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: Efficient color code decoders in d≥2 dimensions from toric code decoders. https://app.cochat.ai/papers/10.22331/q-2023-02-21-929
- The paper
- Kubica, A., & Delfosse, N. (2023). Efficient color code decoders in d≥2 dimensions from toric code decoders. Quantum. https://doi.org/10.22331/q-2023-02-21-929
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.