CoChat

Parallel window decoding enables scalable fault tolerant quantum computation

Open access
Skoric, Luka, Browne, Dan E., Barnes, Kenton M., Gillespie, Neil I., Campbell, Earl T. · 2023 · Nature Communications
Cited by 80

The DOI matches its Crossref record; 19 of the 19 references it cites were found in a registry or an index.

Abstract

Large-scale quantum computers have the potential to hold computational capabilities beyond conventional computers. However, the physical qubits are prone to noise which must be corrected in order to perform fault-tolerant quantum computations. Quantum Error Correction (QEC) provides the path for realizing such computations. QEC generates a continuous stream of data that decoders must process at the rate it is received, which can be as fast as 1 μ s per QEC round in superconducting quantum computers. If the decoder infrastructure cannot keep up, a data backlog problem is encountered and the computation runs exponentially slower. Today’s leading approaches to quantum error correction are not scalable as existing decoders typically run slower as the problem size is increased, inevitably hitting the backlog problem. Here, we show how to parallelize decoding to achieve almost arbitrary speed, removing this roadblock to scalability. Our parallelization requires some classical feed forward decisions to be delayed, slowing-down the logical clock speed. However, the slow-down is now only polynomial in the size of the QEC code, averting the exponential slowdown. We numerically demonstrate our parallel decoder for the surface code, showing no noticeable reduction in logical fidelity compared to previous decoders and demonstrating the predicted speedup.

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.1038/s41467-023-42482-1

Cites

19 of 19 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 19 references

Research works printed but not linked: 31

  1. Litinski, D. A game of surface codes: Large-scale quantum computing with lattice surgery. Quantum 3, 128 (2019). · DOI · Paper page
  2. DiVincenzo, D. P. & Aliferis, P. Effective fault-tolerant quantum computation with slow measurements. Phys. Rev. Lett. 98, 020501 (2007). · DOI · Paper page
  3. Chamberland, C., Iyer, P. & Poulin, D. Fault-tolerant quantum computing in the Pauli or Clifford frame with slow error diagnostics. Quantum 2, 43 (2018). · DOI · Paper page
  4. Holmes, A. et al. Nisq+: Boosting quantum computing power by approximating quantum error correction, in 2020 ACM/IEEE 47th Annual International Symposium on Computer Architecture (ISCA) (IEEE, 2020) pp. 556–569. · DOI
  5. Chamberland, C., Goncalves, L., Sivarajah, P., Peterson, E. & Grimberg, S. Techniques for combining fast local decoders with global decoders under circuit-level noise. Quantum Sci. Technol. 8, 045011 (2023). · DOI
  6. Dennis, E., Kitaev, A., Landahl, A. & Preskill, J. Topological quantum memory. J. Math. Phys. 43, 4452 (2002). · DOI · Paper page
  7. Higgott, O., PyMatching: A python package for decoding quantum codes with minimum-weight perfect matching, arXiv preprint arXiv:2105.13082 (2021). · DOI · Paper page
  8. Delfosse, N. & Nickerson, N. H. Almost-linear time decoding algorithm for topological codes. Quantum 5, 595 (2021). · DOI · Paper page
  9. Das, P. et al. A scalable decoder micro-architecture for fault-tolerant quantum computing, arXiv preprint arXiv:2001.06598 (2020). · arXiv
  10. Huang, S. & Brown, K. R. Between shor and steane: A unifying construction for measuring error syndromes. Phys. Rev. Lett. 127, 090505 (2021). · DOI
  11. Iyengar, A. R. et al. Windowed decoding of protograph-based LDPC convolutional codes over erasure channels. IEEE Trans. Inf. Theory 58, 2303 (2012). · DOI · Paper page
  12. Tan, X., Zhang, F., Chao, R., Shi, Y., and Chen, J., Scalable surface code decoders with parallelization in time, arXiv preprint arXiv:2209.09219 (2022). · DOI · Paper page
  13. Bombín, H. Single-shot fault-tolerant quantum error correction. Phys. Rev. X 5, 031043 (2015).
  14. Brown, B. J., Nickerson, N. H. & Browne, D. E. Fault-tolerant error correction with the gauge color code. Nat. Commun. 7, 12302 (2016). · DOI · Paper page
  15. Quintavalle, A. O., Vasmer, M., Roffe, J. & Campbell, E. T. Single-shot error correction of three-dimensional homological product codes. PRX Quantum 2, 020340 (2021). · DOI
  16. Kubica, A. & Vasmer, M. Single-shot quantum error correction with the three-dimensional subsystem toric code. Nat. Commun. 13, 6272 (2022). · DOI
  17. Higgott, O. and Breuckmann, N. P., Improved single-shot decoding of higher dimensional hypergraph product codes, arXiv preprint arXiv:2206.03122 (2022). · DOI
  18. Gidney, C. and Fowler, A. G., Flexible layout of surface code computations using autoccz states, arXiv preprint arXiv:1905.08916 (2019). · arXiv
  19. Kivlichan, I. D. et al. Improved fault-tolerant quantum simulation of condensed-phase correlated electrons via trotterization. Quantum 4, 296 (2020). · DOI · Paper page
  20. Chamberland, C. & Campbell, E. T. Universal quantum computing with twist-free and temporally encoded lattice surgery. PRX Quantum 3, 010331 (2022). · DOI · Paper page
  21. Darmawan, A. S. & Poulin, D. Tensor-network simulations of the surface code under realistic noise. Phys. Rev. Lett. 119, 040502 (2017). · DOI · Paper page
  22. Higgott, O., Bohdanowicz, T. C., Kubica, A., Flammia, S. T., and Campbell, E. T., Fragile boundaries of tailored surface codes, arXiv preprint arXiv:2203.04948 (2022). · arXiv
  23. Chamberland, C. & Campbell, E. T. Circuit-level protocol and analysis for twist-based lattice surgery. Phys. Rev. Res. 4, 023090 (2022). · DOI
  24. Fawzi, O., Grospellier, A., and Leverrier, A., Constant overhead quantum fault-tolerance with quantum expander codes, in 2018 IEEE 59th Annual Symposium on Foundations of Computer Science (FOCS) (IEEE, 2018) pp. 743–754. · doi:10.1109/focs.2018.00076 · Paper page
  25. Das, P., Locharla, A., and Jones, C., Lilliput: A lightweight low-latency lookup-table based decoder for near-term quantum error correction, arXiv preprint arXiv:2108.06569 (2021). · DOI
  26. Barber, B. et al. A real-time, scalable, fast and highly resource efficient decoder for a quantum computer, arXiv preprint arXiv:2309.05558 (2023). · arXiv
  27. Fowler, A. Minimum weight perfect matching of fault-tolerant topological quantum error correction in average o(1) parallel time. Quantum Inf. Comput. 15, 145 (2015).
  28. Anwar, H., Brown, B. J., Campbell, E. T. & Browne, D. E. Fast decoders for qudit topological codes. N. J. Phys. 16, 063038 (2014). · DOI · Paper page
  29. Ueno, Y., Kondo, M., Tanaka, M., Suzuki, Y., and Tabuchi, Y., Qecool: On-line quantum error correction with a superconducting decoder for surface code, in 2021 58th ACM/IEEE Design Automation Conference (DAC) (IEEE, 2021) pp. 451–456. · DOI
  30. Meinerz, K., Park, C.-Y. & Trebst, S. Scalable neural decoder for topological surface codes. Phys. Rev. Lett. 128, 080505 (2022). · DOI · Paper page
  31. Ueno, Y., Kondo, M., Tanaka, M., Suzuki, Y., and Tabuchi, Y., Neo-qec: Neural network enhanced online superconducting decoder for surface codes, arXiv preprint arXiv:2208.05758 (2022). · arXiv

Cited by

See all 80

Metadata

Authors
Skoric, L., Browne, D. E., Barnes, K. M., Gillespie, N. I., & Campbell, E. T.
Venue
Nature Communications
Published
2023-11-03
Volume
14
Issue
1
Pages
7040-7040
ISSN
2041-1723 (ISSN-L)
OpenAlex
W4388284400
Cited by
80
References
19
FWCI
6.94
Type
journal article
Language
en
Open access
gold
Licence

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: Parallel window decoding enables scalable fault tolerant quantum computation. https://app.cochat.ai/papers/10.1038/s41467-023-42482-1
The paper
Skoric, L., Browne, D. E., Barnes, K. M., Gillespie, N. I., & Campbell, E. T. (2023). Parallel window decoding enables scalable fault tolerant quantum computation. Nature Communications. https://doi.org/10.1038/s41467-023-42482-1

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.