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 [Formula: see text] 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 for the fault-tolerant circuit and ∼9.5 × 10 for the unencoded circuit.
Download full-text PDF |
Source |
---|---|
http://www.ncbi.nlm.nih.gov/pmc/articles/PMC11259164 | PMC |
http://dx.doi.org/10.1126/sciadv.ado9024 | DOI Listing |
Enter search terms and have AI summaries delivered each week - change queries or unsubscribe any time!