Improved Decoding of Circuit Noise and Fragile Boundaries of Tailored Surface Codes
Open accessThe DOI matches its Crossref record; 31 of the 31 references it cites were found in a registry or an index.
Abstract
Realizing the full potential of quantum computation requires quantum error correction (QEC), with most recent breakthrough demonstrations of QEC using the surface code.QEC codes use multiple noisy physical qubits to encode information in fewer logical qubits, enabling the identification of errors through a decoding process.This process increases the logical fidelity (or accuracy) making the computation more reliable.However, most fast (efficient run-time) decoders neglect important noise characteristics, thereby reducing their accuracy.In this work, we introduce decoders that are both fast and accurate, and can be used with a wide class of QEC codes including the surface code.Our decoders, named belief-matching and belief-find, exploit all noise information and thereby unlock higher accuracy demonstrations of QEC.Using the surface code threshold as a performance metric, we observe a threshold at 0.94% error probability for our decoders, outperforming the 0.82% threshold for a standard minimum-weight perfect matching decoder.We also test our belief-matching decoders in a theoretical case study of codes tailored to a biased noise model.We find that the decoders lead to a much higher threshold and lower qubit overhead in the tailored surface code with respect to the standard, square surface code.Surprisingly, in the wellbelow-threshold regime, the rectangular surface code becomes more resource efficient than the tailored surface code due to a previously unnoticed phenomenon that we call "fragile boundaries."Our decoders outperform all other fast decoders in terms of threshold and accuracy, enabling better results in current quantum-error-correction experiments and opening up new areas for theoretical case studies.
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
Good quantum error-correcting codes exist
Calderbank, A. R., & Shor, P. W. (1996) · Physical Review A · doi:10.1103/physreva.54.1098 · Cited by 2,516 · cited 1×
“, g r such that each generator is either X -type or Z -type, g i ∈ { I, X ⊗ n ∪ { I, Z ⊗ n [42, 43]. a code } } The centralizer C ( S ) of stabilizer is the set of Pauli operators that commute with every element of S .”
Edmonds, J. (1965) · Canadian Journal of Mathematics · doi:10.4153/cjm-1965-045-4 · Cited by 2,428 · cited 1×
“The MWPM decoder finds a set of edges in G consistent with the syndrome that have minimal total weight, and a standard exact implementation of the al-gorithm has a worst case running time of O ( N 3 log( N )), where N is the number of nodes in G [1, 46, 77].”
Dennis, E., Kitaev, A., Landahl, A., & Preskill, J. (2002) · Journal of Mathematical Physics · doi:10.1063/1.1499754 · Cited by 1,768
Quantum error correction for quantum memories
Terhal, B. M. (2015) · Reviews of Modern Physics · doi:10.1103/revmodphys.87.307 · Cited by 1,354
Suppressing 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
Self-citationStabilizer Codes and Quantum Error Correction
Gottesman, D. (1997) · arXiv · doi:10.48550/arxiv.quant-ph/9705052 · Cited by 753
Realizing repeated quantum error correction in a distance-three surface code
Krinner, S., Lacroix, N., Remm, A., Di Paolo, A., Genois, E., Leroux, C., Hellings, C., Lazar, S., Swiadek, F., Herrmann, J., et al. (2022) · Nature · doi:10.1038/s41586-022-04566-8 · Cited by 686 · cited 1×
“Consequently, the surface code is particularly amenable to experimental implementations, as high-lighted by recent demonstrations [3, 4].”
Surface code quantum computing by lattice surgery
Horsman, D., Fowler, A. G., Devitt, S., & Meter, R. V. (2012) · New Journal of Physics · doi:10.1088/1367-2630/14/12/123011 · Cited by 598 · cited 2×
“Temporal boundaries also arise during lattice surgery [37–40] and so these operations are also vulnerable.”
Operator quantum error-correcting subsystems for self-correcting quantum memories
Bacon, D. (2006) · Physical Review A · doi:10.1103/physreva.73.012340 · Cited by 486 · cited 2×
“As a case study, we use our decoders to tackle the open problem of determining the optimal variant of the surface code in the presence of biased noise that favours phase errors over bit-flips [30–33].”
Stim: a fast stabilizer circuit simulator
Gidney, C. (2021) · Quantum · doi:10.22331/q-2021-07-06-497 · Cited by 415 · cited 5×
“However, for the surface code, these hyper-edges can always be approximated by a sets of edges already present in the matching graph [44].”
Influential
Research works printed but not linked: 36
- 10.1016/S0003-4916(02)00018-0 · DOI · Paper page
- 10.1109/TIT.2017.2663199 · DOI · Paper page
- 10.26421/QIC15.1-2-9 · DOI · Paper page
- 10.1103/PhysRevA.102.012419 · DOI · Paper page
- 10.22331/q-2018-10-19-102 · DOI · Paper page
- 10.26421/QIC13.11-12-4 · DOI · Paper page
- 10.1109/TIT.2016.2555700 · DOI · Paper page
- 10.1103/PhysRevX.9.021041 · DOI · Paper page
- 10.1103/PhysRevResearch.5.013035 · DOI
- 10.1103/PhysRevA.89.012317 · DOI · Paper page
- 10.22331/q-2023-02-21-929 · DOI · Paper page
- 10.1103/PhysRevA.78.052331 · DOI · Paper page
- 10.1103/PhysRevX.9.041031 · DOI · Paper page
- 10.1103/PhysRevLett.124.130501 · DOI · Paper page
- 10.22331/q-2018-05-04-62 · DOI · Paper page
- 10.1103/PRXQuantum.3.010331 · DOI · Paper page
- 10.1103/PhysRevLett.77.793 · DOI · Paper page
- 10.1103/PhysRevLett.128.110504 · DOI · Paper page
- N. Delfosse, 2014, Proceedings of the 2014 IEEE International Symposium on Information Theory
- 10.22331/q-2018-01-29-48 · DOI · Paper page
- 10.1103/PhysRevLett.119.030501 · DOI · Paper page
- 10.1103/PhysRevLett.128.080505 · DOI · Paper page
- 10.5555/2016985.2016993 · doi:10.5555/2016985.2016993
- 10.1109/ACCESS.2021.3118544 · DOI
- 10.1049/el:19961141 · DOI · Paper page
- D. J. MacKay, 2003, Information Theory, Inference and Learning Algorithms
- 10.1109/TCOMM.2005.852852 · doi:10.1109/tcomm.2005.852852
- 10.1016/S0003-4916(02)00019-2 · DOI · Paper page
- 10.1103/PhysRevLett.104.050504 · DOI · Paper page
- G. Duclos-Cianci, 2010, Proceedings of the 2010 IEEE Information Theory Workshop
- 10.1103/PhysRevLett.109.160503 · DOI · Paper page
- 10.1103/PhysRevA.89.022326 · DOI · Paper page
- 10.1103/PhysRevX.2.021004 · DOI · Paper page
- 10.22331/q-2023-05-15-1005 · DOI
- 10.1109/49.924874 · DOI · Paper page
- 10.22331/q-2020-10-28-352 · DOI · Paper page
Cited by
Logical quantum processor based on reconfigurable atom arrays
Bluvstein, D., Evered, S. J., Geim, A. A., Li, S. H., Zhou, H., Manovitz, T., Ebadi, S., Cain, M., Kalinowski, M., Hangleiter, D., et al. (2024) · Nature · doi:10.1038/s41586-023-06927-3 · Cited by 1,119
High-threshold and low-overhead fault-tolerant quantum memory
Bravyi, S., Cross, A. W., Gambetta, J. M., Maslov, D., Rall, P., & Yoder, T. J. (2024) · Nature · doi:10.1038/s41586-024-07107-7 · Cited by 456
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
Self-citationSparse 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
Self-citationLearning 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
“State-of-the-art MWPM-based decoders, such as correlated matching (MWPM-Corr), matching with belief propagation (MWPM-BP) and PyMatching, an open-source implementation of MWPM 4,24,26 , lead to higher LERs than the tensor network and AlphaQubit (Fig.”
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
“Additionally, even when the multiple measurement protocol is applied, the code threshold significantly decreases (usually an order of magnitude) in comparison to thresholds that only consider data qubit noise (Fowler et al., 2012; Higgott et al., 2023).”
BackgroundMethodResultInfluentialNeural network decoder for near-term surface-code experiments
Varbanov, B. M., Serra-Peralta, M., Byfield, D., & Terhal, B. M. (2025) · Physical Review Research · doi:10.1103/physrevresearch.7.013029 · Cited by 20
He, T., Lin, W., Wang, R., Li, Y., Bei, J., Cai, J., Cao, S., Chen, D., Chen, K., Chen, X., et al. (2025) · Physical Review Letters · doi:10.1103/rqkg-dw31 · Cited by 14
Facilitating practical fault-tolerant quantum computing based on color codes
Zhang, J., Wu, Y.-C., & Guo, G.-P. (2024) · Physical Review Research · doi:10.1103/physrevresearch.6.033086 · Cited by 12
Metadata
- Authors
- Higgott, O., Bohdanowicz, T. C., Kubica, A., Flammia, S. T., & Campbell, E. T.
- Venue
- Physical Review X
- Publisher
- American Physical Society (APS)
- Published
- 2023-07-19
- Volume
- 13
- Issue
- 3
- ISSN
- 2160-3308 (ISSN-L)
- OpenAlex
- W4384828237
- Cited by
- 82
- References
- 31
- FWCI
- 7.03
- Type
- journal article
- Language
- en
- Open access
- gold
- Funders
- Engineering and Physical Sciences Research Council (EP/L015242/1)
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.