Using concatenated quantum codes for universal fault-tolerant quantum gates
arXiv:1309.3310 · doi:10.1103/PhysRevLett.112.010505
Abstract
We propose a method for universal fault-tolerant quantum computation using concatenated quantum error correcting codes. Namely, other than computational basis state preparation as required by the DiVincenzo criteria [1], our scheme requires no special ancillary state preparation to achieve universality, as opposed to schemes such as magic state distillation. The concatenation scheme exploits the transversal properties of two different codes, combining them to provide a means to protect against low-weight arbitrary errors. We give the required properties of the error correcting codes to ensure universal fault-tolerance and discuss a particular example using the 7-qubit Steane and 15-qubit Reed-Muller codes. We believe that optimizing the codes used in such a scheme could provide a useful alternative to state distillation schemes that exhibit high overhead costs.
5 pages, 3 figures
References in corpus (5)
Cited by in corpus (64)
- Roads towards fault-tolerant universal quantum computation
- Bosonic quantum error correction codes in superconducting quantum circuits
- Enhanced fault-tolerant quantum computing in -level systems
- Fault-tolerant conversion between the Steane and Reed-Muller quantum codes
- 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
- Universal transversal gates with color codes - a simplified approach
- On the robustness of bucket brigade quantum RAM
- Fault-tolerant logical gates in quantum error-correcting codes
- A unified framework for magic state distillation and multi-qubit gate-synthesis with reduced resource cost
- A magic state's fidelity can be superior to the operations that created it
- Continuous symmetries and approximate quantum error correction
- Universal quantum computing with twist-free and temporally encoded lattice surgery
- 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
- Universal fault-tolerant gates on concatenated stabilizer codes
- Very low overhead fault-tolerant magic state preparation using redundant ancilla encoding and flag qubits
- Magic State Distillation with Low Space Overhead and Optimal Asymptotic Input Count
- Error Rates and Resource Overheads of Repetition Cat Qubits
- Fault-Tolerant Quantum Computing in the Pauli or Clifford Frame with Slow Error Diagnostics
- On Optimality of CSS Codes for Transversal
- Continuous groups of transversal gates for quantum error correcting codes from finite clock reference frames
- 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
- Topological Order, Quantum Codes and Quantum Computation on Fractal Geometries
- Qudit Colour Codes and Gauge Colour Codes in All Spatial Dimensions
- Qutrit Magic State Distillation Tight in Some Directions
- A circuit-level protocol and analysis for twist-based lattice surgery
- Optimal Universal Quantum Error Correction via Bounded Reference Frames
- A Family of Quantum Codes with Exotic Transversal Gates
- Universal Fault-Tolerant Quantum Computing with Stabiliser Codes
- Universal limitations on implementing resourceful unitary evolutions
- Optimized measurement-free and fault-tolerant quantum error correction for neutral atoms
- Quasi-exact quantum computation
- Error rates and resource overheads of encoded three-qubit gates
- 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
- Theory of quasi-exact fault-tolerant quantum computing and valence-bond-solid codes
- Error suppression via complementary gauge choices in Reed-Muller codes
- Fault-tolerant conversion between adjacent Reed-Muller quantum codes based on gauge fixing
- Comparison of memory thresholds for planar qudit geometries
- Efficient diagnostics for quantum error correction
- Concatenating quantum error-correcting codes with decoherence-free subspaces and vice versa
- Resource engines
- Efficient fault-tolerant code switching via one-way transversal CNOT gates
- Code conversion with the quantum Golay code for a universal transversal gate set
- High-Threshold Low-Overhead Fault-Tolerant Classical Computation and the Replacement of Measurements with Unitary Quantum Gates
- Demonstration of two-dimensional connectivity for a scalable error-corrected ion-trap quantum processor architecture
- Resource optimization for fault-tolerant quantum computing
- Efficient fault-tolerant implementations of non-Clifford gates with reconfigurable atom arrays
- Error correctable efficient quantum homomorphic encryption using Calderbank-Shor-Steane codes
- Classical Coding Approaches to Quantum Applications
- Transversal CNOT gate with multi-cycle error correction
- Real-time decoding of stabilizer measurements in a bit-flip code
- Flexible Fault Tolerant Gate Gadgets
- Detailed Account of Complexity for Implementation of Some Gate-Based Quantum Algorithms
- Biased-Noise Thresholds of Zero-Rate Holographic Codes with Tensor-Network Decoding
- Universal quantum computation via scalable measurement-free error correction