Author
Listed:
- Riddhi S. Gupta
(T. J. Watson Research Center
Almaden Research Center)
- Neereja Sundaresan
(T. J. Watson Research Center)
- Thomas Alexander
(T. J. Watson Research Center)
- Christopher J. Wood
(T. J. Watson Research Center)
- Seth T. Merkel
(T. J. Watson Research Center)
- Michael B. Healy
(T. J. Watson Research Center)
- Marius Hillenbrand
(IBM Deutschland Research & Development)
- Tomas Jochym-O’Connor
(T. J. Watson Research Center
Almaden Research Center)
- James R. Wootton
(IBM Research Zurich)
- Theodore J. Yoder
(T. J. Watson Research Center)
- Andrew W. Cross
(T. J. Watson Research Center)
- Maika Takita
(T. J. Watson Research Center)
- Benjamin J. Brown
(T. J. Watson Research Center
IBM Denmark)
Abstract
To run large-scale algorithms on a quantum computer, error-correcting codes must be able to perform a fundamental set of operations, called logic gates, while isolating the encoded information from noise1–8. We can complete a universal set of logic gates by producing special resources called magic states9–11. It is therefore important to produce high-fidelity magic states to conduct algorithms while introducing a minimal amount of noise to the computation. Here we propose and implement a scheme to prepare a magic state on a superconducting qubit array using error correction. We find that our scheme produces better magic states than those that can be prepared using the individual qubits of the device. This demonstrates a fundamental principle of fault-tolerant quantum computing12, namely, that we can use error correction to improve the quality of logic gates with noisy qubits. Moreover, we show that the yield of magic states can be increased using adaptive circuits, in which the circuit elements are changed depending on the outcome of mid-circuit measurements. This demonstrates an essential capability needed for many error-correction subroutines. We believe that our prototype will be invaluable in the future as it can reduce the number of physical qubits needed to produce high-fidelity magic states in large-scale quantum-computing architectures.
Suggested Citation
Riddhi S. Gupta & Neereja Sundaresan & Thomas Alexander & Christopher J. Wood & Seth T. Merkel & Michael B. Healy & Marius Hillenbrand & Tomas Jochym-O’Connor & James R. Wootton & Theodore J. Yoder & , 2024.
"Encoding a magic state with beyond break-even fidelity,"
Nature, Nature, vol. 625(7994), pages 259-263, January.
Handle:
RePEc:nat:nature:v:625:y:2024:i:7994:d:10.1038_s41586-023-06846-3
DOI: 10.1038/s41586-023-06846-3
Download full text from publisher
As the access to this document is restricted, you may want to search for a different version of it.
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:625:y:2024:i:7994:d:10.1038_s41586-023-06846-3. 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.