Codes and Protocols for Distilling $T$, controlled-$S$, and Toffoli Gates

Abstract

We present several different codes and protocols to distill $T$, controlled-$S$, and Toffoli (or $CCZ$) gates. One construction is based on codes that generalize the triorthogonal codes, allowing any of these gates to be induced at the logical level by transversal $T$. We present a randomized construction of generalized triorthogonal codes obtaining an asymptotic distillation efficiency $\gamma \to 1$. We also present a Reed-Muller based construction of these codes which obtains a worse $\gamma$ but performs well at small sizes. Additionally, we present protocols based on checking the stabilizers of $CCZ$ magic states at the logical level by transversal gates applied to codes; these protocols generalize the protocols of 1703.07847. Several examples, including a Reed-Muller code for $T$-to-Toffoli distillation, punctured Reed-Muller codes for $T$-gate distillation, and some of the check based protocols, require a lower ratio of input gates to output gates than other known protocols at the given order of error correction for the given code size. In particular, we find a $512$ T-gate to $10$ Toffoli gate code with distance $8$ as well as triorthogonal codes with parameters $[[887,137,5]],[[912,112,6]],[[937,87,7]]$ with very low prefactors in front of the leading order error terms in those codes.

28 pages. (v2) fixed a part of the proof on random triorthogonal codes, added comments on Clifford circuits for Reed-Muller states (v3) minor change

References in corpus (10)

• Surface codes: Towards practical large-scale quantum computation
• Magic state distillation with low overhead
• Novel constructions for the fault-tolerant Toffoli gate
• Multilevel distillation of magic states for quantum computing
• Fault-Tolerant Postselected Quantum Computation: Schemes
• Fault-Tolerant Postselected Quantum Computation: Threshold Analysis
• Distilling one-qubit magic states into Toffoli states
• Reducing the quantum computing overhead with complex gate distillation
• A quantum primality test with order finding
• Quantum Error Correction for Complex and Majorana Fermion Qubits

Cited by in corpus (52)

• How to factor 2048 bit RSA integers in 8 hours using 20 million noisy qubits
• A Game of Surface Codes: Large-Scale Quantum Computing with Lattice Surgery
• Blueprint for a Scalable Photonic Fault-Tolerant Quantum Computer
• Building a fault-tolerant quantum computer using concatenated cat codes
• Virtual Distillation for Quantum Error Mitigation
• Magic State Distillation: Not as Costly as You Think
• A perspective on the current state-of-the-art of quantum computing for drug discovery applications
• Fault-tolerant resource estimate for quantum chemical simulations: Case study on Li-ion battery electrolyte molecules
• No-Go Theorems for Quantum Resource Purification
• Universal quantum computing with twist-free and temporally encoded lattice surgery
• 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
• Very low overhead fault-tolerant magic state preparation using redundant ancilla encoding and flag qubits
• Towards low overhead magic state distillation
• Error Rates and Resource Overheads of Repetition Cat Qubits
• On Optimality of CSS Codes for Transversal $T$
• Morphing quantum codes
• Looped Pipelines Enabling Effective 3D Qubit Lattices in a Strictly 2D Device
• High-Fidelity Magic-State Preparation with a Biased-Noise Architecture
• Universal limitations on implementing resourceful unitary evolutions
• Logical Clifford Synthesis for Stabilizer Codes
• Fault-tolerant Post-Selection for Low Overhead Magic State Preparation
• Classification of Small Triorthogonal Codes
• Designing the Quantum Channels Induced by Diagonal Gates
• Classical Coding Problem from Transversal $T$ Gates
• Quantum Pin Codes
• Mitigating Coherent Noise by Balancing Weight-2 $Z$-Stabilizers
• Implementing fault-tolerant non-Clifford gates using the [[8,3,2]] color code
• Compilation of a simple chemistry application to quantum error correction primitives
• Code switching revisited: Low-overhead magic state preparation using color codes
• Fault-tolerant quantum speedup from constant depth quantum circuits
• Quantum error correction meets continuous symmetries: fundamental trade-offs and case studies
• Climbing the Diagonal Clifford Hierarchy
• Permutation-Invariant Quantum Codes with Transversal Generalized Phase Gates
• Magic state distillation with punctured polar codes
• Geometric structure and transversal logic of quantum Reed-Muller codes
• A Universal Circuit Set Using the $S_3$ Quantum Double
• LSQCA: Resource-Efficient Load/Store Architecture for Limited-Scale Fault-Tolerant Quantum Computing
• Measurement sequences for magic state distillation
• Transversal Clifford and T-gate codes of short length and high distance
• Generators and Relations for 3-Qubit Clifford+CS Operators
• Non-stabilizerness and entanglement from cat-state injection
• Quantum Lego and XP Stabilizer Codes
• Low Overhead Qutrit Magic State Distillation
• Unfolded distillation: very low-cost magic state preparation for biased-noise qubits
• Logical Noise Bias in Magic State Injection
• Efficient simulation of logical magic state preparation protocols
• Quantum phase estimation with optimal confidence interval using three control qubits
• Color code with a logical control-$S$ gate using transversal $T$ rotations
• Hypergraph States in SU(N)1, N odd prime, Chern-Simons Theory
• Flexible Fault Tolerant Gate Gadgets
• iSwitch: QEC on Demand via In-Situ Encoding of Bare Qubits for Ion Trap Architectures