Universal fault-tolerant quantum computation with only transversal gates and error correction

Abstract

Transversal implementations of encoded unitary gates are highly desirable for fault-tolerant quantum computation. Though transversal gates alone cannot be computationally universal, they can be combined with specially distilled resource states in order to achieve universality. We show that "triorthogonal" stabilizer codes, introduced for state distillation by Bravyi and Haah [Phys. Rev. A 86 052329 (2012)], admit transversal implementation of the controlled-controlled-Z gate. We then construct a universal set of fault-tolerant gates without state distillation by using only transversal controlled-controlled-Z, transversal Hadamard, and fault-tolerant error correction. We also adapt the distillation procedure of Bravyi and Haah to Toffoli gates, improving on existing Toffoli distillation schemes.

5 pages, 5 figures, v2: corrected calculations and added plot of distillation resources

References in corpus (13)

• Universal Quantum Computation with ideal Clifford gates and noisy ancillas
• Quantum Computing with Very Noisy Devices
• Fault-tolerant quantum computation with high threshold in two dimensions
• Restrictions on Transversal Encoded Quantum Gate Sets
• Magic state distillation with low overhead
• Quantum computing with nearest neighbor interactions and error rates over 1%
• Active stabilisation, quantum computation and quantum state synthesis
• Novel constructions for the fault-tolerant Toffoli gate
• Multilevel distillation of magic states for quantum computing
• Surface code implementation of block code state distillation
• Distilling one-qubit magic states into Toffoli states
• Subsystem stabilizer codes cannot have a universal set of transversal gates for even one encoded qudit
• Composite Toffoli gate with two-round error detection

Cited by in corpus (160)

• Quantum Error Correction for Quantum Memories
• Majorana Zero Modes and Topological Quantum Computation
• Elucidating Reaction Mechanisms on Quantum Computers
• Roads towards fault-tolerant universal quantum computation
• Demonstration of fault-tolerant universal quantum gate operations
• Building a fault-tolerant quantum computer using concatenated cat codes
• Quantum memories at finite temperature
• Quantum attacks on Bitcoin, and how to protect against them
• Enhanced fault-tolerant quantum computing in $d$-level systems
• All-Gaussian universality and fault tolerance with the Gottesman-Kitaev-Preskill code
• Fault-tolerant conversion between the Steane and Reed-Muller quantum codes
• Quantum computation with realistic magic state factories
• Single-shot fault-tolerant quantum error correction
• Circuit-Based Quantum Random Access Memory for Classical Data
• Unfolding the color code
• Focus beyond quadratic speedups for error-corrected quantum advantage
• Universal transversal gates with color codes - a simplified approach
• Fault-tolerant quantum computation with few qubits
• 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 logical gates in quantum error-correcting codes
• Fault-tolerant error correction with the gauge color code
• High-fidelity three-qubit iToffoli gate for fixed-frequency superconducting qubits
• Using concatenated quantum codes for universal fault-tolerant quantum gates
• 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
• 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
• Error mitigation for universal gates on encoded qubits
• Fault-tolerant magic state preparation with flag qubits
• Codes and Protocols for Distilling $T$, controlled-$S$, and Toffoli Gates
• Three-dimensional surface codes: Transversal gates and fault-tolerant architectures
• Single-step implementation of high fidelity $n$-bit Toffoli gate
• 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
• Low-cost Fredkin gate with auxiliary space
• Modular Bosonic Subsystem Codes
• Logical blocks for fault-tolerant topological quantum computation
• Anticoncentration theorems for schemes showing a quantum speedup
• Error Rates and Resource Overheads of Repetition Cat Qubits
• Code Deformation and Lattice Surgery Are Gauge Fixing
• $N$-body interactions between trapped ion qubits via spin-dependent squeezing
• Demonstration of three- and four-body interactions between trapped-ion spins
• Unifying gate-synthesis and magic state distillation
• 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
• Braiding Majorana zero modes using quantum dots
• Overhead analysis of universal concatenated quantum codes
• Thresholds for universal concatenated quantum codes
• 2-D Compass Codes
• The disjointness of stabilizer codes and limitations on fault-tolerant logical gates
• T-count optimization and Reed-Muller codes
• Topological Order, Quantum Codes and Quantum Computation on Fractal Geometries
• Pauli topological subsystem codes from Abelian anyon theories
• Stacked codes: universal fault-tolerant quantum computation in a two-dimensional layout
• Universal fault-tolerant measurement-based quantum computation
• Subsystem codes with high thresholds by gauge fixing and reduced qubit overhead
• Qudit Colour Codes and Gauge Colour Codes in All Spatial Dimensions
• Fault-tolerant interface between quantum memories and quantum processors
• Quantum Lego: Building Quantum Error Correction Codes from Tensor Networks
• Changing the circuit-depth complexity of measurement-based quantum computation with hypergraph states
• Qutrit Magic State Distillation Tight in Some Directions
• An efficient magic state approach to small angle rotations
• T-count and T-depth of any multi-qubit unitary
• Universal logical gates with constant overhead: instantaneous Dehn twists for hyperbolic quantum codes
• Gauge color codes in two dimensions
• Handling Leakage with Subsystem Codes
• Morphing quantum codes
• Type-II fractons from coupled spin chains and layers
• Universal quantum multi-qubit entangling gates with auxiliary spaces
• Optimal Universal Quantum Error Correction via Bounded Reference Frames
• A polynomial time and space heuristic algorithm for T-count
• 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
• Universal Fault-Tolerant Quantum Computing with Stabiliser Codes
• New techniques for fault-tolerant decomposition of Multi-Controlled Toffoli gate
• Universal limitations on implementing resourceful unitary evolutions
• Rewiring Stabilizer Codes
• Adaptive surface code for quantum error correction in the presence of temporary or permanent defects
• Simple implementation of high fidelity controlled-$i$SWAP gates and quantum circuit exponentiation of non-Hermitian gates
• Effective Compression of Quantum Braided Circuits Aided by ZX-Calculus
• Using quantum routers to implement quantum message authentication and Bell-state manipulation
• Magic State Distillation from Entangled States
• Adaptive syndrome measurements for Shor-style error correction
• Synthesizing efficient circuits for Hamiltonian simulation
• Optimized measurement-free and fault-tolerant quantum error correction for neutral atoms
• A (quasi-)polynomial time heuristic algorithm for synthesizing T-depth optimal circuits
• Resilience to time-correlated noise in quantum computation
• Achieving fault tolerance on capped color codes with few ancillas
• Classification of Small Triorthogonal Codes
• A comparative study of universal quantum computing models: towards a physical unification
• Quasi-exact quantum computation
• Instantaneous braids and Dehn twists in topologically ordered states
• Error rates and resource overheads of encoded three-qubit gates
• State-injection schemes of quantum computation in Spekkens' toy theory
• Fault-tolerant gates via homological product codes
• A prototype of quantum von Neumann architecture
• Towers of generalized divisible quantum codes
• Fault-tolerant Preparation of Stabilizer States for Quantum CSS Codes by Classical Error-Correcting Codes
• Efficient Preparation of Large Block Code Ancilla States for Fault-tolerant Quantum Computation
• A high-fidelity method for a single-step $N$-bit Toffoli gate in trapped ions
• Logic Synthesis for Fault-Tolerant Quantum Computers
• Non-Uniform Code Concatenation for Universal Fault-Tolerant Quantum Computing
• Engineering topological states and quantum-inspired information processing using classical circuits
• Interoperability in encoded quantum repeater networks
• Doubled Color Codes
• Universal Logical Gates on Topologically Encoded Qubits via Constant-Depth Unitary Circuits
• A Toffoli Gate Decomposition via Echoed Cross-Resonance Gates
• Theory of quasi-exact fault-tolerant quantum computing and valence-bond-solid codes
• Decoding Merged Color-Surface Codes and Finding Fault-Tolerant Clifford Circuits Using Solvers for Satisfiability Modulo Theories
• Lifting topological codes: Three-dimensional subsystem codes from two-dimensional anyon models
• Direct Implementation of High-Fidelity Three-Qubit Gates for Superconducting Processor with Tunable Couplers
• Gottesman Types for Quantum Programs
• Fault-tolerant conversion between adjacent Reed-Muller quantum codes based on gauge fixing
• Comparison of memory thresholds for planar qudit geometries
• Fault-tolerant compiling of classically hard IQP circuits on hypercubes
• Quantum resource theory of coding for error correction
• Code conversion with the quantum Golay code for a universal transversal gate set
• Exploring Many-body Interactions Through Quantum Fisher Information
• Group twirling and noise tailoring for multi-qubit controlled phase gates
• Quantum computation by teleportation and symmetry
• Efficient fault-tolerant code switching via one-way transversal CNOT gates
• The role of quantum measurements in physical processes and protocols
• Geometric structure and transversal logic of quantum Reed-Muller codes
• High-Threshold Low-Overhead Fault-Tolerant Classical Computation and the Replacement of Measurements with Unitary Quantum Gates
• Resource optimization for fault-tolerant quantum computing
• Encoding Classical Information in Gauge Subsystems of Quantum Codes
• Efficient fault-tolerant implementations of non-Clifford gates with reconfigurable atom arrays
• Programming higher-order interactions of Rydberg atoms
• Transversal Clifford and T-gate codes of short length and high distance
• Classification of Schmidt-rank-two multipartite unitary gates by singular number
• Transversal switching between generic stabilizer codes
• Quantum sensing of even- versus odd-body interactions
• Optimally generating $\mathfrak{su}(2^N)$ using Pauli strings
• Limitations on Transversal Computation through Quantum Homomorphic Encryption
• Far from Perfect: Quantum Error Correction with (Hyperinvariant) Evenbly Codes
• Distance-four quantum codes with combined postselection and error correction
• High-Rate Amplitude-Damping Shor Codes with Immunity to Collective Coherent Errors
• The resource cost of large scale quantum computing
• Real-time decoding of stabilizer measurements in a bit-flip code
• Scalability and high-efficiency of an $(n+1)$-qubit Toffoli gate sphere via blockaded Rydberg atoms
• Single-shot quantum error correction with the three-dimensional subsystem toric code
• Low-density parity-check representation of fault-tolerant quantum circuits
• Implementing a Ternary Decomposition of the Toffoli Gate on Fixed-FrequencyTransmon Qutrits
• Microwave-activated high-fidelity three-qubit gate scheme for fixed-frequency superconducting qubits
• Noise-Canceling Quantum Feedback: non-Hermitian Dynamics with Applications to State Preparation and Magic State Distillation
• State-adaptive quantum error correction and fault-tolerant quantum computing
• Halving the cost of quantum multiplexed rotations
• Hypergraph States in SU(N)1, N odd prime, Chern-Simons Theory
• Universal quantum computation via scalable measurement-free error correction
• Detailed Account of Complexity for Implementation of Some Gate-Based Quantum Algorithms
• 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