Classification of topologically protected gates for local stabilizer codes

Abstract

Given a quantum error correcting code, an important task is to find encoded operations that can be implemented efficiently and fault-tolerantly. In this Letter we focus on topological stabilizer codes and encoded unitary gates that can be implemented by a constant-depth quantum circuit. Such gates have a certain degree of protection since propagation of errors in a constant-depth circuit is limited by a constant size light cone. For the 2D geometry we show that constant-depth circuits can only implement a finite group of encoded gates known as the Clifford group. This implies that topological protection must be "turned off" for at least some steps in the computation in order to achieve universality. For the 3D geometry we show that an encoded gate U is implementable by a constant-depth circuit only if the image of any Pauli operator under conjugation by U belongs to the Clifford group. This class of gates includes some non-Clifford gates such as the π/8 rotation. Our classification applies to any stabilizer code with geometrically local stabilizers and sufficiently large code distance.

6 pages, 2 figures

References in corpus (11)

• Local stabilizer codes in three dimensions without string logical operators
• Topological Quantum Distillation
• Lieb-Robinson bounds and the generation of correlations and topological quantum order
• Topological fault-tolerance in cluster state quantum computation
• Restrictions on Transversal Encoded Quantum Gate Sets
• Topological Order with a Twist: Ising Anyons from an Abelian Model
• Quantum computing with nearest neighbor interactions and error rates over 1%
• A no-go theorem for a two-dimensional self-correcting quantum memory based on stabilizer codes
• Topological Computation without Braiding
• Universal topological phase of 2D stabilizer codes
• Logical operator tradeoff for local quantum codes

Cited by in corpus (111)

• Quantum Error Correction for Quantum Memories
• Building logical qubits in a superconducting quantum computing system
• Roads towards fault-tolerant universal quantum computation
• The Future of Quantum Computing with Superconducting Qubits
• Quantum Low-Density Parity-Check Codes
• Improved classical simulation of quantum circuits dominated by Clifford gates
• Quantum memories at finite temperature
• Enhanced fault-tolerant quantum computing in $d$-level systems
• Quantum computing with rotation-symmetric bosonic codes
• Single-shot fault-tolerant quantum error correction
• Topological phases with generalized global symmetries
• Optimizing Quantum Error Correction Codes with Reinforcement Learning
• Unfolding the color code
• Focus beyond quadratic speedups for error-corrected quantum advantage
• Universal transversal gates with color codes - a simplified approach
• Lower bounds on the non-Clifford resources for quantum computations
• Factoring 2048-bit RSA Integers in 177 Days with 13436 Qubits and a Multimode Memory
• Fault-tolerant logical gates in quantum error-correcting codes
• Fault-tolerant error correction with the gauge color code
• Triangular color codes on trivalent graphs with flag qubits
• Topological color code and symmetry-protected topological phases
• Continuous symmetries and approximate quantum error correction
• The cost of universality: A comparative study of the overhead of state distillation and code switching with color codes
• Diagonal gates in the Clifford hierarchy
• Three-dimensional surface codes: Transversal gates and fault-tolerant architectures
• A fault-tolerant non-Clifford gate for the surface code in two dimensions
• Gapped boundaries, group cohomology and fault-tolerant logical gates
• Anyon condensation and the color code
• Magic State Distillation with Low Space Overhead and Optimal Asymptotic Input Count
• The boundaries and twist defects of the color code and their applications to topological quantum computation
• Codimension-2 defects and higher symmetries in (3+1)D topological phases
• A logical qubit in a linear array of semiconductor quantum dots
• Protected gates for topological quantum field theories
• Using Quantum Metrological Bounds in Quantum Error Correction: A Simple Proof of the Approximate Eastin-Knill Theorem
• Experimental Demonstration of Logical Magic State Distillation
• Continuous groups of transversal gates for quantum error correcting codes from finite clock reference frames
• The disjointness of stabilizer codes and limitations on fault-tolerant logical gates
• Topological Order, Quantum Codes and Quantum Computation on Fractal Geometries
• Transversal Clifford gates on folded surface codes
• Stacked codes: universal fault-tolerant quantum computation in a two-dimensional layout
• Qudit Colour Codes and Gauge Colour Codes in All Spatial Dimensions
• Fault-Tolerant Quantum Gates with Defects in Topological Stabiliser Codes
• Locality-Preserving Logical Operators in Topological Stabiliser Codes
• Higher-group symmetry in finite gauge theory and stabilizer codes
• Fault-tolerant interface between quantum memories and quantum processors
• New perspectives on covariant quantum error correction
• Partitioning qubits in hypergraph product codes to implement logical gates
• Connectivity constrains quantum codes
• Universal logical gates with constant overhead: instantaneous Dehn twists for hyperbolic quantum codes
• Cellular automaton decoders for topological quantum codes with noisy measurements and beyond
• Thresholds for correcting errors, erasures, and faulty syndrome measurements in degenerate quantum codes
• Gauge color codes in two dimensions
• Shorter quantum circuits via single-qubit gate approximation
• Limits on the storage of quantum information in a volume of space
• Optimal Thresholds for Fracton Codes and Random Spin Models with Subsystem Symmetry
• Efficient color code decoders in $d\ge 2$ dimensions from toric code decoders
• Quantum Origami: Transversal Gates for Quantum Computation and Measurement of Topological Order
• Universal Fault-Tolerant Quantum Computing with Stabiliser Codes
• Tensor Networks with a Twist: Anyon-permuting domain walls and defects in PEPS
• Topological wormholes
• Renormalization group decoder for a four-dimensional toric code
• Numerical Implementation of Just-In-Time Decoding in Novel Lattice Slices Through the Three-Dimensional Surface Code
• A four-dimensional toric code with non-Clifford transversal gates
• Magic State Distillation from Entangled States
• Universal fault-tolerant quantum computation with Bacon-Shor codes
• Approximate symmetries and quantum error correction
• Fault-tolerant Compass Codes
• Quasi-exact quantum computation
• Instantaneous braids and Dehn twists in topologically ordered states
• Achieving fault tolerance on capped color codes with few ancillas
• Error rates and resource overheads of encoded three-qubit gates
• Fault-tolerant gates via homological product codes
• Quantum error correction with fractal topological codes
• Long-range-enhanced surface codes
• Theory of quasi-exact fault-tolerant quantum computing and valence-bond-solid codes
• Fault-tolerant logical gates in holographic stabilizer codes are severely restricted
• Universal Logical Gates on Topologically Encoded Qubits via Constant-Depth Unitary Circuits
• Topological qubits from valence bond solids
• Lifting topological codes: Three-dimensional subsystem codes from two-dimensional anyon models
• Symmetry-enriched topological order in tensor networks: Defects, gauging and anyon condensation
• Experimental Demonstration of High-Fidelity Logical Magic States from Code Switching
• Cross-cap defects and fault-tolerant logical gates in the surface code and the honeycomb Floquet code
• Exotic Symmetry Breaking Properties of Self-Dual Fracton Spin Models
• Code switching revisited: Low-overhead magic state preparation using color codes
• Synthesis of CNOT-Dihedral circuits with optimal number of two qubit gates
• Quantum error correction meets continuous symmetries: fundamental trade-offs and case studies
• Limitations on transversal gates for hypergraph product codes
• Designs from magic-augmented Clifford circuits
• A Hierarchy of Anyon Models Realised by Twists in Stacked Surface Codes
• Geometric structure and transversal logic of quantum Reed-Muller codes
• Error Correction in Dynamical Codes
• Classes of topological qubits from low-dimensional quantum spin systems
• Resource optimization for fault-tolerant quantum computing
• Fidelity-based distance bounds for $N$-qubit approximate quantum error correction
• Non-Clifford and parallelizable fault-tolerant logical gates on constant and almost-constant rate homological quantum LDPC codes via higher symmetries
• Efficient fault-tolerant implementations of non-Clifford gates with reconfigurable atom arrays
• Single-shot preparation of hypergraph product codes via dimension jump
• Single-shot quantum error correction with the three-dimensional subsystem toric code
• Non-Abelian Self-Correcting Quantum Memory and Transversal Non-Clifford Gate beyond the $n^{1/3}$ Distance Barrier
• Magic Boundaries of 3D Color Codes
• Finding the disjointness of stabilizer codes is NP-complete
• Preparing topologically ordered states by Hamiltonian interpolation
• Unfolded distillation: very low-cost magic state preparation for biased-noise qubits
• Spin chains, defects, and quantum wires for the quantum-double edge
• Efficient simulation of logical magic state preparation protocols
• Color code with a logical control-$S$ gate using transversal $T$ rotations
• Transversal architecture for megaquop-scale quantum simulation with neutral atoms
• Universal quantum computation via scalable measurement-free error correction
• Universal fault tolerant quantum computation in 2D without getting tied in knots
• Error Resilience of Fracton Codes and Near Saturation of Code-Capacity Threshold in Three Dimensions
• Equivariant Machine Learning Decoder for 3D Toric Codes