Fault-Tolerant One-Bit Addition with the Smallest Interesting Colour Code

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 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.

arXiv comment11 pages, 15 figures

References in corpus (17)

• QuTiP 2: A Python framework for the dynamics of open quantum systems
• Quantum Teleportation is a Universal Computational Primitive
• Universal Quantum Computation with ideal Clifford gates and noisy ancillas
• Quantum Error Correction for Quantum Memories
• Quantum Computing with Very Noisy Devices
• Quantum algorithms: an overview
• Surface code quantum computing by lattice surgery
• Demonstration of the trapped-ion quantum-CCD computer architecture
• High-fidelity parallel entangling gates on a neutral atom quantum computer
• Restrictions on Transversal Encoded Quantum Gate Sets
• A Game of Surface Codes: Large-Scale Quantum Computing with Lattice Surgery
• Qubit teleportation between non-neighboring nodes in a quantum network
• Unfolding the color code
• Efficient magic state factories with a catalyzed |CCZ> to 2|T> transformation
• Lattice Surgery with a Twist: Simplifying Clifford Gates of Surface Codes
• Distillation with sublogarithmic overhead
• Fault-tolerant quantum error correction for Steane's seven-qubit color code with few or no extra qubits

Cited by in corpus (17)

• Logical quantum processor based on reconfigurable atom arrays
• Optimized measurement-free and fault-tolerant quantum error correction for neutral atoms
• Many-hypercube codes: High-rate quantum error-correcting codes for high-performance fault-tolerant quantum computing
• Scalable noise characterization of syndrome-extraction circuits with averaged circuit eigenvalue sampling
• Performance of Quantum Approximate Optimization with Quantum Error Detection
• Resource Analysis of Low-Overhead Transversal Architectures for Reconfigurable Atom Arrays
• An Early Investigation of the HHL Quantum Linear Solver for Scientific Applications
• Quantum Circuit Discovery for Fault-Tolerant Logical State Preparation with Reinforcement Learning
• Concatenated Steane code with single-flag syndrome checks
• Exact results on finite size corrections for surface codes tailored to biased noise
• Efficient Sparse State Preparation via Quantum Walks
• Unconditionally separating noisy ${\mathsf{QNC}}^0$ from bounded polynomial threshold circuits of constant depth
• Hybrid spin-phonon architecture for scalable solid-state quantum nodes
• Quantum-network nodes with real-time noise mitigation using spectator qubits
• Quantum Zeno Dynamics of Two Interacting Particles
• Universal quantum computation via scalable measurement-free error correction
• Error detection without post-selection in adaptive quantum circuits