aiqbench analysis
This paper presents a breakthrough in fault-tolerant quantum computing by constructing the first asymptotically good family of binary triorthogonal codes, enabling efficient transversal implementation of higher-level Clifford hierarchy gates. By leveraging algebraic geometry codes over extension fields, the authors achieve constant-overhead distillation of T-states, which is critical for reducing resource costs in universal quantum computation. This work directly advances the theoretical limits of error-corrected logical operations without relying on incidental AI or general computing concepts.
Asymptotically good binary triorthogonal codes and higher-level transversal gates
arXiv:2609.08203v2 Announce Type: cross Abstract: For each level of the Clifford hierarchy from the third level onward, we construct explicit asymptotically good binary CSS codes for which a strongly transversal diagonal rotation, followed by a correction from the preceding level, implements the corresponding logical rotation. We achieve this using algebraic geometry codes over binary extension fields and performing an alphabet reduction that translates orthogonality conditions over the extension field to binary overlap conditions. In particular, we obtain the first asymptotically good family of binary triorthogonal codes. We also give a stronger construction with worse parameters for which the strongly transversal physical rotation implements the desired logical rotation, with no subsequent correction. Finally, adapting an error-correction-based distillation protocol, our binary $T$-gate families yield direct constant-overhead $T$-state block distillation from noisy $T$-state inputs under sufficiently weak input noise and ideal stabilizer operations.
Abstract:For each level of the Clifford hierarchy from the third level onward, we construct explicit asymptotically good binary CSS codes for which a strongly transversal diagonal rotation, followed by a correction from the preceding level, implements the corresponding logical rotation. We achieve this using algebraic geometry codes over binary extension fields and performing an alphabet reduction that translates orthogonality conditions over the extension field to binary overlap conditions. In particular, we obtain the first asymptotically good family of binary triorthogonal codes. We also give a stronger construction with worse parameters for which the strongly transversal physical rotation implements the desired logical rotation, with no subsequent correction. Finally, adapting an error-correction-based distillation protocol, our binary $T$-gate families yield direct constant-overhead $T$-state block distillation from noisy $T$-state inputs under sufficiently weak input noise and ideal stabilizer operations.
Information Theory (cs.IT); Quantum Physics (quant-ph)
arXiv:2609.08203 [cs.IT]
(or arXiv:2609.08203v2 [cs.IT] for this version)
https://doi.org/10.48550/arXiv.2609.08203 Focus to learn more arXiv-issued DOI via DataCite
arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.
Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.
Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.
Full text under the publisher's open licence · 230 words
Related coverage

AXRP Episode 50 - Eli Lifland on AI 2027
LessWrong · Aug 3, 2026

The Steane Code Explained
Quantum Zeitgeist · Sep 5, 2026

Why do models task game?
AI Alignment Forum · Aug 6, 2026
What's Continual Learning, and Why Might We Expect To See It In Advanced LLM Agents?
LessWrong · Jun 12, 2026