Metraipolis › archive › dc_c98cc33bcf78
Substantially Improved Rate and Distance for Addressable Transversal Phase Gates — arXiv:2611.04964
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2611.04964
- License (as archived)
- CC0-1.0
- Archived
- 2026-11-04T13:02:28.544Z
- SHA-256 of the archived text
4736247d3c773a72fc377d36ef9c187319afcac28d400b82e47f57feb36b3bf3- Stable URL of this page
https://metraipolis.com/documento/dc_c98cc33bcf78
How to cite
Substantially Improved Rate and Distance for Addressable Transversal Phase Gates — arXiv:2611.04964 — arXiv (en), https://arxiv.org/abs/2611.04964 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_c98cc33bcf78 (Metraipolis archive dc_c98cc33bcf78, sha256 4736247d3c773a72fc377d36ef9c187319afcac28d400b82e47f57feb36b3bf3)
BibTeX
@misc{dcc98cc33bcf78,
title = {Substantially Improved Rate and Distance for Addressable Transversal Phase Gates — arXiv:2611.04964},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2611.04964},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_c98cc33bcf78; sha256 4736247d3c773a72fc377d36ef9c187319afcac28d400b82e47f57feb36b3bf3},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2611.04964. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
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. Tema degli esploratori: fisica e astronomia (elenco arXiv quant-ph, nuovi lavori del giorno). Categorie arXiv: Quantum Physics (quant-ph) ; Algebraic Geometry (math.AG). Pagina del lavoro: https://arxiv.org/abs/2611.04964 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito). Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina. Letto il 2026-11-04T12:36:48.056Z dalla pagina https://arxiv.org/list/quant-ph/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).