Fault-tolerant conversion between the Steane and Reed-Muller quantum codes

Abstract

Steane's 7-qubit quantum error-correcting code admits a set of fault-tolerant gates that generate the Clifford group, which in itself is not universal for quantum computation. The 15-qubit Reed-Muller code also does not admit a universal fault-tolerant gate set but possesses fault-tolerant T and control-control-Z gates. Combined with the Clifford group, either of these two gates generate a universal set. Here, we combine these two features by demonstrating how to fault-tolerantly convert between these two codes, providing a new method to realize universal fault-tolerant quantum computation. One interpretation of our result is that both codes correspond to the same subsystem code in different gauges. Our scheme extends to the entire family of quantum Reed-Muller codes.

6 pages

References in corpus (20)

• Good Quantum Error-Correcting Codes Exist
• Quantum Teleportation is a Universal Computational Primitive
• Universal Quantum Computation with ideal Clifford gates and noisy ancillas
• Multiple Particle Interference and Quantum Error Correction
• Reliable Quantum Computers
• Fault-tolerant quantum computation with high threshold in two dimensions
• Restrictions on Transversal Encoded Quantum Gate Sets
• Magic state distillation with low overhead
• Stabilizer Formalism for Operator Quantum Error Correction
• Resilient Quantum Computation: Error Models and Thresholds
• A Unified and Generalized Approach to Quantum Error Correction
• Universal fault-tolerant quantum computation with only transversal gates and error correction
• Efficient fault-tolerant quantum computing
• Magic state distillation in all prime dimensions using quantum Reed-Muller codes
• Fault-tolerant quantum computation
• Quantum Measurements and Gates by Code Deformation
• Using concatenated quantum codes for universal fault-tolerant quantum gates
• Universal topological phase of 2D stabilizer codes
• Clifford Gates by Code Deformation
• Complex instruction set computing architecture for performing accurate quantum $Z$ rotations with less magic

Cited by in corpus (109)

• Building a fault-tolerant quantum computer using concatenated cat codes
• Quantum memories at finite temperature
• Enhanced fault-tolerant quantum computing in $d$-level systems
• Quantum computation with realistic magic state factories
• Circuit-Based Quantum Random Access Memory for Classical Data
• Focus beyond quadratic speedups for error-corrected quantum advantage
• Flag fault-tolerant error correction with arbitrary distance codes
• Universal transversal gates with color codes - a simplified approach
• On the robustness of bucket brigade quantum RAM
• Poking holes and cutting corners to achieve Clifford gates with the surface code
• Encoding a magic state with beyond break-even fidelity
• Foliated Quantum Codes
• Fault-tolerant error correction with the gauge color code
• A magic state's fidelity can be superior to the operations that created it
• Deep neural decoders for near term fault-tolerant experiments
• The cost of universality: A comparative study of the overhead of state distillation and code switching with color codes
• Fault-tolerant magic state preparation with flag qubits
• A fault-tolerant non-Clifford gate for the surface code in two dimensions
• Universal fault-tolerant gates on concatenated stabilizer codes
• Very low overhead fault-tolerant magic state preparation using redundant ancilla encoding and flag qubits
• Floquet codes without parent subsystem codes
• Magic State Distillation with Low Space Overhead and Optimal Asymptotic Input Count
• Code Deformation and Lattice Surgery Are Gauge Fixing
• Error Rates and Resource Overheads of Repetition Cat Qubits
• On Optimality of CSS Codes for Transversal $T$
• Fault-Tolerant Quantum Computing in the Pauli or Clifford Frame with Slow Error Diagnostics
• Overhead analysis of universal concatenated quantum codes
• Thresholds for universal concatenated quantum codes
• The disjointness of stabilizer codes and limitations on fault-tolerant logical gates
• Comparison of a quantum error correction threshold for exact and approximate errors
• Stacked codes: universal fault-tolerant quantum computation in a two-dimensional layout
• Universal fault-tolerant measurement-based quantum computation
• Pauli topological subsystem codes from Abelian anyon theories
• Qudit Colour Codes and Gauge Colour Codes in All Spatial Dimensions
• Reducing the overhead for quantum computation when noise is biased
• Fault-tolerant interface between quantum memories and quantum processors
• Quantum Lego: Building Quantum Error Correction Codes from Tensor Networks
• Fault-tolerant gates on hypergraph product codes
• Partitioning qubits in hypergraph product codes to implement logical gates
• An efficient magic state approach to small angle rotations
• Gauge color codes in two dimensions
• Morphing quantum codes
• Techniques for combining fast local decoders with global decoders under circuit-level noise
• Efficient color code decoders in $d\ge 2$ dimensions from toric code decoders
• Fault-Tolerant Code Switching Protocols for Near-Term Quantum Processors
• Universal Fault-Tolerant Quantum Computing with Stabiliser Codes
• A Spin-Optical Quantum Computing Architecture
• Universal limitations on implementing resourceful unitary evolutions
• Rewiring Stabilizer Codes
• Adaptive syndrome measurements for Shor-style error correction
• Magic State Distillation from Entangled States
• Universal fault-tolerant quantum computation with Bacon-Shor codes
• Resilience to time-correlated noise in quantum computation
• Approximate symmetries and quantum error correction
• A comparative study of universal quantum computing models: towards a physical unification
• Error rates and resource overheads of encoded three-qubit gates
• Achieving fault tolerance on capped color codes with few ancillas
• Fault-tolerant quantum metrology
• Fault-tolerant Preparation of Stabilizer States for Quantum CSS Codes by Classical Error-Correcting Codes
• Fault-tolerant gates via homological product codes
• Efficient Preparation of Large Block Code Ancilla States for Fault-tolerant Quantum Computation
• Non-Uniform Code Concatenation for Universal Fault-Tolerant Quantum Computing
• Interoperability in encoded quantum repeater networks
• Classical Coding Problem from Transversal $T$ Gates
• Quantum Pin Codes
• Doubled Color Codes
• Lifting topological codes: Three-dimensional subsystem codes from two-dimensional anyon models
• Decoding Merged Color-Surface Codes and Finding Fault-Tolerant Clifford Circuits Using Solvers for Satisfiability Modulo Theories
• Error suppression via complementary gauge choices in Reed-Muller codes
• Experimental Demonstration of High-Fidelity Logical Magic States from Code Switching
• Fault-tolerant conversion between adjacent Reed-Muller quantum codes based on gauge fixing
• An algebraic characterization of binary CSS-T codes and cyclic CSS-T codes for quantum fault tolerance
• Kerdock Codes Determine Unitary 2-Designs
• Weight Reduced Stabilizer Codes with Lower Overhead
• Symmetric Clifford twirling for cost-optimal quantum error mitigation in early FTQC regime
• Climbing the Diagonal Clifford Hierarchy
• Graphical CSS Code Transformation Using ZX Calculus
• Fault-tolerant compiling of classically hard IQP circuits on hypercubes
• Quantum error correction meets continuous symmetries: fundamental trade-offs and case studies
• Efficient fault-tolerant code switching via one-way transversal CNOT gates
• Code conversion with the quantum Golay code for a universal transversal gate set
• Resource engines
• Fault-tolerant conversion between stabilizer codes by Clifford operations
• Quantum Circuit Discovery for Fault-Tolerant Logical State Preparation with Reinforcement Learning
• Geometric structure and transversal logic of quantum Reed-Muller codes
• In-situ Adaptive Encoding for Asymmetric Quantum Error Correcting Codes
• Efficient fault-tolerant implementations of non-Clifford gates with reconfigurable atom arrays
• The domain wall color code
• Subsystem CSS codes, a tighter stabilizer-to-CSS mapping, and Goursat's Lemma
• Error Correction in Dynamical Codes
• Transversal Clifford and T-gate codes of short length and high distance
• Transversal switching between generic stabilizer codes
• Measurement-free quantum error correction optimized for biased noise
• Single-shot quantum error correction with the three-dimensional subsystem toric code
• Real-time decoding of stabilizer measurements in a bit-flip code
• Contextuality of Quantum Error-Correcting Codes
• Transversal CNOT gate with multi-cycle error correction
• Measurement-free code-switching for low overhead quantum computation using permutation invariant codes
• State-adaptive quantum error correction and fault-tolerant quantum computing
• Efficient simulation of logical magic state preparation protocols
• RESCQ: Realtime Scheduling for Continuous Angle Quantum Error Correction Architectures
• Flexible Fault Tolerant Gate Gadgets
• Universal quantum computation via scalable measurement-free error correction
• Fault Tolerant Quantum Simulation via Symplectic Transvections
• Scalable and fault-tolerant preparation of encoded k-uniform states
• Detailed Account of Complexity for Implementation of Some Gate-Based Quantum Algorithms
• Hoare meets Heisenberg: A Lightweight Logic for Quantum Programs
• Weakly Fault-Tolerant Computation in a Quantum Error-Detecting Code
• Stabilizer codes for Heisenberg-limited many-body Hamiltonian estimation