Pipelined correlated minimum weight perfect matching of the surface code
Open accessThe DOI matches its Crossref record; 23 of the 23 references it cites were found in a registry or an index.
Abstract
We describe a pipeline approach to decoding the surface code using minimum weight perfect matching, including taking into account correlations between detection events. An independent no-communication parallelizable processing stage reweights the graph according to likely correlations, followed by another no-communication parallelizable stage for high confidence matching. A later general stage finishes the matching. This is a simplification of previous correlated matching techniques which required a complex interaction between general matching and re-weighting the graph. Despite this simplification, which gives correlated matching a better chance of achieving real-time processing, we find the logical error rate practically unchanged. We validate the new algorithm on the fully fault-tolerant toric, unrotated, and rotated surface codes, all with standard depolarizing noise. We expect these techniques to be applicable to a wide range of other decoders.
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
Figures









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 1×
“The surface code [1, 2, 3, 4, 5, 6, 7, 8] is experimentally attractive as it requires only a 2D array of qubits with nearest neighbor interactions, and gate error rates of order 0.1% to achieve post-classical fault-tolerant quantum computation with fewer than 1M qubits [9].”
MethodInfluentialSelf-citationEdmonds, J. (1965) · Canadian Journal of Mathematics · doi:10.4153/cjm-1965-045-4 · Cited by 2,428 · cited 1×
“To move closer to this goal, we improve the algo-rithm used in [14] which performs a correlated-error version of minimum weight perfect matching [18, 19].”
MethodDennis, E., Kitaev, A., Landahl, A., & Preskill, J. (2002) · Journal of Mathematical Physics · doi:10.1063/1.1499754 · Cited by 1,768
Maximum matching and a polyhedron with 0,1-vertices
Edmonds, J. (1965) · Journal of Research of the National Bureau of Standards Section B Mathematics and Mathematical Physics · doi:10.6028/jres.069b.013 · Cited by 1,712
Dennis, E., Kitaev, A., Landahl, A., & Preskill, J. (2001) · CERN Document Server (European Organization for Nuclear Research) · Cited by 1,485
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
Topological fault-tolerance in cluster state quantum computation
Raussendorf, R., Harrington, J., & Goyal, K. (2007) · New Journal of Physics · doi:10.1088/1367-2630/9/6/199 · Cited by 617
A Game of Surface Codes: Large-Scale Quantum Computing with Lattice Surgery
Litinski, D. (2019) · Quantum · doi:10.22331/q-2019-03-05-128 · Cited by 408
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
A game of surface codes: Large-scale quantum computing with lattice surgery
Litinski, D. (2019) · Refubium (Universitätsbibliothek der Freien Universität Berlin) · doi:10.17169/refubium-4067 · Cited by 252
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
“We also use a greedy edge reweighting strategy to increase accuracy by accounting for correlations induced by Y -type errors [29, 47].”
Self-citationImproved belief propagation is sufficient for real-time decoding of quantum memoryPreprint
Müller, T., Alexander, T., Beverland, M. E., Bühler, M., Johnson, B. R., Maurer, T., & Vandeth, D. (2025) · arXiv (Cornell University) · doi:10.48550/arxiv.2506.01779 · Cited by 158
Parallel window decoding enables scalable fault tolerant quantum computation
Skorić, L., Browne, D. E., Barnes, K. M., Gillespie, N. I., & Campbell, E. T. (2023) · Nature Communications · doi:10.1038/s41467-023-42482-1 · Cited by 208
Real-time decoding for fault-tolerant quantum computing: progress, challenges and outlook
Battistel, F., Chamberland, C., Johar, K., Overwater, R. W. J., Sebastiano, F., Skorić, L., Ueno, Y., & Usman, M. (2023) · Nano Futures · doi:10.1088/2399-1984/aceba6 · Cited by 159
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
Metadata
- Authors
- Paler, A., & Fowler, A. G.
- Affiliations
- The University of Texas at Dallas (US)
- Google (United States) (US)
- Venue
- Quantum
- Published
- 2023-12-12
- Volume
- 7
- Pages
- 1205
- ISSN
- 2521-327X (ISSN-L)
- OpenAlex
- W4389625651
- Cited by
- 22
- References
- 17
- Citations by year
- 2026: 5 · 2025: 7 · 2024: 6 · 2023: 4
- FWCI
- 1.95
- Type
- journal article
- Language
- en
- Open access
- gold
- doi.org
- Locations
- Quantum (publishedVersion, cc-by)
- arXiv (Cornell University) (submittedVersion)
- Aaltodoc (Aalto University) (submittedVersion, cc-by)
- DOAJ (DOAJ: Directory of Open Access Journals) (submittedVersion, cc-by-sa)
- arXiv (Cornell University) (cc-by)
- Topics
- Physical Sciences › Computer Science › Artificial Intelligence › Quantum Computing Algorithms and Architecture
- Physical Sciences › Computer Science › Computer Networks and Communications › Error Correcting Code Techniques
- Physical Sciences › Physics and Astronomy › Atomic and Molecular Physics, and Optics › Quantum Information and Cryptography
- Keywords
- surface code, minimum-weight perfect matching, quantum error correction, logical error rate, toric code, rotated surface code, depolarizing noise, real-time decoding
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: Pipelined correlated minimum weight perfect matching of the surface code. https://app.cochat.ai/papers/10.22331/q-2023-12-12-1205
- The paper
- Paler, A., & Fowler, A. G. (2023). Pipelined correlated minimum weight perfect matching of the surface code. Quantum. https://doi.org/10.22331/q-2023-12-12-1205
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.