Universal fault-tolerant quantum computation with Bacon-Shor codes

Abstract

We present a fault-tolerant universal gate set consisting of Hadamard and controlled-controlled-Z (CCZ) on Bacon-Shor subsystem codes. Transversal non-Clifford gates on these codes are intriguing in that higher levels of the Clifford hierarchy become accessible as the code becomes more asymmetric. For instance, in an appropriate gauge, Bacon-Shor codes on an $m\times m^k$ lattice have transversal $k$-qubit-controlled $Z$. Through a variety of tricks, including intermediate error-correction and non-Pauli recovery, we reduce the overhead required for fault-tolerant CCZ. We calculate pseudothresholds for our universal gate set on the smallest $3\times 3$ Bacon-Shor code and also compare our gates with magic-states within the framework of a proposed ion trap architecture.

5 pages + 10 page appendix

References in corpus (16)

• Quantum Teleportation is a Universal Computational Primitive
• Universal Quantum Computation with ideal Clifford gates and noisy ancillas
• Large Scale Modular Quantum Computer Architecture with Atomic Memory and Photonic Interconnects
• Operator Quantum Error Correcting Subsystems for Self-Correcting Quantum Memories
• Restrictions on Transversal Encoded Quantum Gate Sets
• Methodology for quantum logic gate constructions
• Active stabilisation, quantum computation and quantum state synthesis
• Low-distance Surface Codes under Realistic Quantum Noise
• Approximate quantum error correction can lead to better codes
• Subsystem fault tolerance with the Bacon-Shor code
• Fault-tolerant conversion between the Steane and Reed-Muller quantum codes
• Classification of topologically protected gates for local stabilizer codes
• A Simple Proof that Toffoli and Hadamard are Quantum Universal
• General conditions for approximate quantum error correction and near-optimal recovery channels
• Fault-tolerant logical gates in quantum error-correcting codes
• Fault-tolerant quantum computation with asymmetric Bacon-Shor codes

Cited by in corpus (13)

• Focus beyond quadratic speedups for error-corrected quantum advantage
• A fault-tolerant non-Clifford gate for the surface code in two dimensions
• Fault-Tolerant Quantum Gates with Defects in Topological Stabiliser Codes
• Changing the circuit-depth complexity of measurement-based quantum computation with hypergraph states
• Universal Fault-Tolerant Quantum Computing with Stabiliser Codes
• Magic State Distillation from Entangled States
• Fault-tolerant Compass Codes
• Large-$N$ Chern insulators: lattice field theory and quantum simulation approaches to correlation effects in the quantum anomalous Hall effect
• Dancing the Quantum Waltz: Compiling Three-Qubit Gates on Four Level Architectures
• Gottesman Types for Quantum Programs
• Braiding defects in topological stabiliser codes of any dimension cannot be universal
• Transversal switching between generic stabilizer codes
• Classical Coding Approaches to Quantum Applications