Year: 2026
Type: preprint
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.
Source: arXiv (Cornell University)
Authors: Lin, Tongyin, Wu, Bujiao, Cheng, Bin
Language: English
Subfield: Artificial Intelligence
Field: Computer Science
Domain: Physical Sciences
Open Access status: green
Award: G1442683789
OpenAlex ID: W7214758498