Lattice Surgery with a Twist: Simplifying Clifford Gates of Surface Codes

Abstract

We present a planar surface-code-based scheme for fault-tolerant quantum computation which eliminates the time overhead of single-qubit Clifford gates, and implements long-range multi-target CNOT gates with a time overhead that scales only logarithmically with the control-target separation. This is done by replacing hardware operations for single-qubit Clifford gates with a classical tracking protocol. Inter-qubit communication is added via a modified lattice surgery protocol that employs twist defects of the surface code. The long-range multi-target CNOT gates facilitate magic state distillation, which renders our scheme fault-tolerant and universal.

16 pages, 18 figures

References in corpus (5)

• Surface codes: Towards practical large-scale quantum computation
• Topological Quantum Distillation
• Topological Order with a Twist: Ising Anyons from an Abelian Model
• Low-distance Surface Codes under Realistic Quantum Noise
• Braiding by Majorana Tracking and Long-Range CNOT Gates with Color Codes

Cited by in corpus (55)

• A Game of Surface Codes: Large-Scale Quantum Computing with Lattice Surgery
• Blueprint for a Scalable Photonic Fault-Tolerant Quantum Computer
• Building a fault-tolerant quantum computer using concatenated cat codes
• The XZZX Surface Code
• Magic State Distillation: Not as Costly as You Think
• Quantum Error Correction with the Gottesman-Kitaev-Preskill Code
• Universal quantum computing with twist-free and temporally encoded lattice surgery
• Improved decoding of circuit noise and fragile boundaries of tailored surface codes
• Three-dimensional surface codes: Transversal gates and fault-tolerant architectures
• Reinforcement Learning Decoders for Fault-Tolerant Quantum Computation
• Anyon condensation and the color code
• The boundaries and twist defects of the color code and their applications to topological quantum computation
• Code Deformation and Lattice Surgery Are Gauge Fixing
• Transversality and lattice surgery: exploring realistic routes towards coupled logical qubits with trapped-ion quantum processors
• The Impact of Hardware Specifications on Reaching Quantum Advantage in the Fault Tolerant Regime
• Partially Fault-tolerant Quantum Computing Architecture with Error-corrected Clifford Gates and Space-time Efficient Analog Rotations
• Quantum Resources Required to Block-Encode a Matrix of Classical Data
• SQUARE: Strategic Quantum Ancilla Reuse for Modular Quantum Programs via Cost-Effective Uncomputation
• A circuit-level protocol and analysis for twist-based lattice surgery
• Fault-Tolerant One-Bit Addition with the Smallest Interesting Colour Code
• Techniques for combining fast local decoders with global decoders under circuit-level noise
• Pseudo-2D superconducting quantum computing circuit for the surface code: the proposal and preliminary tests
• A High Performance Compiler for Very Large Scale Surface Code Computations
• Low overhead Clifford gates from joint measurements in surface, color, and hyperbolic codes
• Quantum simulation of battery materials using ionic pseudopotentials
• Towards early fault tolerance on a 2$\times$N array of qubits equipped with shuttling
• End-to-end resource analysis for quantum interior point methods and portfolio optimization
• Error-corrected Hadamard gate simulated at the circuit level
• Lattice Surgery on the Raussendorf Lattice
• Error correction of transversal CNOT gates for scalable surface code computation
• Resource Optimized Quantum Architectures for Surface Code Implementations of Magic-State Distillation
• Realistic Cost to Execute Practical Quantum Circuits using Direct Clifford+T Lattice Surgery Compilation
• Tangling schedules eases hardware connectivity requirements for quantum error correction
• Decoding Merged Color-Surface Codes and Finding Fault-Tolerant Clifford Circuits Using Solvers for Satisfiability Modulo Theories
• Compilation of a simple chemistry application to quantum error correction primitives
• Universal resource-efficient topological measurement-based quantum computation via color-code-based cluster states
• Fault-tolerant logical measurements via homological measurement
• Pauli-based model of quantum computation with higher-dimensional systems
• Low-overhead quantum computing with the color code
• TISCC: A Surface Code Compiler and Resource Estimator for Trapped-Ion Processors
• Low-overhead magic state distillation with color codes
• Spatially parallel decoding for multi-qubit lattice surgery
• A new twist on the Majorana surface code: Bosonic and fermionic defects for fault-tolerant quantum computation
• Snakes and Ladders: Adapting the surface code to defects
• Synchronization for Fault-Tolerant Quantum Computers
• Characterization of errors in a CNOT between surface code patches
• Certifying nonstabilizerness in quantum processors
• Superconducting qubits in the millions: the potential and limitations of modularity
• Fermionic anyons: entanglement and quantum computation from a resource-theoretic perspective
• Low Depth Phase Oracle Using a Parallel Piecewise Circuit
• Error-mitigated initialization of surface codes with non-Pauli stabilizers
• Network Requirements for Distributed Quantum Computation
• qSIEVE: Efficient qLDPC Memory via Systolic Movement in Atom Arrays
• A dynamic circuit for the honeycomb Floquet code
• Dense packing of the surface code: code deformation procedures and hook-error-avoiding gate scheduling