Twisted Fourier Analysis of Quantum Weight Enumerators
Abstract
A unified Fourier framework for quantum weight enumerators of prime-power-dimensional qudits is developed in this paper. We introduce the notions of Weyl power spectrum and Weyl-conjugation autocorrelation for the Weyl-operator quantities nderlying the Shor--Laflamme weight enumerators. Representing these quantities as formal vectors, we show that they form a symplectic Fourier transform pair, from which the quantum MacWilliams identity follows by applying the Hamming-weight functional. This framework extends to a family of twisted Fourier transforms, including the Rains shadow transform. We show that identical-copy Bell sampling corresponds to a twisted autocorrelation related to the shadow enumerator through Weyl translation and Hamming projection. We further prove that all twisted Fourier transforms are Weyl translations of either the ordinary MacWilliams transform or the Rains shadow transform. This two-class reduction implies that the twists yield no additional independent coefficientwise positivity constraints under compatible projections. Nevertheless, the framework leads to refined MacWilliams and shadow identities that retain more Fourier information than ordinary Hamming weight enumerators. We employ these refined identities in linear programming, together with simplex mapping and shadow-coset counting, to exclude surviving candidate weight distributions. These techniques yield tighter bounds for binary and qutrit quantum codes, including nonexistence results for specific code parameters.
Related
- Determination of weight enumerators of binary extremal self-dual codes of length 60
- The weight enumerators of irreducible cyclic codes of length 2ℓ
- Fourier Coefficients of Siegel-Eisenstein Series of Degree 2m and Weight m+1
- Generalized Hamming Weights and Subcode Support Weight Distributions of Twisted Reed-Solomon Codes
- A Two-regime Khintchine Inequality and an Improved Bound on the Degree-1 Fourier Weight for Linear Threshold Functions
BibTeX
@misc{lai2026twisted,
title = {{Twisted Fourier Analysis of Quantum Weight Enumerators}},
author = {Ching-Yi Lai},
howpublished = {arXiv},
year = {2026},
month = oct,
doi = {10.48550/arxiv.2610.37894},
eprint = {2610.37894},
archivePrefix = {arXiv},
url = {https://arxiv.org/abs/2610.37894},
}
RIS
TY - UNPB
TI - Twisted Fourier Analysis of Quantum Weight Enumerators
AU - Ching-Yi Lai
PY - 2026
DA - 2026/10/27
PB - arXiv
DO - 10.48550/arxiv.2610.37894
UR - https://arxiv.org/abs/2610.37894
AB - A unified Fourier framework for quantum weight enumerators of prime-power-dimensional qudits is developed in this paper. We introduce the notions of Weyl power spectrum and Weyl-conjugation autocorrelation for the Weyl-operator quantities nderlying the Shor--Laflamme weight enumerators. Representing these quantities as formal vectors, we show that they form a symplectic Fourier transform pair, from which the quantum MacWilliams identity follows by applying the Hamming-weight functional. This framework extends to a family of twisted Fourier transforms, including the Rains shadow transform. We show that identical-copy Bell sampling corresponds to a twisted autocorrelation related to the shadow enumerator through Weyl translation and Hamming projection. We further prove that all twisted Fourier transforms are Weyl translations of either the ordinary MacWilliams transform or the Rains shadow transform. This two-class reduction implies that the twists yield no additional independent coefficientwise positivity constraints under compatible projections. Nevertheless, the framework leads to refined MacWilliams and shadow identities that retain more Fourier information than ordinary Hamming weight enumerators. We employ these refined identities in linear programming, together with simplex mapping and shadow-coset counting, to exclude surviving candidate weight distributions. These techniques yield tighter bounds for binary and qutrit quantum codes, including nonexistence results for specific code parameters.
ER -