Transversal Clifford and T-gate codes of short length and high distance
arXiv:2408.12752 · doi:10.1109/JSAIT.2025.3570832
Abstract
The non-local interactions in several quantum device architectures allow for the realization of more compact quantum encodings while retaining the same degree of protection against noise. Anticipating that short to medium-length codes will soon be realizable, it is important to construct stabilizer codes that, for a given code distance, admit fault-tolerant implementations of logical gates with the fewest number of physical qubits. To this aim, we construct three kinds of codes encoding a single logical qubit for distances up to . First, we construct the smallest known doubly even codes, all of which admit a transversal implementation of the Clifford group. Applying a doubling procedure [arXiv:1509.03239] to such codes yields the smallest known weak triply even codes for the same distances and number of encoded qubits. This second family of codes admit a transversal implementation of the logical -gate. Relaxing the triply even property, we obtain our third family of triorthogonal codes with an even lower overhead at the cost of requiring additional Clifford gates to achieve the same logical operation. To our knowledge, these are the smallest known triorthogonal codes for their respective distances. While not qLDPC, the stabilizer generator weights of the code families with transversal -gates scale roughly as the square root of their lengths.
arXiv comment3 tables, 3 figures. Updated version: Added table summarizing T-gate code families and properties. Added discussion on stabilizer weights. Updated title and improved overall presentation
References in corpus (27)
- Good Quantum Error-Correcting Codes Exist
- Universal Quantum Computation with ideal Clifford gates and noisy ancillas
- Multiple Particle Interference and Quantum Error Correction
- Logical quantum processor based on reconfigurable atom arrays
- Quantum Error Correction and Orthogonal Geometry
- Topological Quantum Distillation
- Roads towards fault-tolerant universal quantum computation
- Simple Quantum Error Correcting Codes
- Magic state distillation with low overhead
- Universal fault-tolerant quantum computation with only transversal gates and error correction
- Fault-tolerant conversion between the Steane and Reed-Muller quantum codes
- Exact Topological Quantum Order in D=3 and Beyond: Branyons and Brane-Net Condensates
- Improved magic states distillation for quantum universality
- A unified framework for magic state distillation and multi-qubit gate-synthesis with reduced resource cost
- Codes and Protocols for Distilling , controlled-, and Toffoli Gates
- Universal fault-tolerant gates on concatenated stabilizer codes
- On Optimality of CSS Codes for Transversal
- On triply even binary codes
- Topological color codes on Union Jack lattices: A stable implementation of the whole Clifford group
- Classification of Small Triorthogonal Codes
- Towers of generalized divisible quantum codes
- Fault-tolerant gates via homological product codes
- Designing the Quantum Channels Induced by Diagonal Gates
- A Construction of Quantum Stabilizer Codes Based on Syndrome Assignment by Classical Parity-Check Matrices
- Structure of CSS and CSS-T Quantum Codes
- An algebraic characterization of binary CSS-T codes and cyclic CSS-T codes for quantum fault tolerance
- Code conversion with the quantum Golay code for a universal transversal gate set