Fast fault-tolerant decoder for qubit and qudit surface codes
Open accessThe DOI matches its Crossref record; 6 of the 6 references it cites were found in a registry or an index.
Abstract
The surface code is one of the most promising candidates for combating errors in large scale fault-tolerant quantum computation. A fault-tolerant decoder is a vital part of the error correction process---it is the algorithm which computes the operations needed to correct or compensate for the errors according to the measured syndrome, even when the measurement itself is error prone. Previously decoders based on minimum-weight perfect matching have been studied. However, these are not immediately generalizable from qubit to qudit codes. In this work, we develop a fault-tolerant decoder for the surface code, capable of efficient operation for qubits and qudits of any dimension, generalizing the decoder first introduced by Bravyi and Haah [Phys. Rev. Lett. 111, 200501 (2013)]. We study its performance when both the physical qudits and the syndromes measurements are subject to generalized uncorrelated bit-flip noise (and the higher-dimensional equivalent). We show that, with appropriate enhancements to the decoder and a high enough qudit dimension, a threshold at an error rate of more than $8%$ can be achieved.
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
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×
“For example, an integral part of many faulttolerant schemes is the distillation of magic states [10]—a procedure necessary to achieve universal computation—where generalization to higher dimensions has resulted in improved distillation thresholds and lower overheads in the number of qudit magic states [11–13].”
BackgroundFault-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
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
Efficient algorithms for maximum likelihood decoding in the surface code
Bravyi, S., Suchara, M., & Vargo, A. (2014) · Physical Review A · doi:10.1103/physreva.90.032326 · Cited by 214
Fault-tolerant thresholds for quantum error correction with the surface code
Stephens, A. M. (2014) · Physical Review A · doi:10.1103/physreva.89.022321 · Cited by 133 · cited 1×
“Compared with other quantum error correcting codes, they posses the key experimental benefit of requiring only local interactions and yet, under realistic noise models, they have been shown to achieve the highest reported fault-tolerant thresholds [8,9].”
Background
Cited by
Bonilla Ataides, J. P., Tuckett, D. K., Bartlett, S. D., Flammia, S. T., & Brown, B. J. (2021) · Nature Communications · doi:10.1038/s41467-021-22274-1 · Cited by 262
“In this regime, the logical failure rate of a code is expected to decay as P ∼ p below threshold [5, 43, 44].”
BackgroundAlmost-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
Ultrahigh Error Threshold for Surface Codes with Biased Noise
Tuckett, D. K., Bartlett, S. D., & Flammia, S. T. (2018) · Physical Review Letters · doi:10.1103/physrevlett.120.050505 · Cited by 216
“considering biased noise in qudit surface codes [37,38].”
BackgroundDecoding 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
“As stated, the renormalization decoder was originally proposed for the Kitaev toric code, so with periodic boundaries, but modifications for decoding color codes (Sarvepalli and Raussendorf, 2012), the 3D cubic code (Bravyi and Haah, 2013; Watson et al., 2015; Wootton, 2015) qudit topological codes (Anwar et al.”
BackgroundMethodInfluentialEmpowering a qudit-based quantum processor by traversing the dual bosonic ladder
Nguyen, L. B., Goss, N., Siva, K., Kim, Y., Younis, E., Qing, B., Hashim, A., Santiago, D. I., & Siddiqi, I. (2024) · Nature Communications · doi:10.1038/s41467-024-51434-2 · Cited by 31
“Here, we use the collective spin coherent state as the basis state with isotropic QPD 27 (Supplementary Note 7).”
Metadata
- Authors
- Watson, F. H. E., Anwar, H., & Browne, D. E.
- Venue
- Physical Review A
- Publisher
- American Physical Society (APS)
- Published
- 2015-09-08
- Volume
- 92
- Issue
- 3
- ISSN
- 0556-2791 (ISSN-L)
- 1050-2947
- 1094-1622
- OpenAlex
- W1695111371
- Cited by
- 60
- References
- 6
- FWCI
- 4.38
- 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: Fast fault-tolerant decoder for qubit and qudit surface codes. https://app.cochat.ai/papers/10.1103/physreva.92.032309
- The paper
- Watson, F. H. E., Anwar, H., & Browne, D. E. (2015). Fast fault-tolerant decoder for qubit and qudit surface codes. Physical Review A. https://doi.org/10.1103/physreva.92.032309
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.