arXiv:2609.38996
Constant Rate Codes with Fully Addressable Transversal T: Good Codes, Sparse Checks
Alexander Meiburg
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.
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