Minimum weight perfect matching of fault-tolerant topological quantum error correction in average O(1) parallel time
Open accessThe DOI matches its Crossref record; 3 of the 3 references it cites were found in a registry or an index.
Abstract
Consider a 2-D square array of qubits of extent $L\times L$. We provide a proof that the minimum weight perfect matching problem associated with running a particular class of topological quantum error correction codes on this array can be exactly solved with a 2-D square array of classical computing devices, each of which is nominally associated with a fixed number $N$ of qubits, in constant average time per round of error detection independent of $L$ provided physical error rates are below fixed nonzero values, and other physically reasonable assumptions. This proof is applicable to the fully fault-tolerant case only, not the case of perfect stabilizer measurements.
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
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
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
Subsystem surface codes with three-qubit check operators
Bravyi, S., Duclos-Cianci, G., Poulin, D., & Suchara, M. (2012) · arXiv · doi:10.48550/arxiv.1207.1443 · Cited by 58
Cited by
Quantum error correction for quantum memories
Terhal, B. M. (2015) · Reviews of Modern Physics · doi:10.1103/revmodphys.87.307 · Cited by 1,354
A Survey on quantum computing technology
Gyongyosi, L., & Imre, S. (2019) · Computer Science Review · doi:10.1016/j.cosrev.2018.11.002 · Cited by 646
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
Estimating the Cost of Generic Quantum Pre-image Attacks on SHA-2 and SHA-3
Amy, M., Di Matteo, O., Gheorghiu, V., Mosca, M., Parent, A., & Schanck, J. (2017) · Lecture Notes in Computer Science · doi:10.1007/978-3-319-69453-5_18 · Cited by 128
“A heuristic argument is given in [17] that the communication overhead is also independent of L, i.”
BackgroundMethodDecoding 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
“Before the operation of the MWPM decoder is described, some definitions of graph theory must be provided (Fowler, 2015).”
BackgroundMethodInfluentialBaldwin, C. H., Mayer, K., Brown, N. C., Ryan-Anderson, C., & Hayes, D. (2022) · Quantum · doi:10.22331/q-2022-05-09-707 · Cited by 54
“For the [[7,1,3]] Steane code, the simulation was done using a stabilizer simulator with a lookup table style decoder [59] and for the rotated surface and toric codes, a fast Pauli tracking simulator was used with minimum weight perfect matching to decode error syndromes [60, 61].”
MethodFusion Blossom: Fast MWPM Decoders for QEC
Wu, Y., & Zhong, L. (2023) · 2023 IEEE International Conference on Quantum Computing and Engineering (QCE) · doi:10.1109/qce57702.2023.00107 · Cited by 47
“Fowler also suggested an idea to parallelize the MWPM decoder [4], without providing any empirical data regarding its performance.”
BackgroundMethodVasmer, M., & Kubica, A. (2022) · PRX Quantum · doi:10.1103/prxquantum.3.030319 · Cited by 39
“Remarkably, our decoder reduces to the MWPM decoder [24,25] in one limit and to the restriction decoder in the opposite limit.”
MethodFPGA-Based Distributed Union-Find Decoder for Surface Codes
(2024) · doi:10.1109/tqe.2024.3467271 · Cited by 36
Quantum error correction with an Ising machine under circuit-level noise
Fujisaki, J., Maruyama, K., Oshima, H., Sato, S., Sakashita, T., Takeuchi, Y., & Fujii, K. (2023) · Physical Review Research · doi:10.1103/physrevresearch.5.043261 · Cited by 5
Metadata
- Authors
- Fowler, A. G.
- Venue
- Quantum Information and Computation
- Publisher
- Rinton Press
- Published
- 2015-01
- Volume
- 15
- Issue
- 1&2
- Pages
- 145-158
- ISSN
- 1533-7146 (ISSN-L)
- OpenAlex
- W2950073260
- Cited by
- 87
- References
- 3
- 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
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.