Constant Rate Codes with Fully Addressable Transversal T: Good Codes, Sparse Checks

arXiv:2609.38996 · quant-ph · Submitted 2026-09-30 · Read on arXiv

quant-ph

Submitted: 2026-09-30

Updated: 2026-09-30

Terminology

• Addressability — 20× in this paper · explained in 1 episode
• CSS Codes — 11× in this paper · explained in 2 episodes
• Trace — 9× in this paper · explained in 2 episodes
• Distillation — 6× in this paper · explained in 2 episodes
• Sparsity — 5× in this paper · explained in 4 episodes
• Decode — 2× in this paper · explained in 2 episodes
• Holonomy — 2× in this paper · explained in 2 episodes
• Consistency — 1× in this paper · explained in 3 episodes
• Generative AI — 1× in this paper · explained in 2 episodes
• Hilbert Space — 1× in this paper · explained in 2 episodes
• Hypergraph — 1× in this paper · explained in 2 episodes
• Trace Distance — 1× in this paper · explained in 3 episodes

Sources

• Quantum Lego Power-up: Designing Transversal Gates with Tensor Networks
• Asymptotically Good Quantum Codes with Addressable and Transversal Non-Clifford Gates
• Realizing Logical Diagonal Gates via Transversal Physical Z-Rotations in CSS Codes
• A Family of Quantum Codes with Exotic Transversal Gates
• List-decoding of AG codes without genus penalty
• Constant-Overhead Magic State Distillation
• Unfolding the color code

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
• Theory of quantum-enhanced interferometry with general Markovian light sources
• A convergent hierarchy of spectral gap certificates for qubit Hamiltonians
• Universal Bound and Phase Transition in Many-Body Fermionic Non-Gaussianity