CoChat

Pipelined correlated minimum weight perfect matching of the surface code

Open access

The 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.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.22331/q-2023-12-12-1205

Cites

23 of 23 references verified0 citation errors · 0 not checkable

Statistics

Figures

Figure 1 Three rounds of unrotated surface code: a) X stabilizers measured on vertices; b) Z stabilizers measured on faces. Time runs horizontally in the 2D and vertically in the 3D circuits. Bolded gates suffer all possible errors with only those leading to pairs of detection events (red) shown.
Figure 1 Three rounds of unrotated surface code: a) X stabilizers measured on vertices; b) Z stabilizers measured on faces. Time runs horizontally in the 2D and vertically in the 3D circuits. Bolded gates suffer all possible errors with only those leading to pairs of detection events (red) shown.CC-BY · From the PDF
Figure 2 Pre-matching. Example of a graph with vertical edge weights 4, horizontal edge weights 6, and diagonal edge weights 8. a) Arbitrarily chosen ordering of the edges emanating from a vertex. b) Detection event with two lowest weight neighboring detection events, namely those vertically above and below it. Given the arbitrary ordering, the one above will be chosen. Note that since the detection event above has only a single neighbor, this choice will be mutual, indicated by a green bubble. c) Detection event with two equal lowest weight diagonal neighbors, the mutual chosen pair is shown.
Figure 2 Pre-matching. Example of a graph with vertical edge weights 4, horizontal edge weights 6, and diagonal edge weights 8. a) Arbitrarily chosen ordering of the edges emanating from a vertex. b) Detection event with two lowest weight neighboring detection events, namely those vertically above and below it. Given the arbitrary ordering, the one above will be chosen. Note that since the detection event above has only a single neighbor, this choice will be mutual, indicated by a green bubble. c) Detection event with two equal lowest weight diagonal neighbors, the mutual chosen pair is shown.CC-BY · From the PDF
Figure 3 Distance 3 a) toric, b) unrotated, and c) rotated surface codes. Dark plaquettes represent X stabilizers, light plaquettes represent Z stabilizers. In all 3 cases the logical X operator of interest runs from top to bottom.
Figure 3 Distance 3 a) toric, b) unrotated, and c) rotated surface codes. Dark plaquettes represent X stabilizers, light plaquettes represent Z stabilizers. In all 3 cases the logical X operator of interest runs from top to bottom.CC-BY · From the PDF
Figure 4 Toric uncorrelated (pink) and correlated (black) distance 3-9 simulations. Dashed lines show p 2 , p 3 , p 4 and p 5 lines respectively, the asymptotic slope of each line. The fact that the data curves are much steeper than the asymptotic curves for high distances and high gate error rates shows that logical errors are suppressed at even higher powers than these in this regime.
Figure 4 Toric uncorrelated (pink) and correlated (black) distance 3-9 simulations. Dashed lines show p 2 , p 3 , p 4 and p 5 lines respectively, the asymptotic slope of each line. The fact that the data curves are much steeper than the asymptotic curves for high distances and high gate error rates shows that logical errors are suppressed at even higher powers than these in this regime.CC-BY · From the PDF
Figure 5 Unrotated uncorrelated (red) and correlated (blue) distance 3-9 simulations.
Figure 5 Unrotated uncorrelated (red) and correlated (blue) distance 3-9 simulations.CC-BY · From the PDF
Figure 6 Rotated uncorrelated (green) and correlated (orange) distance 3-9 simulations.
Figure 6 Rotated uncorrelated (green) and correlated (orange) distance 3-9 simulations.CC-BY · From the PDF
Figure 7 Pre-matching: a) Detection events have 3D coordinates, and are processed in the order of their time, row and column coordinates. For example, the first event to process is (1,0,0) and the second is (1,1,2). b) A graph of three detection events (A, B, C) is built and the weights of the edges are computed. In this example, only for the events A and C we consider the edges to the boundary of the code patch. c) The graph after eliminating the time layers visualization.
Figure 7 Pre-matching: a) Detection events have 3D coordinates, and are processed in the order of their time, row and column coordinates. For example, the first event to process is (1,0,0) and the second is (1,1,2). b) A graph of three detection events (A, B, C) is built and the weights of the edges are computed. In this example, only for the events A and C we consider the edges to the boundary of the code patch. c) The graph after eliminating the time layers visualization.CC-BY · From the PDF
Figure 8 Advancing the state of the vertices. All vertices start in ZP (not illustrated) and the pre-match order is A, B, C. Example obtained by replacing a =1 and b =4 in Fig. 7c.: a) The lowest weight edge is the one connecting A to B, such that B is marked as half prematched HP stores a reference to A; b) After prematching B, the lowest weight edge points to A, and the state of B is updated to full prematched FP; c) The lowest edge weight of C is the one connecting to the boundary, and C is automatically fully prematched.
Figure 8 Advancing the state of the vertices. All vertices start in ZP (not illustrated) and the pre-match order is A, B, C. Example obtained by replacing a =1 and b =4 in Fig. 7c.: a) The lowest weight edge is the one connecting A to B, such that B is marked as half prematched HP stores a reference to A; b) After prematching B, the lowest weight edge points to A, and the state of B is updated to full prematched FP; c) The lowest edge weight of C is the one connecting to the boundary, and C is automatically fully prematched.CC-BY · From the PDF
Figure 9 Reverting the state of the vertices. All vertices start in ZP (not illustrated) and the pre-match order is A, B, C. Example obtained by replacing a =5 and b =4 in Fig. 7c.: a) The lowest weight edge is connecting to the boundary, and A is automatically fully prematched. b) When pre-matching B, the lowest weight edge is towards C which is half prematched and will store a reference to B. c) Because A is FP and in the neighborhood of C, the lowest weight edge (2) is not considered and the next best option is pointing towards A (3), such that C cannot be prematched and its state is reset to ZP.
Figure 9 Reverting the state of the vertices. All vertices start in ZP (not illustrated) and the pre-match order is A, B, C. Example obtained by replacing a =5 and b =4 in Fig. 7c.: a) The lowest weight edge is connecting to the boundary, and A is automatically fully prematched. b) When pre-matching B, the lowest weight edge is towards C which is half prematched and will store a reference to B. c) Because A is FP and in the neighborhood of C, the lowest weight edge (2) is not considered and the next best option is pointing towards A (3), such that C cannot be prematched and its state is reset to ZP.CC-BY · From the PDF

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.

A few free checks a day · papers already verified open instantly · results are public

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

Show all 23 references

Cited by

See all 28

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
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.