Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:2609.35129

Asymptotically Good Quantum Codes with Addressable Transversal T Gates

Tongyin Lin, Bujiao Wu, Bin Cheng

quant-phSubmitted Sep 28, 2026• Announced Sep 29, 2026• 1 citation
arXivHTMLPDF

Abstract

Designing quantum codes with both transversal non-Clifford gates and good error-correcting parameters is an important goal in fault-tolerant quantum computation. Here, we construct an explicit family of binary CSS codes with constant rate and linear distance that admit fully addressable transversal $T$ gates. Specifically, any prescribed tensor product of logical powers of $T$ is implemented by a tensor product of physical powers of $T$, without any subsequent correction. Our construction combines algebraic-geometry codes with suitable binary embedding to obtain generalized divisibility of binary codes. This divisibility then enables fully addressable transversal $T$ gates. Furthermore, we formulate the minimum binary embedding length problem as a minimum-weight problem over an affine space and numerically improve the constants in the asymptotic rate and relative-distance bounds.

AI Summary

Can binary quantum codes have constant rate, linear distance, and independently selectable transversal logical $T$ gates? This paper constructs an explicit CSS-code family satisfying all three. For a fixed encoding $E$ and every $c\in\mathbb Z_8^K$, physical powers of $T$ implement $T^{b(c)}E=ET^c$, with $b(c)$ linear over $\mathbb Z_8$. No subsequent Clifford correction is required. The construction starts with algebraic-geometry codes over $\mathbb F_{1024}$ whose sixteenfold coordinate products sum to zero and whose primal and dual distances are linear. A binary embedding converts this identity into vanishing fivefold overlaps. A parity-lifting argument then produces weighted divisibility coefficients modulo eight that can be prescribed independently on selected information coordinates. Restricting, compressing, puncturing, and shortening these coordinates yields the logical addressability and quantum distance bounds. The embedding-length optimization is formulated as minimum Hamming weight in a binary affine space. Numerical search supplies a certified length-$244$ embedding with binary parameters $[244,10,100]$. The resulting family has $K/N\to1/241804$, $\liminf D_X/N\ge92500/241804$, and $\liminf D_Z/N\ge1/241804$, hence linear overall distance. The construction does not establish bounded-weight stabilizers or a complete low-overhead fault-tolerant architecture. Good quantum LDPC codes with this exact addressable-$T$ property remain an open question, as do space–time tradeoffs including noisy recovery and complementary logical gates. Concurrent independent work also obtains good binary codes with addressable rotations through hierarchy lowering; this construction instead prescribes divisibility coefficients directly.

Little sign of AI-generated textAI use disclosed
We used GPT 5.6 Sol and GPT 6 Astra to assist with brainstorming ideas, exploring proof strategies, writing proofs and preparing manuscript.

Written by gpt-6.1-sol from the paper's full text. Automated: it can be wrong.

Comments
27 pages, no figures. Comments are welcome

Related papers

Improved Quantum Codes with Transversal T Gates

Adam Wills

In this work, we study quantum CSS codes with transversal $T$ gates. Here, $T$ gate transversality is meant in the strongest sense; the application of physical $T$ to every physical qubit yields logical $T$ on every logical qubit, without Clifford corrections. Despite the importance of the $T$ gate in fault-tolerant quantum computation, the parameters of asymptotic families of such codes have not been improved since the work of Hastings and Haah in 2017, and Haah in 2018. In this work, we significantly broaden the achievable parameters of quantum code families with transversal $T$ gates, both expanding the regime of achievable polynomial rate and distance, and constructing such codes with constant rate and growing distance; this is the first time the latter has been achieved, even when allowing Clifford corrections after the transversal $T$ gate. These are also the first codes achieving $γ\to 0$ for a code with a transversal $T$ gate, where $γ$ is the overhead exponent of magic state distillation. To do this, we develop a framework of divisible decreasing monomial codes, punctured at a downward-closed set on the Boolean hypercube to create logical qubits. We prove a closed-form expression for the distance of such a code punctured at such a set, which may be of independent interest. We first instantiate this with an explicit construction based on weighted Reed-Muller codes, puncturing at low Hamming-weight points, and then with a randomised construction, where a small random set of points is protected from the puncturing to save quantum code distance, achieving improved parameters.

quant-pharXiv:2608.24000•Aug 26, 2026•8 citations

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

Alexander Meiburg

Recent work by Wills constructed codes with constant rate and transversal $T$. Extending this line of work, we construct asymptotically good CSS codes with \textbf{fully addressable} transversal $T$, permitting selective control over which logical qubits receive a $T$ gate. We also give Pauli-LDPC codes with transversal $T$ and growing distance at vanishing rate; and a protected-subsystem construction with fully addressable transversal $T$, constant protected rate, distance $Ω(\sqrt n)$, and sparse (non-Pauli) checks. More generally, we obtain asymptotically good binary codes with full transversal addressability for every fixed finite-order one-qubit gate, retaining CSS realizations for dyadic phase gates such as $\sqrt T$ and using generally nonadditive codes for rotations such as $R_z(π/7)$. The remaining challenge is to construct asymptotically good Pauli-LDPC codes with fully addressable transversal non-Clifford one-qubit gates.

quant-pharXiv:2609.38996•Oct 1, 2026•1 citation

Substantially Improved Rate and Distance for Addressable Transversal Phase Gates

Bujiao Wu, Tongyin Lin, Bin Cheng

An important ingredient in fault-tolerant quantum computation is asymptotically good codes with fully addressable transversal non-Clifford gates. Existing constructions, however, provide only small explicit guarantees for rate and relative distance. Here, we substantially improve these guarantees for fully addressable transversal phase gates at every fixed level $h\ge3$ of the Clifford hierarchy, using a cyclic encoding beyond the binary CSS framework. The encoding separates logical phase control from the joint design of rate and distance, enabling two constructions with different computational costs. A deterministic polynomial-time algebraic-geometric construction gives a common asymptotic lower bound of $52/(675h)$ on both quantities. A counting argument gives an exponential-time construction with exact verification, improving this bound by a factor of approximately $2.86$. We further establish a universal upper bound for codes supporting fully addressable transversal single-qubit phase gates. Within our cyclic encoding framework, we obtain a stronger upper bound that is approximately $1.28$ times the lower bound achieved by our exponential-time construction. As concrete examples, we construct codes with $48$ and $90$ physical qubits supporting fully addressable transversal $T$ gates. These results narrow the gap between achievable code parameters and addressability bounds, providing quantitative targets for further improvements in efficient code constructions.

arXiv:2611.04964•Nov 3, 2026•0 citations

Constant-rate quantum codes with low-weight stabilizers and full logical Clifford actions via transversal and fold-transversal gates

Takaya Matsuura, Yohji Chin, Shohei Kiryu +1 more

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.

quant-pharXiv:2609.37699•Sep 30, 2026•1 citation

Asymptotically Good Quantum Codes with Addressable and Transversal Non-Clifford Gates

Zhiyang He, Vinod Vaikuntanathan, Adam Wills +1 more

Constructing quantum codes with good parameters and useful transversal gates is a central problem in quantum error correction. In this paper, we continue our work in arXiv:2502.01864 and construct the first family of asymptotically good quantum codes (over qubits) supporting transversally addressable non-Clifford gates. More precisely, given any three logical qubits across one, two, or three codeblocks, the logical $\mathsf{CCZ}$ gate can be executed on those three logical qubits via a depth-one physical circuit of $\mathsf{CCZ}$ gates. This construction is based on the transitive, iso-orthogonal algebraic geometry codes constructed by Stichtenoth (IEEE Trans. Inf. Theory, 2006). This improves upon our construction from arXiv:2502.01864, which also supports transversally addressable $\mathsf{CCZ}$ gates and has inverse-polylogarithmic rate and relative distance.

arXiv:2507.05392•Jul 7, 2025•25 citations

Improved Transversal Non-Clifford Gates from Cup Products

Louis Golowich, Itzhak Tamo, Guanyu Zhu

It is a major challenge in quantum fault-tolerance to obtain low-overhead protocols for performing non-Clifford gates. In this vein, we construct quantum codes with low-weight stabilizers that support transversal (i.e. low-depth) implementations of the non-Clifford $C^{r-1}Z$ gate, for every constant $r\geq 3$. In particular, we obtain length-$n$ quantum LDPC codes (with constant-weight stabilizers) of polynomial distance $d\geq n^{(1-ε)/r}$ supporting transversal $C^{r-1}Z$ gates on a close-to-linear number $k\geq n^{1-ε}$ of disjoint tuples of logical qubits, for arbitrarily small $ε>0$. Our construction is the first with constant-weight stabilizers that obtains $dk\gg n$, and as a consequence achieves arbitrarily small magic state overhead exponent $γ=\log(n/k)/\log(d)>0$. Comparable prior constructions instead required at least polylogarithmic stabilizer weight. We also show how to obtain linearly many $k=Ω(n)$ logical $C^{r-1}Z$ gates, though with stabilizer weight and physical circuit depth $n^ε$. We show that our transversal gates also support addressing (i.e. targeting) of specific logical qubits. To obtain our codes, we develop a general transformation based on cup products that maps classical codes satisfying a multiplication property to quantum codes with transversal $C^{r-1}Z$. We apply this transformation to a new family of classical Tanner codes that we construct from punctured tensor products of algebraic codes.

quant-pharXiv:2609.27801•Aug 19, 2026•2 citations
Designing quantum codes with both transversal non-Clifford gates and good error-correcting parameters is an important goal in fault-tolerant quantum computation. Here, we construct an explicit family of binary CSS codes with constant rate and linear distance that admit fully addressable transversal TTT gates. Specifically, any prescribed tensor product of logical powers of TTT is implemented by a tensor product of physical powers of TTT, without any subsequent correction. Our construction combines algebraic-geometry codes with suitable binary embedding to obtain generalized divisibility of binary codes. This divisibility then enables fully addressable transversal TTT gates. Furthermore, we formulate the minimum binary embedding length problem as a minimum-weight problem over an affine space and numerically improve the constants in the asymptotic rate and relative-distance bounds.
Can binary quantum codes have constant rate, linear distance, and independently selectable transversal logical TTT gates? This paper constructs an explicit CSS-code family satisfying all three. For a fixed encoding EEE and every c∈Z8Kc\in\mathbb Z_8^Kc∈Z8K​, physical powers of TTT implement Tb(c)E=ETcT^{b(c)}E=ET^cTb(c)E=ETc, with b(c)b(c)b(c) linear over Z8\mathbb Z_8Z8​. No subsequent Clifford correction is required.
The construction starts with algebraic-geometry codes over F1024\mathbb F_{1024}F1024​ whose sixteenfold coordinate products sum to zero and whose primal and dual distances are linear. A binary embedding converts this identity into vanishing fivefold overlaps. A parity-lifting argument then produces weighted divisibility coefficients modulo eight that can be prescribed independently on selected information coordinates. Restricting, compressing, puncturing, and shortening these coordinates yields the logical addressability and quantum distance bounds.
The embedding-length optimization is formulated as minimum Hamming weight in a binary affine space. Numerical search supplies a certified length-244244244 embedding with binary parameters [244,10,100][244,10,100][244,10,100]. The resulting family has K/N→1/241804K/N\to1/241804K/N→1/241804, lim inf⁡DX/N≥92500/241804\liminf D_X/N\ge92500/241804liminfDX​/N≥92500/241804, and lim inf⁡DZ/N≥1/241804\liminf D_Z/N\ge1/241804liminfDZ​/N≥1/241804, hence linear overall distance.
The construction does not establish bounded-weight stabilizers or a complete low-overhead fault-tolerant architecture. Good quantum LDPC codes with this exact addressable-TTT property remain an open question, as do space–time tradeoffs including noisy recovery and complementary logical gates. Concurrent independent work also obtains good binary codes with addressable rotations through hierarchy lowering; this construction instead prescribes divisibility coefficients directly.
In this work, we study quantum CSS codes with transversal TTT gates. Here, TTT gate transversality is meant in the strongest sense; the application of physical TTT to every physical qubit yields logical TTT on every logical qubit, without Clifford corrections. Despite the importance of the TTT gate in fault-tolerant quantum computation, the parameters of asymptotic families of such codes have not been improved since the work of Hastings and Haah in 2017, and Haah in 2018. In this work, we significantly broaden the achievable parameters of quantum code families with transversal TTT gates, both expanding the regime of achievable polynomial rate and distance, and constructing such codes with constant rate and growing distance; this is the first time the latter has been achieved, even when allowing Clifford corrections after the transversal TTT gate. These are also the first codes achieving γ→0γ\to 0γ→0 for a code with a transversal TTT gate, where γγγ is the overhead exponent of magic state distillation. To do this, we develop a framework of divisible decreasing monomial codes, punctured at a downward-closed set on the Boolean hypercube to create logical qubits. We prove a closed-form expression for the distance of such a code punctured at such a set, which may be of independent interest. We first instantiate this with an explicit construction based on weighted Reed-Muller codes, puncturing at low Hamming-weight points, and then with a randomised construction, where a small random set of points is protected from the puncturing to save quantum code distance, achieving improved parameters.
Recent work by Wills constructed codes with constant rate and transversal TTT. Extending this line of work, we construct asymptotically good CSS codes with \textbf{fully addressable} transversal TTT, permitting selective control over which logical qubits receive a TTT gate. We also give Pauli-LDPC codes with transversal TTT and growing distance at vanishing rate; and a protected-subsystem construction with fully addressable transversal TTT, constant protected rate, distance Ω(n)Ω(\sqrt n)Ω(n​), and sparse (non-Pauli) checks. More generally, we obtain asymptotically good binary codes with full transversal addressability for every fixed finite-order one-qubit gate, retaining CSS realizations for dyadic phase gates such as T\sqrt TT​ and using generally nonadditive codes for rotations such as Rz(π/7)R_z(π/7)Rz​(π/7). The remaining challenge is to construct asymptotically good Pauli-LDPC codes with fully addressable transversal non-Clifford one-qubit gates.
An important ingredient in fault-tolerant quantum computation is asymptotically good codes with fully addressable transversal non-Clifford gates. Existing constructions, however, provide only small explicit guarantees for rate and relative distance. Here, we substantially improve these guarantees for fully addressable transversal phase gates at every fixed level h≥3h\ge3h≥3 of the Clifford hierarchy, using a cyclic encoding beyond the binary CSS framework. The encoding separates logical phase control from the joint design of rate and distance, enabling two constructions with different computational costs. A deterministic polynomial-time algebraic-geometric construction gives a common asymptotic lower bound of 52/(675h)52/(675h)52/(675h) on both quantities. A counting argument gives an exponential-time construction with exact verification, improving this bound by a factor of approximately 2.862.862.86. We further establish a universal upper bound for codes supporting fully addressable transversal single-qubit phase gates. Within our cyclic encoding framework, we obtain a stronger upper bound that is approximately 1.281.281.28 times the lower bound achieved by our exponential-time construction. As concrete examples, we construct codes with 484848 and 909090 physical qubits supporting fully addressable transversal TTT gates. These results narrow the gap between achievable code parameters and addressability bounds, providing quantitative targets for further improvements in efficient code constructions.
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.
Constructing quantum codes with good parameters and useful transversal gates is a central problem in quantum error correction. In this paper, we continue our work in arXiv:2502.01864 and construct the first family of asymptotically good quantum codes (over qubits) supporting transversally addressable non-Clifford gates. More precisely, given any three logical qubits across one, two, or three codeblocks, the logical CCZ\mathsf{CCZ}CCZ gate can be executed on those three logical qubits via a depth-one physical circuit of CCZ\mathsf{CCZ}CCZ gates. This construction is based on the transitive, iso-orthogonal algebraic geometry codes constructed by Stichtenoth (IEEE Trans. Inf. Theory, 2006). This improves upon our construction from arXiv:2502.01864, which also supports transversally addressable CCZ\mathsf{CCZ}CCZ gates and has inverse-polylogarithmic rate and relative distance.
It is a major challenge in quantum fault-tolerance to obtain low-overhead protocols for performing non-Clifford gates. In this vein, we construct quantum codes with low-weight stabilizers that support transversal (i.e. low-depth) implementations of the non-Clifford Cr−1ZC^{r-1}ZCr−1Z gate, for every constant r≥3r\geq 3r≥3. In particular, we obtain length-nnn quantum LDPC codes (with constant-weight stabilizers) of polynomial distance d≥n(1−ε)/rd\geq n^{(1-ε)/r}d≥n(1−ε)/r supporting transversal Cr−1ZC^{r-1}ZCr−1Z gates on a close-to-linear number k≥n1−εk\geq n^{1-ε}k≥n1−ε of disjoint tuples of logical qubits, for arbitrarily small ε>0ε>0ε>0. Our construction is the first with constant-weight stabilizers that obtains dk≫ndk\gg ndk≫n, and as a consequence achieves arbitrarily small magic state overhead exponent γ=log⁡(n/k)/log⁡(d)>0γ=\log(n/k)/\log(d)>0γ=log(n/k)/log(d)>0. Comparable prior constructions instead required at least polylogarithmic stabilizer weight. We also show how to obtain linearly many k=Ω(n)k=Ω(n)k=Ω(n) logical Cr−1ZC^{r-1}ZCr−1Z gates, though with stabilizer weight and physical circuit depth nεn^εnε. We show that our transversal gates also support addressing (i.e. targeting) of specific logical qubits. To obtain our codes, we develop a general transformation based on cup products that maps classical codes satisfying a multiplication property to quantum codes with transversal Cr−1ZC^{r-1}ZCr−1Z. We apply this transformation to a new family of classical Tanner codes that we construct from punctured tensor products of algebraic codes.