Back to Search Start Over

Fault-tolerant one-bit addition with the smallest interesting color code.

Authors :
Yang Wang
Simsek, Selwyn
Gatterman, Thomas M.
Gerber, Justin A.
Gilmore, Kevin
Gresh, Dan
Hewitt, Nathan
Horst, Chandler V.
Matheny, Mitchell
Mengle, Tanner
Neyenhuis, Brian
Criger, Ben
Source :
Science Advances. 7/19/2024, Vol. 10 Issue 29, p1-7. 7p.
Publication Year :
2024

Abstract

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 x 10-3 for the fault-tolerant circuit and ~9.5 x 10-3 for the unencoded circuit. [ABSTRACT FROM AUTHOR]

Details

Language :
English
ISSN :
23752548
Volume :
10
Issue :
29
Database :
Academic Search Index
Journal :
Science Advances
Publication Type :
Academic Journal
Accession number :
178581389
Full Text :
https://doi.org/10.1126/sciadv.ado9024