Fault-tolerant one-bit addition with the smallest interesting color code
Science Advances · 19.07.2024 · 10 (29)
DOI: 10.1126/sciadv.ado9024 ↗Kurz gefasst
Fachartikel in der Zeitschrift Science Advances, erschienen am 19.07.2024. Verfasst von Yang Wang und 11 weiteren Autor:innen. Beteiligte Einrichtung: QuTech, Delft University of Technology, PO Box 5046, 2600 GA Delft, Netherlands. Die Arbeit wurde bisher 32-mal zitiert (Crossref) und nennt 35 Literaturangaben. Der Volltext ist frei in PubMed Central verfügbar.
Abstract (Originalsprache)
Fault-tolerant operations based on stabilizer codes are the state of the art in suppressing error rates in quantum computations. Most such codes do not permit a straightforward implementation of non-Clifford logical operations, which are necessary to define a universal gate set. As a result, implementations of these operations must use either error-correcting codes with more complicated error correction procedures or gate teleportation and magic states, which are prepared at the logical level, increasing overhead to a degree that precludes near-term implementation. Here, we implement a small quantum algorithm, one-qubit addition, fault-tolerantly on a trapped-ion quantum computer, using the [[ 8 , 3 , 2 ]] color code. By removing unnecessary error correction circuits and using low-overhead techniques for fault-tolerant preparation and measurement, we reduce the number of error-prone two-qubit gates and measurements to 36. We observe arithmetic errors with a rate of ∼1.1 × 10 −3 for the fault-tolerant circuit and ∼9.5 × 10 −3 for the unencoded circuit.
Autor:innen und Institutionen
- QuTech, Delft University of Technology, PO Box 5046, 2600 GA Delft, Netherlands.
- 3. Physikalisches Institut, ZAQuant University of Stuttgart, Allmandring 13, 70569 Stuttgart, Germany.
- Quantinuum Terrington House, 13-15 Hills Road, Cambridge CB2 1NL, UK.
- Quantinuum 303 South Technology Ct., Broomfield, CO 80021, USA.
- Institute for Globally Distributed Open Research and Education (IGDORE).
ORCID-Profile: Yang Wang, Thomas M Gatterman, Justin A Gerber, Kevin Gilmore, Nathan Hewitt, Chandler V Horst, Mitchell Matheny, Ben Criger
Zitieren
APA
Wang, Y., Simsek, S., Gatterman, T. M., Gerber, J. A., Gilmore, K., Gresh, D., Hewitt, N., Horst, C. V., Matheny, M., Mengle, T., Neyenhuis, B., & Criger, B. (2024). Fault-tolerant one-bit addition with the smallest interesting color code. Science Advances, 10(29). https://doi.org/10.1126/sciadv.ado9024
Vancouver
Wang Y, Simsek S, Gatterman TM, Gerber JA, Gilmore K, Gresh D, et al. Fault-tolerant one-bit addition with the smallest interesting color code. Science Advances. 2024;10(29). doi:10.1126/sciadv.ado9024
BibTeX
@article{Wang2024,
author = {Wang, Yang and Simsek, Selwyn and Gatterman, Thomas M and Gerber, Justin A and Gilmore, Kevin and Gresh, Dan and Hewitt, Nathan and Horst, Chandler V and Matheny, Mitchell and Mengle, Tanner and Neyenhuis, Brian and Criger, Ben},
title = {Fault-tolerant one-bit addition with the smallest interesting color code},
journal = {Science Advances},
year = {2024},
volume = {10},
number = {29},
doi = {10.1126/sciadv.ado9024}
}
EUVIMED