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.38996

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

Alexander Meiburg

quant-phSubmitted Sep 30, 2026• Announced Oct 1, 2026• 1 citation
arXivHTMLPDF

Abstract

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.

AI Summary

The paper asks how transversal non-Clifford gates can coexist with constant rate, growing distance, logical addressability, and sparse checks. Its strongest addressability requirement realizes arbitrary logical gate-power patterns using a single physical $I/U$ mask, while applying $U$ everywhere implements the collective logical gate. For every fixed dyadic phase $R_\ell=\operatorname{diag}(1,e^{2\pi i/2^\ell})$, it constructs explicit binary CSS codes with $k,d=\Omega(n)$, fully addressable transversal $R_\ell$, transversal logical Paulis, and polynomial-time ideal recovery. Reserved algebraic-geometric evaluation points label logical bits; interpolation produces overlap selectors, modular completion lifts these to exact phases, and constant repetition converts physical powers into masks. For $T$, certified bounds are $k/n\ge4/195118$ and $d/n\ge1/195118$ asymptotically. A clock-code construction extends goodness and addressability to every fixed finite-projective-order one-qubit gate, generally using nonadditive codes without guaranteed transversal Paulis. The paper acknowledges concurrent work overlapping the good CSS results. Two constructions address sparsity separately. A quaternion quotient of a three-dimensional color-code geometry gives Pauli-LDPC codes with $n=2M^3$, $k=2$, $d\ge\lceil\pi M/16\rceil$, and collective but not individually addressable transversal $T$. A $\mathbb Z_8$ hypergraph-product construction with 28-qubit clock embeddings gives sparse commuting non-Pauli projectors, protected rate at least $1/140$, distance $\Omega(\sqrt n)$, and addressed protected $T$ accompanied by known gauge Clifford gates. The good CSS codes have dense checks. Asymptotically good Pauli-LDPC codes with fully addressable transversal non-Clifford gates remain open; decoding and check-measurement costs for the sparse protected construction are not analyzed.

Almost certainly largely AI-generatedAI use disclosed
The initial draft of writing was done by the author but significantly rewritten and replaced by AI generated text through the editing process.

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

Comments
22 pages

Related papers

Asymptotically Good Quantum Codes with Addressable Transversal T Gates

Tongyin Lin, Bujiao Wu, Bin Cheng

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.

quant-pharXiv:2609.35129•Sep 29, 2026•1 citation

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

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

Asymptotically good CSS codes that realize the logical transversal Clifford group fault-tolerantly

K. Sai Mineesh Reddy, Navin Kashyap

This paper introduces a framework for constructing Calderbank-Shor-Steane (CSS) codes that support fault-tolerant logical transversal $Z$-rotations. Using this framework, we obtain asymptotically good CSS codes that fault-tolerantly realize the logical transversal Clifford group (i.e., transversal single-qubit Clifford gates are realized within a single code block, while transversal two-qubit Clifford gates are realized across two identical code blocks). Furthermore, investigating CSS-T codes, we: (a) demonstrate asymptotically good CSS-T codes wherein the transversal $T$ realizes the logical transversal $S^{\dagger}$; (b) show that the condition $C_2 \ast C_1 \subseteq C_1^{\perp}$ is necessary but not sufficient for CSS-T codes; and (c) revise the characterizations of CSS-T codes wherein the transversal $T$ implements the logical identity and the logical transversal $T$, respectively.

quant-pharXiv:2601.08568•IEEE International Symposium on Information Theory (ISIT)•Jan 14, 2026•5 citations

Quantum Logic Codes: Complete Transversal Logical Clifford Instruction Sets for High-Rate Stabilizer Quantum Error Correcting Codes

Adam Holmes

We study the structure and transversal logical capabilities of stabilizer quantum error correcting codes. Among our results, we identify universal lower bounds on circuit depth to generate a full logical Clifford algebra, and develop novel constructions of logical transversal gates including a new depth-one transversal phase $\mathrm{\overline{S}}$ gate in the rotated surface code and a depth-one intra-block $\mathrm{\overline{CZ}}$ gate in the 2D-toric code that generalizes to all odd distances and all lengths $L\ge3$, respectively. Finally, we construct a high-rate non-LDPC CSS code family with parameters $[[n,\sqrt{n},Θ({n^β})]]$ where $β\approx 0.2823$ in one demonstrated case, that provably possesses a constant-depth complete 2-local transversal logical Clifford basis instruction set architecture (ISA) composed of all individually targeted $\mathrm{\overline{S}}$, $\mathrm{\overline{SHS}} = \sqrt{X}$, and $\mathrm{\overline{CZ}}$ gates. This ISA is depth-one for certain subfamilies that we design and generally constant-depth under certain conditions. The code family is built from a small code with parameters $[[n_0, 2, d_0]]$, and is tunable in the standard way: it tiles out to form utility-scale logical qubit counts, and it scales up through concatenation to achieve higher distances and error suppression. We show that this construction preserves the depth-one complete transversal logical Clifford basis ISA when composed with these commuting construction actions, inheriting structure from the core codes so that at scale the complete logical Clifford basis ISA remains depth-one up to depth-two addressable operations between tiled cores. We call these Quantum Logic Codes.

quant-pharXiv:2606.13521•Jun 12, 2026•11 citations

Parallelizable and addressable transversal non-Clifford gates on good quantum LDPC codes

Yiming Li, Zimu Li, Zhengyi Han +1 more

We achieve linearly many parallelizable and addressable transversal logical multi-controlled-Z gates with asymptotically optimal parameters simultaneously on good quantum low-density parity check codes and quantum locally testable codes, by applying the gate framework of [arXiv:2604.01874] to good qLTC constructions. To establish the nontriviality of the logical operation, we express the cup product pairing as a coefficient in a product of Moore determinants and prove that this coefficient is nonzero. Moreover, we use the symmetries of the covering spaces to construct large spaces of cocycles. By multiplying the initial cocycles by suitable elements of these spaces, we obtain linearly many independent pairings, each selected by a corresponding cycle constructed using Poincaré duality. This yields linearly many parallelizable and addressable multi-controlled-Z gates and enables asymptotically constant-overhead magic state distillation with good qLDPC codes.

quant-pharXiv:2609.26691•Sep 23, 2026•8 citations
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.
The paper asks how transversal non-Clifford gates can coexist with constant rate, growing distance, logical addressability, and sparse checks. Its strongest addressability requirement realizes arbitrary logical gate-power patterns using a single physical I/UI/UI/U mask, while applying UUU everywhere implements the collective logical gate.
For every fixed dyadic phase Rℓ=diag⁡(1,e2πi/2ℓ)R_\ell=\operatorname{diag}(1,e^{2\pi i/2^\ell})Rℓ​=diag(1,e2πi/2ℓ), it constructs explicit binary CSS codes with k,d=Ω(n)k,d=\Omega(n)k,d=Ω(n), fully addressable transversal RℓR_\ellRℓ​, transversal logical Paulis, and polynomial-time ideal recovery. Reserved algebraic-geometric evaluation points label logical bits; interpolation produces overlap selectors, modular completion lifts these to exact phases, and constant repetition converts physical powers into masks. For TTT, certified bounds are k/n≥4/195118k/n\ge4/195118k/n≥4/195118 and d/n≥1/195118d/n\ge1/195118d/n≥1/195118 asymptotically. A clock-code construction extends goodness and addressability to every fixed finite-projective-order one-qubit gate, generally using nonadditive codes without guaranteed transversal Paulis. The paper acknowledges concurrent work overlapping the good CSS results.
Two constructions address sparsity separately. A quaternion quotient of a three-dimensional color-code geometry gives Pauli-LDPC codes with n=2M3n=2M^3n=2M3, k=2k=2k=2, d≥⌈πM/16⌉d\ge\lceil\pi M/16\rceild≥⌈πM/16⌉, and collective but not individually addressable transversal TTT. A Z8\mathbb Z_8Z8​ hypergraph-product construction with 28-qubit clock embeddings gives sparse commuting non-Pauli projectors, protected rate at least 1/1401/1401/140, distance Ω(n)\Omega(\sqrt n)Ω(n​), and addressed protected TTT accompanied by known gauge Clifford gates.
The good CSS codes have dense checks. Asymptotically good Pauli-LDPC codes with fully addressable transversal non-Clifford gates remain open; decoding and check-measurement costs for the sparse protected construction are not analyzed.
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.
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.
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.
This paper introduces a framework for constructing Calderbank-Shor-Steane (CSS) codes that support fault-tolerant logical transversal ZZZ-rotations. Using this framework, we obtain asymptotically good CSS codes that fault-tolerantly realize the logical transversal Clifford group (i.e., transversal single-qubit Clifford gates are realized within a single code block, while transversal two-qubit Clifford gates are realized across two identical code blocks). Furthermore, investigating CSS-T codes, we: (a) demonstrate asymptotically good CSS-T codes wherein the transversal TTT realizes the logical transversal S†S^{\dagger}S†; (b) show that the condition C2∗C1⊆C1⊥C_2 \ast C_1 \subseteq C_1^{\perp}C2​∗C1​⊆C1⊥​ is necessary but not sufficient for CSS-T codes; and (c) revise the characterizations of CSS-T codes wherein the transversal TTT implements the logical identity and the logical transversal TTT, respectively.
We study the structure and transversal logical capabilities of stabilizer quantum error correcting codes. Among our results, we identify universal lower bounds on circuit depth to generate a full logical Clifford algebra, and develop novel constructions of logical transversal gates including a new depth-one transversal phase S‾\mathrm{\overline{S}}S gate in the rotated surface code and a depth-one intra-block CZ‾\mathrm{\overline{CZ}}CZ gate in the 2D-toric code that generalizes to all odd distances and all lengths L≥3L\ge3L≥3, respectively. Finally, we construct a high-rate non-LDPC CSS code family with parameters [[n,n,Θ(nβ)]][[n,\sqrt{n},Θ({n^β})]][[n,n​,Θ(nβ)]] where β≈0.2823β\approx 0.2823β≈0.2823 in one demonstrated case, that provably possesses a constant-depth complete 2-local transversal logical Clifford basis instruction set architecture (ISA) composed of all individually targeted S‾\mathrm{\overline{S}}S, SHS‾=X\mathrm{\overline{SHS}} = \sqrt{X}SHS=X​, and CZ‾\mathrm{\overline{CZ}}CZ gates. This ISA is depth-one for certain subfamilies that we design and generally constant-depth under certain conditions. The code family is built from a small code with parameters [[n0,2,d0]][[n_0, 2, d_0]][[n0​,2,d0​]], and is tunable in the standard way: it tiles out to form utility-scale logical qubit counts, and it scales up through concatenation to achieve higher distances and error suppression. We show that this construction preserves the depth-one complete transversal logical Clifford basis ISA when composed with these commuting construction actions, inheriting structure from the core codes so that at scale the complete logical Clifford basis ISA remains depth-one up to depth-two addressable operations between tiled cores. We call these Quantum Logic Codes.
We achieve linearly many parallelizable and addressable transversal logical multi-controlled-Z gates with asymptotically optimal parameters simultaneously on good quantum low-density parity check codes and quantum locally testable codes, by applying the gate framework of [arXiv:2604.01874] to good qLTC constructions. To establish the nontriviality of the logical operation, we express the cup product pairing as a coefficient in a product of Moore determinants and prove that this coefficient is nonzero. Moreover, we use the symmetries of the covering spaces to construct large spaces of cocycles. By multiplying the initial cocycles by suitable elements of these spaces, we obtain linearly many independent pairings, each selected by a corresponding cycle constructed using Poincaré duality. This yields linearly many parallelizable and addressable multi-controlled-Z gates and enables asymptotically constant-overhead magic state distillation with good qLDPC codes.