Universal fault-tolerant gates on concatenated stabilizer codes
arXiv:1603.03948 · doi:10.1103/PhysRevX.6.031039
Abstract
It is an oft-cited fact that no quantum code can support a set of fault-tolerant logical gates that is both universal and transversal. This no-go theorem is generally responsible for the interest in alternative universality constructions including magic state distillation. Widely overlooked, however, is the possibility of non-transversal, yet still fault-tolerant, gates that work directly on small quantum codes. Here we demonstrate precisely the existence of such gates. In particular, we show how the limits of non-transversality can be overcome by performing rounds of intermediate error-correction to create logical gates on stabilizer codes that use no ancillas other than those required for syndrome measurement. Moreover, the logical gates we construct, the most prominent examples being Toffoli and controlled-controlled-Z, often complete universal gate sets on their codes. We detail such universal constructions for the smallest quantum codes, the 5-qubit and 7-qubit codes, and then proceed to generalize the approach. One remarkable result of this generalization is that any nondegenerate stabilizer code with a complete set of fault-tolerant single-qubit Clifford gates has a universal set of fault-tolerant gates. Another is the interaction of logical qubits across different stabilizer codes, which, for instance, implies a broadly applicable method of code switching.
18 pages + 5 pages appendix, 12 figures
References in corpus (8)
- Surface codes: Towards practical large-scale quantum computation
- Restrictions on Transversal Encoded Quantum Gate Sets
- Magic state distillation with low overhead
- Novel constructions for the fault-tolerant Toffoli gate
- Subsystem fault tolerance with the Bacon-Shor code
- Fault-tolerant conversion between the Steane and Reed-Muller quantum codes
- Effective fault-tolerant quantum computation with slow measurements
- On the logical operators of quantum codes
Cited by in corpus (54)
- Repetition Cat Qubits for Fault-Tolerant Quantum Computation
- Focus beyond quadratic speedups for error-corrected quantum advantage
- Quantum information processing with bosonic qubits in circuit QED
- 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
- Three-dimensional surface codes: Transversal gates and fault-tolerant architectures
- Resilience of quantum random access memory to generic noise
- 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
- Continuous groups of transversal gates for quantum error correcting codes from finite clock reference frames
- Overhead analysis of universal concatenated quantum codes
- Partitioning qubits in hypergraph product codes to implement logical gates
- Tailored XZZX codes for biased noise
- A circuit-level protocol and analysis for twist-based lattice surgery
- Optimal Universal Quantum Error Correction via Bounded Reference Frames
- Techniques for combining fast local decoders with global decoders under circuit-level noise
- Quantum computation from dynamic automorphism codes
- Universal Fault-Tolerant Quantum Computing with Stabiliser Codes
- Universal limitations on implementing resourceful unitary evolutions
- Rewiring Stabilizer Codes
- Magic State Distillation from Entangled States
- Optimized measurement-free and fault-tolerant quantum error correction for neutral atoms
- Instantaneous braids and Dehn twists in topologically ordered states
- Error rates and resource overheads of encoded three-qubit gates
- Fault-tolerant gates via homological product codes
- Towers of generalized divisible quantum codes
- Non-Uniform Code Concatenation for Universal Fault-Tolerant Quantum Computing
- Efficient Preparation of Large Block Code Ancilla States for Fault-tolerant Quantum Computation
- Error Suppression for Arbitrary-Size Black Box Quantum Operations
- Fault-tolerant logical gates in holographic stabilizer codes are severely restricted
- Direct Implementation of High-Fidelity Three-Qubit Gates for Superconducting Processor with Tunable Couplers
- The fastest generation of multipartite entanglement with natural interactions
- Lift-Connected Surface Codes
- Quantum Dynamic Programming
- Efficient fault-tolerant code switching via one-way transversal CNOT gates
- Exploring Many-body Interactions Through Quantum Fisher Information
- Characterization, synthesis, and optimization of quantum circuits over multiple-control -rotation gates: A systematic study
- Geometric structure and transversal logic of quantum Reed-Muller codes
- Robustness of the concatenated quantum error-correction protocol against noise for channels affected by fluctuation
- Transversal Clifford and T-gate codes of short length and high distance
- Improved performance of the Bacon-Shor code with Steane's syndrome extraction method
- Quantum sensing of even- versus odd-body interactions
- Fat-Tree QRAM: A High-Bandwidth Shared Quantum Random Access Memory for Parallel Queries
- Improving Performance of an Analog Electronic Device Using Quantum Error Correction
- Targeted Clifford logical gates for hypergraph product codes
- Weakly Fault-Tolerant Computation in a Quantum Error-Detecting Code
- Engineering long-range and multi-body interactions via global kinetic constraints
- Flexible Fault Tolerant Gate Gadgets
- Transversal architecture for megaquop-scale quantum simulation with neutral atoms
- Universal quantum computation via scalable measurement-free error correction