Scalable Surface-Code Decoders with Parallelization in Time
Open accessThe DOI matches its Crossref record; 9 of the 9 references it cites were found in a registry or an index.
Abstract
Leveraging parallelization in time, a scalable decoding paradigm for topological quantum error-correction codes effectively resolves the exponential backlog problem without compromising decoding accuracy.
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 · cited 2×
“One prominent architecture [5, 6] uses the surface code [7] and achieves universality via magic-state distillation [8].”
MethodUniversal 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
Quantum error correction for quantum memories
Terhal, B. M. (2015) · Reviews of Modern Physics · doi:10.1103/revmodphys.87.307 · Cited by 1,354
Quantum computing with realistically noisy devices
Knill, E. (2005) · Nature · doi:10.1038/nature03350 · Cited by 1,184 · cited 4×
“In this paper, we rigorously define and analyze the sliding-window decoder framework, including the insights and limitations of an existing implementation [2], and propose two variants: the forward decoder (Section S2 C) and the scalable sandwich decoder (Section S2 D).”
BackgroundMethodInfluentialSuppressing quantum errors by scaling a surface code logical qubit
Google Quantum, A. I., Acharya, R., Aleiner, I., Allen, R., Andersen, T. I., Ansmann, M., Arute, F., Arya, K., Asfaw, A., Atalaya, J., et al. (2023) · Nature · doi:10.1038/s41586-022-05434-1 · Cited by 1,103
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
Fault-Tolerant Quantum Computation with Constant Error Rate
Aharonov, D., & Ben-Or, M. (2008) · SIAM Journal on Computing · doi:10.1137/s0097539799359385 · Cited by 513 · cited 2×
“We focus on the memory experiment for the [[ d 2 , 1 , d ]] rotated surface code [1] that preserves logical state | 0 ; the argument for other variants of the surface code or logical basis states proceeds analogously. we (cid:105) Specifically, first initialize all the data qubits into | 0 states.”
BackgroundMethodHigh-threshold universal quantum computation on the surface code
Fowler, A. G., Stephens, A. M., & Groszkowski, P. (2009) · Physical Review A · doi:10.1103/physreva.80.052312 · Cited by 486 · cited 1×
“Many decoding schemes for the surface code have high thresholds [10, 11], yet they do not address the inadequate decoding throughput problem.”
BackgroundFault-Tolerant quantum computation with constant overhead
Gottesman, D. (2014) · Quantum Information and Computation · doi:10.26421/qic14.15-16-5 · Cited by 172 · cited 3×
“In most of our experiments, we use a union-find (UF) decoder, as proposed in [4], to decode each individual window (including the forward windows and both types of the sandwich windows).”
BackgroundMethod
Research works printed but not linked: 22
- 10.26421/qic6.2-1 · DOI · Paper page
- 10.1063/1.1499754 · DOI · Paper page
- 10.1016/S0003-4916(02)00018-0 · DOI · Paper page
- 10.1103/PhysRevLett.104.050504 · DOI · Paper page
- 10.1103/PhysRevLett.111.200501 · DOI · Paper page
- 10.1103/PhysRevX.4.041039 · DOI · Paper page
- 10.1038/npjqi.2015.10 · DOI · Paper page
- 10.1103/PhysRevLett.119.030501 · DOI · Paper page
- 10.1103/PhysRevLett.128.080505 · DOI · Paper page
- 10.22331/q-2023-07-12-1058 · DOI · Paper page
- 10.1088/2058-9565/ace64d · DOI
- 10.1103/PhysRevApplied.19.034050 · DOI
- 10.1103/PhysRevLett.108.180501 · DOI · Paper page
- 10.26421/qic15.1-2-9 · DOI · Paper page
- 10.1109/TQE.2022.3174017 · DOI · Paper page
- 10.1038/s41467-023-36493-1 · DOI · Paper page
- 10.1103/PhysRevA.90.062320 · DOI · Paper page
- 10.22331/q-2021-12-02-595 · DOI · Paper page
- 10.22331/q-2022-08-24-786 · DOI
- 10.1103/PRXQuantum.3.010331 · DOI · Paper page
- 10.1038/s41467-023-42482-1 · DOI · Paper page
- 10.1016/S0003-4916(02)00019-2 · DOI · Paper page
Cited by
Quantum error correction below the surface code threshold
Collaborators, G. Q. A. A., Acharya, R., Abanin, D. A., Aghababaie-Beni, L., Aleiner, I., Andersen, T. I., Ansmann, M., Arute, F., Arya, K., Asfaw, A., et al. (2025) · Nature · doi:10.1038/s41586-024-08449-y · Cited by 778
“However, we do expect that many of our high-accuracy decoding methods can eventually be made real-time by introducing techniques like layered or win-dowed decoding [28, 44, 45].”
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
Learning high-accuracy error decoding for quantum processors
Bausch, J., Senior, A. W., Heras, F. J. H., Edlich, T., Davies, A., Newman, M., Jones, C., Satzinger, K., Niu, M. Y., Blackwell, S., et al. (2024) · Nature · doi:10.1038/s41586-024-08148-8 · Cited by 106
“We also note that, in principle, it is possible to achieve unbounded throughput by decomposing the matching decoding problem in an embarrassingly parallel fashion [85, 90].”
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
Metadata
- Authors
- Tan, X., Zhang, F., Chao, R., Shi, Y., & Chen, J.
- Venue
- PRX Quantum
- Publisher
- American Physical Society (APS)
- Published
- 2023-12-15
- Volume
- 4
- Issue
- 4
- ISSN
- 2691-3399 (ISSN-L)
- OpenAlex
- W4389783307
- Cited by
- 42
- References
- 9
- FWCI
- 3.69
- Type
- journal article
- Language
- en
- Open access
- gold
- Funders
- Massachusetts Institute of Technology
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.