Metraipolis › archive › dc_c84b1fe4f5ff
Quantifying Nonstabilizerness of Codeword-Stabilized Codes — arXiv:2608.22017
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2608.22017
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-18T09:33:05.616Z
- SHA-256 of the archived text
3326a2c337171f261244fd351863c543eacd96018f586a59a905db1ab11ad82f- Stable URL of this page
https://metraipolis.com/documento/dc_c84b1fe4f5ff
How to cite
Quantifying Nonstabilizerness of Codeword-Stabilized Codes — arXiv:2608.22017 — arXiv (en), https://arxiv.org/abs/2608.22017 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_c84b1fe4f5ff (Metraipolis archive dc_c84b1fe4f5ff, sha256 3326a2c337171f261244fd351863c543eacd96018f586a59a905db1ab11ad82f)
BibTeX
@misc{dcc84b1fe4f5ff,
title = {Quantifying Nonstabilizerness of Codeword-Stabilized Codes — arXiv:2608.22017},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2608.22017},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_c84b1fe4f5ff; sha256 3326a2c337171f261244fd351863c543eacd96018f586a59a905db1ab11ad82f},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2608.22017. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
Fault-tolerant quantum computation requires non-Clifford gates, which stabilizer codes cannot supply transversally. Non-stabilizer codes are the natural place to look for them, yet no quantitative theory of the nonstabilizerness (or magic) carried by such a code has existed. We develop one for codeword-stabilized (CWS) codes and show that the key quantity is classical: a code's nonstabilizerness is fixed by how its codewords collide under translation, a question that belongs to additive combinatorics. We show that the most magical codes are exactly the Sidon sets whenever a Sidon set of the required size exists, whose pairwise differences are all distinct. No code carries more than twice its number of logical qubits of nonstabilizerness however large it is physically. Furthermore, the same reduction gives structural and operational results. Nonstabilizerness is unchanged by coset closure, which yields non-stabilizer codes with arbitrarily many logical qubits and constant nonstabilizerness as the number of logical qubits grows. A diagonal transversal gate with $k$ logic qubits that is non-Clifford on $t$ coordinates forces the code's nonstabilizerness to be at most $2(k-t)$; thus the nonstabilizerness also bounds the non-Clifford gates needed to build the code and the cost of classically simulating it. Finally, entire families become exactly computable, and we obtain closed-form values for the Kerdock codes. Together these results turn the search for magic-rich codes and transversal non-Clifford gates into classical counting problems, which can be approached with standard tools from additive combinatorics. Tema degli esploratori: fisica e astronomia (retro-catalogo arXiv: annunci del 2026-08-25 in quant-ph). Categorie arXiv: Quantum Physics (quant-ph). Pagina del lavoro: https://arxiv.org/abs/2608.22017 — 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-10-18T09:27:54.370Z dalla pagina https://arxiv.org/catchup/quant-ph/2026-08-25?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).