Demonstration of fault-tolerant universal quantum gate operations
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 Müller and
Thomas Monz
Additional contact information
Lukas Postler: University of Innsbruck
Sascha Heuβen: RWTH Aachen University
Ivan Pogorelov: University of Innsbruck
Manuel Rispler: RWTH Aachen University
Thomas Feldker: University of Innsbruck
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
Philipp Schindler: University of Innsbruck
Markus Müller: RWTH Aachen University
Thomas Monz: University of Innsbruck
Nature, 2022, vol. 605, issue 7911, 675-680
Abstract:
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.
Date: 2022
References: Add references at CitEc
Citations: View citations in EconPapers (5)
Downloads: (external link)
https://www.nature.com/articles/s41586-022-04721-1 Abstract (text/html)
Access to the full text of the articles in this series is restricted.
Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.
Export reference: BibTeX
RIS (EndNote, ProCite, RefMan)
HTML/Text
Persistent link: https://EconPapers.repec.org/RePEc:nat:nature:v:605:y:2022:i:7911:d:10.1038_s41586-022-04721-1
Ordering information: This journal article can be ordered from
https://www.nature.com/
DOI: 10.1038/s41586-022-04721-1
Access Statistics for this article
Nature is currently edited by Magdalena Skipper
More articles in Nature from Nature
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().