Report
Fault-Tolerant One-Bit Addition with the Smallest Interesting Colour Code
العنوان: | Fault-Tolerant One-Bit Addition with the Smallest Interesting Colour Code |
---|---|
المؤلفون: | Wang, Yang, 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 |
المصدر: | Science Advances 10, 29 (2024) |
سنة النشر: | 2023 |
المجموعة: | Quantum Physics |
مصطلحات موضوعية: | Quantum Physics |
الوصف: | 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 either use 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. In this work, we implement a small quantum algorithm, one-qubit addition, fault-tolerantly on the Quantinuum H1-1 quantum computer, using the [[8,3,2]] colour 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 $\sim 1.1 \times 10^{-3}$ for the fault-tolerant circuit and $\sim 9.5 \times 10^{-3}$ for the unencoded circuit. Comment: 11 pages, 15 figures |
نوع الوثيقة: | Working Paper |
DOI: | 10.1126/sciadv.ado9024 |
URL الوصول: | http://arxiv.org/abs/2309.09893 |
رقم الانضمام: | edsarx.2309.09893 |
قاعدة البيانات: | arXiv |
DOI: | 10.1126/sciadv.ado9024 |
---|