%0 Journal Article %1 doi:10.1126/sciadv.ado9024 %A Wang, Yang %A Simsek, Selwyn %A Gatterman, Thomas M. %A Gerber, Justin A. %A Gilmore, Kevin %A Gresh, Dan %A Hewitt, Nathan %A Horst, Chandler V. %A Matheny, Mitchell %A Mengle, Tanner %A Neyenhuis, Brian %A Criger, Ben %D 2024 %J Science Advances %K pi3 %N 29 %P eado9024 %R 10.1126/sciadv.ado9024 %T Fault-tolerant one-bit addition with the smallest interesting color code %U https://www.science.org/doi/abs/10.1126/sciadv.ado9024 %V 10 %X 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. Using low-overhead fault-tolerant quantum operations, one-qubit numbers are added together, reducing error rate and overhead.

@article{doi:10.1126/sciadv.ado9024, 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 × 10−3 for the fault-tolerant circuit and ∼9.5 × 10−3 for the unencoded circuit. Using low-overhead fault-tolerant quantum operations, one-qubit numbers are added together, reducing error rate and overhead.}, added-at = {2024-07-29T11:33:55.000+0200}, 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}, biburl = {https://puma.ub.uni-stuttgart.de/bibtex/235ffe19082a353d45fe993dfacfc3662/shirschmann}, doi = {10.1126/sciadv.ado9024}, eprint = {https://www.science.org/doi/pdf/10.1126/sciadv.ado9024}, interhash = {7446f12df72d1f6f16e40021b4c1fe1a}, intrahash = {35ffe19082a353d45fe993dfacfc3662}, journal = {Science Advances}, keywords = {pi3}, number = 29, pages = {eado9024}, timestamp = {2025-02-18T13:56:20.000+0100}, title = {Fault-tolerant one-bit addition with the smallest interesting color code}, url = {https://www.science.org/doi/abs/10.1126/sciadv.ado9024}, volume = 10, year = 2024 }