Magic state distillation with low overhead
arXiv:1209.2426 · doi:10.1103/PhysRevA.86.052329
Abstract
We propose a new family of error detecting stabilizer codes with an encoding rate 1/3 that permit a transversal implementation of the pi/8-rotation on all logical qubits. The new codes are used to construct protocols for distilling high-quality `magic' states by Clifford group gates and Pauli measurements. The distillation overhead has a poly-logarithmic scaling as a function of the output accuracy, where the degree of the polynomial is . To construct the desired family of codes, we introduce the notion of a triorthogonal matrix --- a binary matrix in which any pair and any triple of rows have even overlap. Any triorthogonal matrix gives rise to a stabilizer code with a transversal -gate on all logical qubits, possibly augmented by Clifford gates. A powerful numerical method for generating triorthogonal matrices is proposed. Our techniques lead to a two-fold overhead reduction for distilling magic states with output accuracy compared with the best previously known protocol.
11 pages, 3 figures
References in corpus (4)
Cited by in corpus (15)
- Novel constructions for the fault-tolerant Toffoli gate
- Fault-tolerant conversion between the Steane and Reed-Muller quantum codes
- Efficient synthesis of universal Repeat-Until-Success circuits
- Multilevel distillation of magic states for quantum computing
- A magic state's fidelity can be superior to the operations that created it
- Efficient synthesis of probabilistic quantum circuits with fallback
- Fault-tolerant quantum computation with asymmetric Bacon-Shor codes
- Distilling one-qubit magic states into Toffoli states
- Reducing the quantum computing overhead with complex gate distillation
- A Non-Commuting Stabilizer Formalism
- Quantum circuit optimization by topological compaction in the surface code
- Magic State Distillation and Gate Compilation in Quantum Algorithms for Quantum Chemistry
- Hybrid magic state distillation for universal fault-tolerant quantum computation
- Resource optimization for fault-tolerant quantum computing
- Resource comparison of two surface code implementations of small angle Z rotations