Relaxing Hardware Requirements for Surface Code Circuits using Time-dynamics

Abstract

The typical time-independent view of quantum error correction (QEC) codes hides significant freedom in the decomposition into circuits that are executable on hardware. Using the concept of detecting regions, we design time-dynamic QEC circuits directly instead of designing static QEC codes to decompose into circuits. In particular, we improve on the standard circuit constructions for the surface code, presenting new circuits that can embed on a hexagonal grid instead of a square grid, that can use ISWAP gates instead of CNOT or CZ gates, that can exchange qubit data and measure roles, and that move logical patches around the physical qubit grid while executing. All these constructions use no additional entangling gate layers and display essentially the same logical performance, having teraquop footprints within 25% of the standard surface code circuit. We expect these circuits to be of great interest to quantum hardware engineers, because they achieve essentially the same logical performance as standard surface code circuits while relaxing demands on hardware.

References in corpus (56)

• Fault-tolerant quantum computation by anyons
• Supplementary information for "Quantum supremacy using a programmable superconducting processor"
• Surface codes: Towards practical large-scale quantum computation
• Good Quantum Error-Correcting Codes Exist
• Topological quantum memory
• Improved Simulation of Stabilizer Circuits
• Universal Quantum Computation with ideal Clifford gates and noisy ancillas
• Multiple Particle Interference and Quantum Error Correction
• Multi-particle entanglement of hot trapped ions
• Simple pulses for elimination of leakage in weakly nonlinear qubits
• How to factor 2048 bit RSA integers in 8 hours using 20 million noisy qubits
• Surface code quantum computing by lattice surgery
• Instantaneous non-local computation of low T-depth quantum circuits
• The Heisenberg Representation of Quantum Computers
• Quantum orders in an exact soluble model
• A tunable coupling scheme for implementing high-fidelity two-qubit gates
• Exponential suppression of bit or phase flip errors with repetitive error correction
• A fault-tolerant one-way quantum computer
• Stim: a fast stabilizer circuit simulator
• Quantum codes on a lattice with boundary
• Quantum Low-Density Parity-Check Codes
• Demonstrating a Continuous Set of Two-qubit Gates for Near-term Quantum Algorithms
• Measuring and Suppressing Quantum State Leakage in a Superconducting Qubit
• The XZZX Surface Code
• Process verification of two-qubit quantum gates by randomized benchmarking
• Quantum error correction with only two extra qubits
• Fast and Unconditional All-Microwave Reset of a Superconducting Qubit
• Topological and subsystem codes on low-degree graphs with flag qubits
• Optimal Resources for Topological 2D Stabilizer Codes: Comparative Study
• Microwave-induced coupling of superconducting qubits
• Dynamically Generated Logical Qubits
• Single-shot fault-tolerant quantum error correction
• Removing leakage-induced correlated errors in superconducting quantum error correction
• Tailoring surface codes for highly biased noise
• Coping with qubit leakage in topological codes
• Flag fault-tolerant error correction for any stabilizer code
• Fault-tolerant magic state preparation with flag qubits
• Experimental demonstration of continuous quantum error correction
• Tunable joint measurements in the dispersive regime of cavity QED
• Understanding the effects of leakage in superconducting quantum error detection circuits
• Adiabatic paths of Hamiltonians, symmetries of topological order, and automorphism codes
• Boundaries for the Honeycomb Code
• An Introduction to Cartan's KAK Decomposition for QC Programmers
• Benchmarking the Planar Honeycomb Code
• A hardware-efficient leakage-reduction scheme for quantum error correction with superconducting transmon qubits
• A leakage-resilient approach to fault-tolerant quantum computing with superconducting elements
• Ability of stabilizer quantum error correction to protect itself from its own imperfection
• Connectivity constrains quantum codes
• Optimal complexity correction of correlated errors in the surface code
• Leakage mitigation for quantum error correction using a mixed qubit scheme
• Cartan Decomposition of SU(2^n), Constructive Controllability of Spin systems and Universal Quantum Computing
• Qubit Parity Measurement by Parametric Driving in Circuit QED
• Opportunities and Challenges in Fault-Tolerant Quantum Computation
• PyMatching: A Python package for decoding quantum codes with minimum-weight perfect matching
• Spacetime codes of Clifford circuits
• Hardware optimized parity check gates for superconducting surface codes

Cited by in corpus (40)

• Logical quantum processor based on reconfigurable atom arrays
• Quantum Computing for High-Energy Physics: State of the Art and Challenges. Summary of the QC4HEP Working Group
• Sparse Blossom: correcting a million errors per core second with minimum-weight matching
• Unifying flavors of fault tolerance with the ZX calculus
• Creating entangled logical qubits in the heavy-hex lattice with topological codes
• Toward a 2D Local Implementation of Quantum LDPC Codes
• A Spin-Optical Quantum Computing Architecture
• Tailoring quantum error correction to spin qubits
• LDPC-cat codes for low-overhead quantum computing in 2D
• Cavity-mediated entanglement of parametrically driven spin qubits via sidebands
• Error-corrected Hadamard gate simulated at the circuit level
• Lowering Connectivity Requirements For Bivariate Bicycle Codes Using Morphing Circuits
• ERASER: Towards Adaptive Leakage Suppression for Fault-Tolerant Quantum Computing
• Comparative study of quantum error correction strategies for the heavy-hexagonal lattice
• Optimization of decoder priors for accurate quantum error correction
• Quantum SWAP gate realized with CZ and iSWAP gates in a superconducting architecture
• Perturbative stability and error correction thresholds of quantum codes
• Designing fault-tolerant circuits using detector error models
• Low-overhead quantum computing with the color code
• XYZ ruby code: Making a case for a three-colored graphical calculus for quantum error correction in spacetime
• Local Clustering Decoder as a fast and adaptive hardware decoder for the surface code
• LUCI in the Surface Code with Dropouts
• Detrimental non-Markovian errors for surface code memory
• Low-overhead fault-tolerant quantum computation by gauging logical operators
• Synchronization for Fault-Tolerant Quantum Computers
• Characterization of errors in a CNOT between surface code patches
• Decoding across transversal Clifford gates in the surface code
• Magic State Injection on IBM Quantum Processors Above the Distillation Threshold
• Achieving computational gains with quantum error-correction primitives: Generation of long-range entanglement enhanced by error detection
• Superconducting qubits in the millions: the potential and limitations of modularity
• Locating Rydberg Decay Error in SWAP-Leakage Reduction Circuit Protocol
• Leakage Mobility in Superconducting Qubits as a Leakage Reduction Unit
• Logical operations with a dynamical qubit in Floquet-Bacon-Shor code
• Wire Codes
• Planar fault-tolerant circuits for non-Clifford gates on the 2D color code
• Routing-based technique for defect mitigation in quantum error correction
• A dynamic circuit for the honeycomb Floquet code
• Simulating plasma wave propagation on a superconducting quantum chip
• Benchmarking fault-tolerant quantum computing hardware via QLOPS
• Increasing the distance of topological codes with time vortex defects