Constant-rate quantum codes with low-weight stabilizers and full logical Clifford actions via transversal and fold-transversal gates
quant-ph
Submitted: 2026-09-29
Updated: 2026-09-29
Comments: 27 pages including appendices, 2 figures
License: http://creativecommons.org/licenses/by/4.0/
The gist: Low-space-overhead fault-tolerant quantum computation requires not only high-rate quantum error-correcting codes but also space-efficient implementations of logical operations.
Terminology
Abstract
Low-space-overhead fault-tolerant quantum computation requires not only high-rate quantum error-correcting codes but also space-efficient implementations of logical operations. Transversal and fold-transversal gates are promising since they limit error propagation and require no additional qubits. However, the logical operations they enable are typically restricted, and a central challenge is to construct codes that combine a complete set of logical Clifford gates with favorable code parameters. In this work, we introduce a family of quantum codes with an asymptotically constant encoding rate and sublogarithmically growing stabilizer weight, while supporting the entire logical Clifford group using only transversal and fold-transversal gates. Our construction is based on classical codes whose code spaces are absolutely irreducible Steinberg modules of their Tanner-graph automorphism groups. Taking hypergraph products of these classical codes yields quantum codes for which all logical Clifford operations can be synthesized from a fixed set of transversal and fold-transversal gates. Moreover, the slow growth of the stabilizer weight enables a high error-correcting performance in small instances. These results provide a path toward fault-tolerant quantum computation with low space overhead using transversal and fold-transversal gates.
Sources
- Fault-Tolerant Quantum Computation with Constant Overhead
- Improved QLDPC Surgery: Logical Measurements and Bridging Codes
- Extractors: QLDPC Architectures for Efficient Pauli-Based Computation
- Automorphism gadgets in homological product codes
- Entangling logical qubits without physical operations
- Constraints on phantom codes from automorphism group bounds
- Logical Entangling with Phantom Codes in Hypergraph Products
- Construction of the full logical Clifford group for high-rate quantum Reed-Muller codes using only transversal and fold-transversal gates
- Quantum Logic Codes: Complete Transversal Logical Clifford Instruction Sets for High-Rate Stabilizer Quantum Error Correcting Codes
- Beyond transversality: structure of Clifford circuits for CSS codes
- Integer sequences and matrices over finite fields
- Quantum Error Correcting Subsystem Codes From Two Classical Linear Codes
- A Numerical Study of Bravyi-Bacon-Shor and Subsystem Hypergraph Product Codes
Related papers
- Reconquering Bell sampling on qudits: stabilizer learning and testing, quantum pseudorandomness bounds, and more
- Encrypted clones can leak: Classification of informative subsets in Quantum Encrypted Cloning
- Polynomial-time classical and quantum simulation of quantum impurity models
- A quasiparticle-protected superconducting qubit
- Theory of quantum-enhanced interferometry with general Markovian light sources
- A convergent hierarchy of spectral gap certificates for qubit Hamiltonians