CoChat

Improved Decoding of Circuit Noise and Fragile Boundaries of Tailored Surface Codes

Open access
Higgott, Oscar, Bohdanowicz, Thomas C., Kubica, Aleksander, Flammia, Steven T., Campbell, Earl T. · 2023 · Physical Review X
Cited by 82

The DOI matches its Crossref record; 27 of the 27 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.

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

Integrity signals

Registry

Crossref · 10.1103/physrevx.13.031007

Cites

27 of 27 references verified0 citation errors · 0 not checkable

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.

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 27 references

Research works printed but not linked: 40

  1. 10.1063/1.1499754 · DOI · Paper page
  2. 10.1016/S0003-4916(02)00018-0 · DOI · Paper page
  3. 10.1109/TIT.2017.2663199 · DOI · Paper page
  4. 10.26421/QIC15.1-2-9 · DOI · Paper page
  5. 10.22331/q-2021-12-02-595 · DOI · Paper page
  6. 10.1103/PhysRevA.102.012419 · DOI · Paper page
  7. 10.22331/q-2018-10-19-102 · DOI · Paper page
  8. 10.26421/QIC13.11-12-4 · DOI · Paper page
  9. 10.1109/TIT.2016.2555700 · DOI · Paper page
  10. 10.1103/PhysRevX.9.021041 · DOI · Paper page
  11. 10.1103/PhysRevResearch.5.013035 · DOI
  12. 10.1103/PhysRevA.89.012317 · DOI · Paper page
  13. 10.22331/q-2023-02-21-929 · DOI · Paper page
  14. 10.1103/PhysRevA.78.052331 · DOI · Paper page
  15. 10.1103/PhysRevX.9.041031 · DOI · Paper page
  16. 10.1103/PhysRevLett.124.130501 · DOI · Paper page
  17. 10.22331/q-2018-05-04-62 · DOI · Paper page
  18. 10.22331/q-2019-03-05-128 · DOI · Paper page
  19. 10.1103/PRXQuantum.3.010331 · DOI · Paper page
  20. 10.1103/PhysRevLett.77.793 · DOI · Paper page
  21. 10.1103/PhysRevLett.128.110504 · DOI · Paper page
  22. N. Delfosse, 2014, Proceedings of the 2014 IEEE International Symposium on Information Theory
  23. 10.22331/q-2018-01-29-48 · DOI · Paper page
  24. 10.1103/PhysRevLett.119.030501 · DOI · Paper page
  25. 10.1103/PhysRevLett.128.080505 · DOI · Paper page
  26. 10.5555/2016985.2016993 · doi:10.5555/2016985.2016993
  27. 10.1109/ACCESS.2021.3118544 · DOI
  28. 10.1049/el:19961141 · DOI · Paper page
  29. D. J. MacKay, 2003, Information Theory, Inference and Learning Algorithms
  30. 10.1109/TCOMM.2005.852852 · doi:10.1109/tcomm.2005.852852
  31. 10.1016/S0003-4916(02)00019-2 · DOI · Paper page
  32. 10.1103/PhysRevLett.104.050504 · DOI · Paper page
  33. G. Duclos-Cianci, 2010, Proceedings of the 2010 IEEE Information Theory Workshop
  34. 10.26421/QIC14.9-10-1 · DOI · Paper page
  35. 10.1103/PhysRevLett.109.160503 · DOI · Paper page
  36. 10.1103/PhysRevA.89.022326 · DOI · Paper page
  37. 10.1103/PhysRevX.2.021004 · DOI · Paper page
  38. 10.22331/q-2023-05-15-1005 · DOI
  39. 10.1109/49.924874 · DOI · Paper page
  40. 10.22331/q-2020-10-28-352 · DOI · Paper page

Cited by

See all 82

Metadata

Authors
Higgott, O., Bohdanowicz, T. C., Kubica, A., Flammia, S. T., & Campbell, E. T.
Venue
Physical Review X
Published
2023-07-19
Volume
13
Issue
3
ISSN
2160-3308 (ISSN-L)
OpenAlex
W4384828237
Cited by
82
References
27
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

How to cite

Cite CoChat for the checks on this page, and the paper for its own findings.

This page
CoChat. (2026). Citation check: Improved Decoding of Circuit Noise and Fragile Boundaries of Tailored Surface Codes. https://app.cochat.ai/papers/10.1103/physrevx.13.031007
The paper
Higgott, O., Bohdanowicz, T. C., Kubica, A., Flammia, S. T., & Campbell, E. T. (2023). Improved Decoding of Circuit Noise and Fragile Boundaries of Tailored Surface Codes. Physical Review X. https://doi.org/10.1103/physrevx.13.031007

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.