Towers of generalized divisible quantum codes
arXiv:1709.08658 · doi:10.1103/PhysRevA.97.042327
Abstract
A divisible binary classical code is one in which every code word has weight divisible by a fixed integer. If the divisor is for a positive integer , then one can construct a Calderbank-Shor-Steane (CSS) code, where -stabilizer space is the divisible classical code, that admits a transversal gate in the -th level of Clifford hierarchy. We consider a generalization of the divisibility by allowing a coefficient vector of odd integers with which every code word has zero dot product modulo the divisor. In this generalized sense, we construct a CSS code with divisor and code distance from any CSS code of code distance and divisor where the transversal is a nontrivial logical operator. The encoding rate of the new code is approximately times smaller than that of the old code. In particular, for large and , our construction yields a CSS code of parameters admitting a transversal gate at the -th level of Clifford hierarchy. For our construction we introduce a conversion from magic state distillation protocols based on Clifford measurements to those based on codes with transversal -gates. Our tower contains, as a subclass, generalized triply even CSS codes that have appeared in so-called gauge fixing or code switching methods.
arXiv comment26 pages, 1 figure, (v2) minor changes
References in corpus (24)
- Good Quantum Error-Correcting Codes Exist
- Quantum Teleportation is a Universal Computational Primitive
- Universal Quantum Computation with ideal Clifford gates and noisy ancillas
- Topological Quantum Distillation
- Restrictions on Transversal Encoded Quantum Gate Sets
- Magic state distillation with low overhead
- Universal fault-tolerant quantum computation with only transversal gates and error correction
- Enhanced fault-tolerant quantum computing in -level systems
- Magic state distillation in all prime dimensions using quantum Reed-Muller codes
- Improved magic states distillation for quantum universality
- Universal transversal gates with color codes - a simplified approach
- Multilevel distillation of magic states for quantum computing
- Qudit versions of the qubit "pi-over-eight" gate
- Threshold Accuracy for Quantum Computation
- Fault-Tolerant Postselected Quantum Computation: Schemes
- Universal fault-tolerant gates on concatenated stabilizer codes
- Magic State Distillation with Low Space Overhead and Optimal Asymptotic Input Count
- Distillation with sublogarithmic overhead
- Stacked codes: universal fault-tolerant quantum computation in a two-dimensional layout
- Reducing the quantum computing overhead with complex gate distillation
- Gauge color codes in two dimensions
- Complex instruction set computing architecture for performing accurate quantum rotations with less magic
- Magic State Distillation at Intermediate Size
- Small Codes for Magic State Distillation
Cited by in corpus (11)
- The cost of universality: A comparative study of the overhead of state distillation and code switching with color codes
- On Optimality of CSS Codes for Transversal
- Classification of Small Triorthogonal Codes
- Designing the Quantum Channels Induced by Diagonal Gates
- Mitigating Coherent Noise by Balancing Weight-2 -Stabilizers
- Climbing the Diagonal Clifford Hierarchy
- Permutation-Invariant Quantum Codes with Transversal Generalized Phase Gates
- Measurement sequences for magic state distillation
- Transversal Clifford and T-gate codes of short length and high distance
- From Magic State Distillation to Dynamical Systems
- Fault Tolerant Quantum Simulation via Symplectic Transvections