IDEAS home Printed from https://ideas.repec.org/a/nat/nature/v605y2022i7911d10.1038_s41586-022-04721-1.html
   My bibliography  Save this article

Demonstration of fault-tolerant universal quantum gate operations

Author

Listed:
  • Lukas Postler

    (University of Innsbruck)

  • Sascha Heuβen

    (RWTH Aachen University
    Forschungszentrum Jülich)

  • Ivan Pogorelov

    (University of Innsbruck)

  • Manuel Rispler

    (RWTH Aachen University
    Forschungszentrum Jülich)

  • Thomas Feldker

    (University of Innsbruck
    Alpine Quantum Technologies GmbH)

  • Michael Meth

    (University of Innsbruck)

  • Christian D. Marciniak

    (University of Innsbruck)

  • Roman Stricker

    (University of Innsbruck)

  • Martin Ringbauer

    (University of Innsbruck)

  • Rainer Blatt

    (University of Innsbruck
    Austrian Academy of Sciences)

  • Philipp Schindler

    (University of Innsbruck)

  • Markus Müller

    (RWTH Aachen University
    Forschungszentrum Jülich)

  • Thomas Monz

    (University of Innsbruck
    Alpine Quantum Technologies GmbH)

Abstract

Quantum computers can be protected from noise by encoding the logical quantum information redundantly into multiple qubits using error-correcting codes1,2. When manipulating the logical quantum states, it is imperative that errors caused by imperfect operations do not spread uncontrollably through the quantum register. This requires that all operations on the quantum register obey a fault-tolerant circuit design3–5, which, in general, increases the complexity of the implementation. Here we demonstrate a fault-tolerant universal set of gates on two logical qubits in a trapped-ion quantum computer. In particular, we make use of the recently introduced paradigm of flag fault tolerance, where the absence or presence of dangerous errors is heralded by the use of auxiliary flag qubits6–10. We perform a logical two-qubit controlled-NOT gate between two instances of the seven-qubit colour code11,12, and fault-tolerantly prepare a logical magic state8,13. We then realize a fault-tolerant logical T gate by injecting the magic state by teleportation from one logical qubit onto the other14. We observe the hallmark feature of fault tolerance—a superior performance compared with a non-fault-tolerant implementation. In combination with recently demonstrated repeated quantum error-correction cycles15,16, these results provide a route towards error-corrected universal quantum computation.

Suggested Citation

  • Lukas Postler & Sascha Heuβen & Ivan Pogorelov & Manuel Rispler & Thomas Feldker & Michael Meth & Christian D. Marciniak & Roman Stricker & Martin Ringbauer & Rainer Blatt & Philipp Schindler & Markus, 2022. "Demonstration of fault-tolerant universal quantum gate operations," Nature, Nature, vol. 605(7911), pages 675-680, May.
  • Handle: RePEc:nat:nature:v:605:y:2022:i:7911:d:10.1038_s41586-022-04721-1
    DOI: 10.1038/s41586-022-04721-1
    as

    Download full text from publisher

    File URL: https://www.nature.com/articles/s41586-022-04721-1
    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-022-04721-1?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.

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Neereja Sundaresan & Theodore J. Yoder & Youngseok Kim & Muyuan Li & Edward H. Chen & Grace Harper & Ted Thorbeck & Andrew W. Cross & Antonio D. Córcoles & Maika Takita, 2023. "Demonstrating multi-round subsystem quantum error correction using matching and maximum likelihood decoders," Nature Communications, Nature, vol. 14(1), pages 1-13, December.
    2. Yue Wu & Shimon Kolkowitz & Shruti Puri & Jeff D. Thompson, 2022. "Erasure conversion for fault-tolerant quantum computing in alkaline earth Rydberg atom arrays," Nature Communications, Nature, vol. 13(1), pages 1-7, December.
    3. Grigory E. Astrakharchik & Luis A. Peña Ardila & Krzysztof Jachymski & Antonio Negretti, 2023. "Many-body bound states and induced interactions of charged impurities in a bosonic bath," Nature Communications, Nature, vol. 14(1), pages 1-11, December.

    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:605:y:2022:i:7911:d:10.1038_s41586-022-04721-1. 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.