Substantially Improved Rate and Distance for Addressable Transversal Phase Gates
Abstract
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≥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)$ 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.
Related
- Parallelizable and addressable transversal non-Clifford gates on good quantum LDPC codes
- Improved Transversal Non-Clifford Gates from Cup Products
- Improved Rate-versus-Distance Upper Bounds for LDPC Codes
- Improved Berry-Esseen bounds for multivariate nonlinear statistics in convex distance
- Improved Forecasting for Multivariate Time Series using GNAR models with General Inverse Distance Weights
BibTeX
@misc{wu2026substantially,
title = {{Substantially Improved Rate and Distance for Addressable Transversal Phase Gates}},
author = {Bujiao Wu and Tongyin Lin and Bin Cheng},
howpublished = {arXiv},
year = {2026},
month = nov,
doi = {10.48550/arxiv.2611.04964},
eprint = {2611.04964},
archivePrefix = {arXiv},
url = {https://arxiv.org/abs/2611.04964},
note = {CC BY 4.0},
}
RIS
TY - UNPB
TI - Substantially Improved Rate and Distance for Addressable Transversal Phase Gates
AU - Bujiao Wu
AU - Tongyin Lin
AU - Bin Cheng
PY - 2026
DA - 2026/11/03
PB - arXiv
DO - 10.48550/arxiv.2611.04964
UR - https://arxiv.org/abs/2611.04964
AB - 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≥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)$ 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.
ER -