Quantifying Nonstabilizerness of Codeword-Stabilized Codes
Abstract
Universal quantum computation requires non-Clifford gates, which stabilizer codes can provide transversally only up to a finite level of the Clifford hierarchy. Non-stabilizer codes are not subject to this bound and are the natural candidates to fill the gap. However, it is difficult to efficiently evaluate the nonstabilizerness (or magic) of non-stabilizer codes. Here, we resolve this problem for codeword-stabilized (CWS) codes by showing that the nonstabilizerness of a CWS code is determined by the difference structure of its codewords. Whenever a Sidon set of the required size exists, the most magical codes are related to the Sidon sets, whose pairwise differences are all distinct. Structural analysis demonstrates that nonstabilizerness is invariant under coset closure, giving rise to non-stabilizer codes with arbitrarily many logical qubits and constant nonstabilizerness. Nonstabilizerness of whole code families becomes exactly computable, and we obtain closed-form values for the Kerdock codes. Moreover, we reveal a tradeoff between nonstabilizerness and transversal gates. For a code with k logical qubits, a diagonal transversal gate that is non-Clifford on t coordinates forces the nonstabilizerness benchmark to be at most 2(k−t). These results reduce the search for codes with high nonstabilizerness and for transversal non-Clifford gates to classical counting problems, to which the standard tools of additive combinatorics apply.
Related
- Affine-Profile Stabilizer Thresholds for Magic in Codeword-Stabilized Quantum Codes
- Quantifying Nonstabilizerness of Quantum Codes by Removing the Inert Background
- Quantifying the Dual-isotope Advantage for Ytterbium-array Surface Codes using Realistic Noise Models
- Entanglement, anti-flatness, and nonlocal nonstabilizerness: a unified perspective from entanglement spectrum
- Nonstabilizerness of the entangling layer in quantum circuit Born machines
BibTeX
@misc{liu2026quantifying,
title = {{Quantifying Nonstabilizerness of Codeword-Stabilized Codes}},
author = {Yuan Liu and Ke-Mi Xu},
howpublished = {arXiv},
year = {2026},
month = oct,
doi = {10.48550/arxiv.2608.22017},
eprint = {2608.22017},
archivePrefix = {arXiv},
url = {https://arxiv.org/abs/2608.22017},
}
RIS
TY - UNPB
TI - Quantifying Nonstabilizerness of Codeword-Stabilized Codes
AU - Yuan Liu
AU - Ke-Mi Xu
PY - 2026
DA - 2026/10/19
PB - arXiv
DO - 10.48550/arxiv.2608.22017
UR - https://arxiv.org/abs/2608.22017
AB - Universal quantum computation requires non-Clifford gates, which stabilizer codes can provide transversally only up to a finite level of the Clifford hierarchy. Non-stabilizer codes are not subject to this bound and are the natural candidates to fill the gap. However, it is difficult to efficiently evaluate the nonstabilizerness (or magic) of non-stabilizer codes. Here, we resolve this problem for codeword-stabilized (CWS) codes by showing that the nonstabilizerness of a CWS code is determined by the difference structure of its codewords. Whenever a Sidon set of the required size exists, the most magical codes are related to the Sidon sets, whose pairwise differences are all distinct. Structural analysis demonstrates that nonstabilizerness is invariant under coset closure, giving rise to non-stabilizer codes with arbitrarily many logical qubits and constant nonstabilizerness. Nonstabilizerness of whole code families becomes exactly computable, and we obtain closed-form values for the Kerdock codes. Moreover, we reveal a tradeoff between nonstabilizerness and transversal gates. For a code with k logical qubits, a diagonal transversal gate that is non-Clifford on t coordinates forces the nonstabilizerness benchmark to be at most 2(k−t). These results reduce the search for codes with high nonstabilizerness and for transversal non-Clifford gates to classical counting problems, to which the standard tools of additive combinatorics apply.
ER -