Fault-tolerant logical gates in quantum error-correcting codes

Abstract

Recently, Bravyi and König have shown that there is a tradeoff between fault-tolerantly implementable logical gates and geometric locality of stabilizer codes. They consider locality-preserving operations which are implemented by a constant depth geometrically local circuit and are thus fault-tolerant by construction. In particular, they shown that, for local stabilizer codes in D spatial dimensions, locality preserving gates are restricted to a set of unitary gates known as the D-th level of the Clifford hierarchy. In this paper, we elaborate this idea and provide several extensions and applications of their characterization in various directions. First, we present a new no-go theorem for self-correcting quantum memory. Namely, we prove that a three-dimensional stabilizer Hamiltonian with a locality-preserving implementation of a non-Clifford gate cannot have a macroscopic energy barrier. Second, we prove that the code distance of a D-dimensional local stabilizer code with non-trivial locality-preserving m-th level Clifford logical gate is upper bounded by $O(L^{D+1-m})$. For codes with non-Clifford gates (m>2), this improves the previous best bound by Bravyi and Terhal. Third we prove that a qubit loss threshold of codes with non-trivial transversal m-th level Clifford logical gate is upper bounded by 1/m. As such, no family of fault-tolerant codes with transversal gates in increasing level of the Clifford hierarchy may exist. This result applies to arbitrary stabilizer and subsystem codes, and is not restricted to geometrically-local codes. Fourth we extend the result of Bravyi and König to subsystem codes. A technical difficulty is that, unlike stabilizer codes, the so-called union lemma does not apply to subsystem codes. This problem is avoided by assuming the presence of error threshold in a subsystem code, and the same conclusion as Bravyi-König is recovered.

13 pages, 4 figures

References in corpus (35)

• Quantum Teleportation is a Universal Computational Primitive
• Topological quantum memory
• Universal Quantum Computation with ideal Clifford gates and noisy ancillas
• A Class of Quantum Error-Correcting Codes Saturating the Quantum Hamming Bound
• Reliable Quantum Computers
• A Theory of Fault-Tolerant Quantum Computation
• Local unitary transformation, long-range quantum entanglement, wave function renormalization, and topological order
• Local stabilizer codes in three dimensions without string logical operators
• Topological Quantum Distillation
• Operator Quantum Error Correcting Subsystems for Self-Correcting Quantum Memories
• Restrictions on Transversal Encoded Quantum Gate Sets
• Stabilizer Formalism for Operator Quantum Error Correction
• Analytic and numerical demonstration of quantum self-correction in the 3D Cubic Code
• Exotic topological order in fractal spin liquids
• A no-go theorem for a two-dimensional self-correcting quantum memory based on stabilizer codes
• Universal Quantum Computation with the nu=5/2 Fractional Quantum Hall State
• Universal fault-tolerant quantum computation with only transversal gates and error correction
• Topological order in an exactly solvable 3D spin model
• Topological Computation without Braiding
• Tradeoffs for reliable quantum information storage in 2D systems
• Topological Order at Non-zero Temperature
• Thresholds for topological codes in the presence of loss
• Classification of topologically protected gates for local stabilizer codes
• Exact Topological Quantum Order in D=3 and Beyond: Branyons and Brane-Net Condensates
• Fault-Tolerance of "Bad" Quantum Low-Density Parity Check Codes
• Quantum Measurements and Gates by Code Deformation
• Using concatenated quantum codes for universal fault-tolerant quantum gates
• Feasibility of self-correcting quantum memory and thermal stability of topological order
• Local topological order inhibits thermal stability in 2D
• Subsystem codes with spatially local generators
• Algebraic and information-theoretic conditions for operator quantum error-correction
• Logical operator tradeoff for local quantum codes
• Framework for classifying logical operators in stabilizer codes
• 3-d topological quantum memory with a power-law energy barrier
• Quantum codes give counterexamples to the unique pre-image conjecture of the N-representability problem

Cited by in corpus (84)

• Holographic quantum error-correcting codes: Toy models for the bulk/boundary correspondence
• Quantum Low-Density Parity-Check Codes
• Improved classical simulation of quantum circuits dominated by Clifford gates
• Quantum memories at finite temperature
• 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
• Universal transversal gates with color codes - a simplified approach
• Lower bounds on the non-Clifford resources for quantum computations
• Linear-Time Maximum Likelihood Decoding of Surface Codes over the Quantum Erasure Channel
• 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
• A fault-tolerant non-Clifford gate for the surface code in two dimensions
• Quantum Computing with Majorana Fermion Codes
• Combining Topological Hardware and Topological Software: Color Code Quantum Computing with Topological Superconductor Networks
• Gapped boundaries, group cohomology and fault-tolerant logical gates
• Anyon condensation and the color code
• The boundaries and twist defects of the color code and their applications to topological quantum computation
• 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
• Continuous groups of transversal gates for quantum error correcting codes from finite clock reference frames
• Overhead analysis of universal concatenated quantum codes
• The disjointness of stabilizer codes and limitations on fault-tolerant logical gates
• Pauli topological subsystem codes from Abelian anyon theories
• Stacked codes: universal fault-tolerant quantum computation in a two-dimensional layout
• Fault-Tolerant Quantum Gates with Defects in Topological Stabiliser Codes
• Qudit Colour Codes and Gauge Colour Codes in All Spatial Dimensions
• Locality-Preserving Logical Operators in Topological Stabiliser Codes
• Fault-tolerant interface between quantum memories and quantum processors
• New perspectives on covariant quantum error correction
• Symmetry-protected self-correcting quantum memories
• Control and Coherence Time Enhancement of the 0-$\pi$ Qubit
• Partitioning qubits in hypergraph product codes to implement logical gates
• Connectivity constrains 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
• Topological Order and Memory Time in Marginally Self-Correcting Quantum Memory
• 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
• Quantum computation with cat qubits
• Renormalization group decoder for a four-dimensional toric code
• A proposal for self-correcting stabilizer quantum memories in 3 dimensions (or slightly less)
• Magic State Distillation from Entangled States
• Universal fault-tolerant quantum computation with Bacon-Shor codes
• Can long-range interactions stabilize quantum memory at nonzero temperature?
• The connected wedge theorem and its consequences
• Decoding Holographic Codes with an Integer Optimisation Decoder
• Approximate symmetries and quantum error correction
• Fusing Binary Interface Defects in Topological Phases: The $\mathrm{Vec}(\mathbb{Z}/p\mathbb{Z})$ case
• Achieving fault tolerance on capped color codes with few ancillas
• Quasi-exact quantum computation
• Domain walls in topological phases and the Brauer-Picard ring for $\mathrm{Vec}(\mathbb{Z}/p\mathbb{Z})$
• Fault-tolerant gates via homological product 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
• Doubled Color Codes
• Lifting topological codes: Three-dimensional subsystem codes from two-dimensional anyon models
• Exponential Lifetime Improvement in Topological Quantum Memories
• Symmetry-enriched topological order in tensor networks: Defects, gauging and anyon condensation
• QRAM: A Survey and Critique
• Quantum error correction meets continuous symmetries: fundamental trade-offs and case studies
• Computing Defects Associated to Bounded Domain Wall Structures: The $\mathrm{Vec}(\mathbb{Z}/p\mathbb{Z})$ Case
• Geometric structure and transversal logic of quantum Reed-Muller codes
• Braiding defects in topological stabiliser codes of any dimension cannot be universal
• Error Correction in Dynamical Codes
• Efficient fault-tolerant implementations of non-Clifford gates with reconfigurable atom arrays
• Fidelity-based distance bounds for $N$-qubit approximate quantum error correction
• Gauging Defects in Quantum Spin Systems
• Fundamental thresholds for computational and erasure errors via the coherent information
• Limitations on Transversal Computation through Quantum Homomorphic Encryption
• Bounds on Autonomous Quantum Error Correction
• Single-shot quantum error correction with the three-dimensional subsystem toric code
• Finding the disjointness of stabilizer codes is NP-complete
• Color code with a logical control-$S$ gate using transversal $T$ rotations
• 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