IDEAS home Printed from https://ideas.repec.org/a/nat/nature/v627y2024i8005d10.1038_s41586-024-07107-7.html
   My bibliography  Save this article

High-threshold and low-overhead fault-tolerant quantum memory

Author

Listed:
  • Sergey Bravyi

    (IBM Quantum, IBM T.J. Watson Research Center)

  • Andrew W. Cross

    (IBM Quantum, IBM T.J. Watson Research Center)

  • Jay M. Gambetta

    (IBM Quantum, IBM T.J. Watson Research Center)

  • Dmitri Maslov

    (IBM Quantum, IBM T.J. Watson Research Center)

  • Patrick Rall

    (IBM Quantum, MIT-IBM Watson AI Laboratory)

  • Theodore J. Yoder

    (IBM Quantum, IBM T.J. Watson Research Center)

Abstract

The accumulation of physical errors1–3 prevents the execution of large-scale algorithms in current quantum computers. Quantum error correction4 promises a solution by encoding k logical qubits onto a larger number n of physical qubits, such that the physical errors are suppressed enough to allow running a desired computation with tolerable fidelity. Quantum error correction becomes practically realizable once the physical error rate is below a threshold value that depends on the choice of quantum code, syndrome measurement circuit and decoding algorithm5. We present an end-to-end quantum error correction protocol that implements fault-tolerant memory on the basis of a family of low-density parity-check codes6. Our approach achieves an error threshold of 0.7% for the standard circuit-based noise model, on par with the surface code7–10 that for 20 years was the leading code in terms of error threshold. The syndrome measurement cycle for a length-n code in our family requires n ancillary qubits and a depth-8 circuit with CNOT gates, qubit initializations and measurements. The required qubit connectivity is a degree-6 graph composed of two edge-disjoint planar subgraphs. In particular, we show that 12 logical qubits can be preserved for nearly 1 million syndrome cycles using 288 physical qubits in total, assuming the physical error rate of 0.1%, whereas the surface code would require nearly 3,000 physical qubits to achieve said performance. Our findings bring demonstrations of a low-overhead fault-tolerant quantum memory within the reach of near-term quantum processors.

Suggested Citation

  • Sergey Bravyi & Andrew W. Cross & Jay M. Gambetta & Dmitri Maslov & Patrick Rall & Theodore J. Yoder, 2024. "High-threshold and low-overhead fault-tolerant quantum memory," Nature, Nature, vol. 627(8005), pages 778-782, March.
  • Handle: RePEc:nat:nature:v:627:y:2024:i:8005:d:10.1038_s41586-024-07107-7
    DOI: 10.1038/s41586-024-07107-7
    as

    Download full text from publisher

    File URL: https://www.nature.com/articles/s41586-024-07107-7
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.

    File URL: https://libkey.io/10.1038/s41586-024-07107-7?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:nat:nature:v:627:y:2024:i:8005:d:10.1038_s41586-024-07107-7. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.nature.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.