CoChat

Constant-overhead fault-tolerant quantum computation with reconfigurable atom arrays

Xu, Qian, Bonilla Ataides, J. Pablo, Pattison, Christopher A., Raveendran, Nithin, Bluvstein, Dolev, Wurtz, Jonathan, Vasić, Bane, Lukin, Mikhail D., Jiang, Liang, Zhou, Hengyun · 2024 · Nature Physics
Cited by 157

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

Abstract

Quantum low-density parity-check (qLDPC) codes can achieve high encoding rates and good code distance scaling, potentially enabling low-overhead fault-tolerant quantum computing. However, implementing qLDPC codes involves nonlocal operations that require long-range connectivity between qubits. This makes their physical realization challenging in comparison to geometrically local codes, such as the surface code. Here we propose a hardware-efficient scheme for fault-tolerant quantum computation with high-rate qLDPC codes that is compatible with the recently demonstrated capabilities of reconfigurable atom arrays. Our approach utilizes the product structure inherent in many qLDPC codes to implement the nonlocal syndrome extraction circuit through atom rearrangement, resulting in an effectively constant overhead. We prove the fault tolerance of these protocols, and our simulations show that the qLDPC-based architecture starts to outperform the surface code with as few as several hundred physical qubits. We further find that quantum algorithms involving thousands of logical qubits can be performed using less than 105 physical qubits. Our work suggests that low-overhead quantum computing with qLDPC codes is within reach using current experimental technologies. Quantum low-density parity-check codes are highly efficient in principle but challenging to implement in practice. This proposal shows that these codes could be implemented in the near term using recently demonstrated neutral-atom arrays.

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/s41567-024-02479-z

Cites

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

Research works printed but not linked: 46

  1. Litinski, D. A game of surface codes: large-scale quantum computing with lattice surgery. Quantum 3, 128 (2019). · DOI · Paper page
  2. Beverland, M. E. et al. Assessing requirements to scale to practical quantum advantage. Preprint at https://arxiv.org/abs/2211.07629 (2022). · arXiv
  3. Kitaev, A. Y. Fault-tolerant quantum computation by anyons. Ann. Phys. 303, 2–30 (2003). · DOI · Paper page
  4. Tillich, J. P. & Zemor, G. Quantum LDPC codes with positive rate and minimum distance proportional to the square root of the blocklength. IEEE Trans. Inf. Theory 60, 1193–1202 (2014). · DOI · Paper page
  5. Panteleev, P. & Kalachev, G. Quantum LDPC codes with almost linear minimum distance. IEEE Trans. Inf. Theory 68, 213–229 (2022). · DOI · Paper page
  6. Breuckmann, N. P. & Eberhardt, J. N. Balanced product quantum codes. IEEE Trans. Inf. Theory 67, 6653–6674 (2020). · DOI · Paper page
  7. Bravyi, S., Poulin, D. & Terhal, B. Tradeoffs for reliable quantum information storage in 2D systems. Phys. Rev. Lett. 104, 050503 (2010). · DOI · Paper page
  8. Baspin, N. & Krishna, A. Connectivity constrains quantum codes. Quantum 6, 711 (2021). · DOI
  9. Baspin, N. & Krishna, A. Quantifying nonlocality: how outperforming local quantum codes is expensive. Phys. Rev. Lett. 129, 050505 (2022). · DOI
  10. Delfosse, N., Beverland, M. E. & Tremblay, M. A. Bounds on stabilizer measurement circuits and obstructions to local implementations of quantum LDPC codes. Preprint at https://arxiv.org/abs/2109.14599v1 (2021). · arXiv
  11. Strikis, A. & Berent, L. Quantum low-density parity-check codes for modular architectures. PRX Quantum 4, 020321 (2023). · DOI
  12. Gottesman, D. Fault-tolerant quantum computation with constant overhead. Quantum Inf. Comput. 14, 1338–1372 (2013).
  13. Cohen, L. Z., Kim, I. H., Bartlett, S. D. & Brown, B. J. Low-overhead fault-tolerant quantum computing using long-range connectivity. Sci. Adv. 8, eabn1717 (2022). · DOI · Paper page
  14. Krishna, A. & Poulin, D. Fault-tolerant gates on hypergraph product codes. Phys. Rev. X 11, 011023 (2021).
  15. Breuckmann, N. P. & Burton, S. Fold-transversal Clifford gates for quantum codes. Preprint at https://arxiv.org/abs/2202.06647v2 (2022). · arXiv
  16. Quintavalle, A. O., Webster, P. & Vasmer, M. Partitioning qubits in hypergraph product codes to implement logical gates. Preprint at https://arxiv.org/abs/2204.10812v2 (2022). · DOI
  17. Bluvstein, D. et al. A quantum processor based on coherent transport of entangled atom arrays. Nature 604, 451–456 (2022). · DOI · Paper page
  18. Ma, S. et al. Universal gate operations on nuclear spin qubits in an optical tweezer array of 171Yb atoms. Phys. Rev. X 12, 021028 (2022).
  19. Ma, S. et al. High-fidelity gates with mid-circuit erasure conversion in a metastable neutral atom qubit. Preprint at https://arxiv.org/abs/2305.05493v1 (2023). · arXiv
  20. Scholl, P. et al. Erasure-cooling, control, and hyper-entanglement of motion in optical tweezers. Preprint at https://arxiv.org/abs/2311.15580v1 (2023). · arXiv
  21. Hashizume, T., Bentsen, G. S., Weber, S. & Daley, A. J. Deterministic fast scrambling with neutral atom arrays. Phys. Rev. Lett. 126, 200603 (2021). · DOI
  22. Leverrier, A., Tillich, J. P. & Zemor, G. Quantum expander codes. In Proc. Annual IEEE Symposium on Foundations of Computer Science 810–824 (IEEE, 2015). · DOI · Paper page
  23. Quintavalle, A. O., Vasmer, M., Roffe, J. & Campbell, E. T. Single-shot error correction of three-dimensional homological product codes. PRX Quantum 2, 020340 (2020). · DOI
  24. Bombin, H. Single-shot fault-tolerant quantum error correction. Phys. Rev. X 5, 031043 (2015).
  25. Higgott, O. & Breuckmann, N. P. Improved single-shot decoding of higher-dimensional hypergraph-product codes. PRX Quantum 4, 020332 (2023). · DOI
  26. Kuo, K. Y. & Lai, C. Y. Exploiting degeneracy in belief propagation decoding of quantum codes. npj Quantum Inf. 8, 111 (2022). · DOI
  27. Higgott, O., Bohdanowicz, T. C., Kubica, A., Flammia, S. T. & Campbell, E. T. Improved decoding of circuit noise and fragile boundaries of tailored surface codes. Phys. Rev. X 13, 031007 (2023).
  28. Delfosse, N. & Paetznick, A. Spacetime codes of Clifford circuits. Preprint at https://arxiv.org/abs/2304.05943v2 (2023). · arXiv
  29. Grospellier, A., Grouès, L., Krishna, A. & Leverrier, A. Combining hard and soft decoders for hypergraph product codes. Quantum 5, 432 (2021). · DOI
  30. Ebadi, S. et al. Quantum optimization of maximum independent set using Rydberg atom arrays. Science 376, 1209–1215 (2022). · DOI · Paper page
  31. Wang, D. S., Fowler, A. G. & Hollenberg, L. C. L. Surface code quantum computing with error rates over 1. Phys. Rev. A 83, 020302 (2011). · DOI · Paper page
  32. Breuckmann, N. P., Vuillot, C., Campbell, E., Krishna, A. & Terhal, B. M. Hyperbolic and semi-hyperbolic surface codes for quantum storage. Quantum Sci. Technol. 2, 035007 (2017). · DOI
  33. Poulsen Nautrup, H., Friis, N. & Briegel, H. J. Fault-tolerant interface between quantum memories and quantum processors. Nat. Commun. 8, 1321 (2017). · DOI
  34. Hong, Y., Marinelli, M., Kaufman, A. M. & Lucas, A. Long-range-enhanced surface codes. Preprint at https://arxiv.org/abs/2309.11719v1 (2023). · arXiv
  35. Fahimniya, A. et al. Fault-tolerant hyperbolic Floquet quantum error correcting codes. Preprint at https://arxiv.org/abs/2309.10033v2 (2023). · arXiv
  36. Higgott, O. & Breuckmann, N. P. Constructions and performance of hyperbolic and semi-hyperbolic Floquet codes. Preprint at https://arxiv.org/abs/2308.03750v1 (2023). · arXiv
  37. Anshu, A., Breuckmann, N. P. & Nirkhe, C. NLTS Hamiltonians from good quantum codes. Preprint at https://arxiv.org/abs/2206.13228v2 (2022). · DOI
  38. Gu, S., Pattison, C. A. & Tang, E. An efficient decoder for a linear distance quantum LDPC code. In Proc. Annual ACM Symposium on Theory of Computing 919–932 (ACM, 2022). · DOI
  39. Dinur, I., Hsieh, M.-H. H., Lin, T.-C. C. & Vidick, T. Good quantum LDPC codes with linear time decoders. In Proc. Annual ACM Symposium on Theory of Computing 905–918 (ACM, 2022). · DOI
  40. Lin, T.-C. & Hsieh, M.-H. Good quantum LDPC codes with linear time decoder from lossless expanders. Preprint at https://arxiv.org/abs/2203.03581v1 (2022). · arXiv
  41. Richardson, T. & Urbanke, R. Modern Coding Theory (Cambridge Univ. Press, 2008). · DOI · Paper page
  42. Fawzi, O., Grospellier, A. & Leverrier, A. Efficient decoding of random errors for quantum expander codes. In Proc. Annual ACM Symposium on Theory of Computing 878–889 (ACM, 2017). · DOI
  43. Raveendran, N. et al. Finite rate QLDPC-GKP coding scheme that surpasses the CSS Hamming bound. Quantum 6, 767 (2022). · DOI
  44. Dordevic, T. et al. Entanglement transport and a nanophotonic interface for atoms in optical tweezers. Science 373, 1511–1514 (2021). · DOI · Paper page
  45. Levine, H. et al. Parallel implementation of high-fidelity multiqubit gates with neutral atoms. Phys. Rev. Lett. 123, 170503 (2019). · DOI · Paper page
  46. Baspin, N., Fawzi, O. & Shayeghi, A. A lower bound on the overhead of quantum error correction in low dimensions. Preprint at https://arxiv.org/abs/2302.04317v1 (2023). · arXiv

Cited by

See all 157

Metadata

Authors
Xu, Q., Bonilla Ataides, J. P., Pattison, C. A., Raveendran, N., Bluvstein, D., Wurtz, J., Vasić, B., Lukin, M. D., Jiang, L., & Zhou, H.
Venue
Nature Physics
Published
2024-04-29
Volume
20
Issue
7
Pages
1084-1090
ISSN
  • 1745-2473 (ISSN-L)
  • 1745-2481
OpenAlex
W4396237843
Cited by
157
References
20
FWCI
23.22
Type
journal article
Language
en
Open access
closed
Licence
Funders
  • United States Department of Defense | United States Army | U.S. Army Research, Development and Engineering Command | Army Research Office (W911NF-20-1-0082, W911NF-23-1-0077, W911NF-23-1-0077, W911NF-21-1-0325)
  • U.S. Department of Energy (756817, DE-SC0021013)
  • National Science Foundation (PHY-1734011, CCF-2313084, CIF-1855879, CCF-2100013, CIF-2106189, PHY-1734011, DGE1745303, OMA-1936118, ERC-1941583, OMA-2137642)
  • United States Department of Defense | Defense Advanced Research Projects Agency (W911NF2010021)
  • Ramsay Centre for Western Civilisation, post-graduate fellowship.
  • Hertz Foundation
  • United States Department of Defense | United States Air Force | AFMC | Air Force Office of Scientific Research (FA9550-19-1-0399, FA9550-21-1-0209)
  • Nippon Telegraph and Telephone
  • David and Lucile Packard Foundation

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: Constant-overhead fault-tolerant quantum computation with reconfigurable atom arrays. https://app.cochat.ai/papers/10.1038/s41567-024-02479-z
The paper
Xu, Q., Bonilla Ataides, J. P., Pattison, C. A., Raveendran, N., Bluvstein, D., Wurtz, J., Vasić, B., Lukin, M. D., Jiang, L., & Zhou, H. (2024). Constant-overhead fault-tolerant quantum computation with reconfigurable atom arrays. Nature Physics. https://doi.org/10.1038/s41567-024-02479-z

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.