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.
AI Summary
The paper asks how Fourier-resolved quantum weight enumerators can organize MacWilliams and shadow identities and strengthen bounds on stabilizer-code parameters. For prime-power-dimensional qudits, it expresses the squared Weyl coefficients of a code projector and its Weyl-conjugation overlaps as a symplectic Fourier pair; Hamming projection recovers the Shor–Laflamme MacWilliams identity.
It defines $2q^2$ character/inversion-twisted transforms and proves that they are output translations of either the ordinary or shadow transform. Consequently, they supply no independent coefficientwise positivity constraints at full Weyl resolution, or under compatible Fourier-closed projections. For qubits, identical-copy Bell sampling realizes the $010$ twisted autocorrelation; translation and Hamming projection recover the Rains shadow enumerator.
For code bounds, a Fourier-invariant refinement with $2q-1$ local classes and split enumerators incorporates reference-stabilizer commutation, orbit, and divisibility constraints. Refined LP excludes $[[11,3,5]]_3$ and $[[11,5,4]]_3$, whose nonexistence was also recently established by classification. Beyond LP, low-weight shadow-coset packing excludes all 292 candidate distributions for $[[17,6,5]]$. Binary simplex mapping and shadow-coset counting exclude $[[14,3,5]]$. Mapping maximally entangled EA codes to binary LCD codes, together with classification and distance bounds, excludes $[[12,6,6;6]]$, $[[15,4,10;11]]$, $[[17,13,4;4]]$, and $[[19,3,14;16]]$.
The stated limitations are computational scaling and dependence on manageable integer candidate sets. Nonbinary tests focus on selected MDS parameters, with no further exclusions over $q=4,5,7$. Several binary parameter sets remain unresolved; extensions using positive maps, phase-sensitive enumerators, and systematic shadow-packing constraints remain open.
Little sign of AI-generated textAI use disclosed
OpenAI ChatGPT and Anthropic Claude were used to assist with mathematical exploration, computational code development and verification, and manuscript preparation.
Written by gpt-6.1-sol from the paper's full text. Automated: it can be wrong.
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.
The paper asks how Fourier-resolved quantum weight enumerators can organize MacWilliams and shadow identities and strengthen bounds on stabilizer-code parameters. For prime-power-dimensional qudits, it expresses the squared Weyl coefficients of a code projector and its Weyl-conjugation overlaps as a symplectic Fourier pair; Hamming projection recovers the Shor–Laflamme MacWilliams identity.
It defines 2q2 character/inversion-twisted transforms and proves that they are output translations of either the ordinary or shadow transform. Consequently, they supply no independent coefficientwise positivity constraints at full Weyl resolution, or under compatible Fourier-closed projections. For qubits, identical-copy Bell sampling realizes the 010 twisted autocorrelation; translation and Hamming projection recover the Rains shadow enumerator.
For code bounds, a Fourier-invariant refinement with 2q−1 local classes and split enumerators incorporates reference-stabilizer commutation, orbit, and divisibility constraints. Refined LP excludes [[11,3,5]]3 and [[11,5,4]]3, whose nonexistence was also recently established by classification. Beyond LP, low-weight shadow-coset packing excludes all 292 candidate distributions for [[17,6,5]]. Binary simplex mapping and shadow-coset counting exclude [[14,3,5]]. Mapping maximally entangled EA codes to binary LCD codes, together with classification and distance bounds, excludes [[12,6,6;6]], [[15,4,10;11]], [[17,13,4;4]], and [[19,3,14;16]].
The stated limitations are computational scaling and dependence on manageable integer candidate sets. Nonbinary tests focus on selected MDS parameters, with no further exclusions over q=4,5,7. Several binary parameter sets remain unresolved; extensions using positive maps, phase-sensitive enumerators, and systematic shadow-packing constraints remain open.
In 1997, Shor and Laflamme defined the weight enumerators for quantum error-correcting codes and derived a MacWilliams identity. We extend their work by introducing our double weight enumerators and complete weight enumerators for qubit codes and then investigate the MacWilliams identities for these enumerators. Based on the generalized MacWilliams identities, we solve an open problem, namely, the Singleton-type bound for asymmetric quantum codes (AQCs). Besides, the Hamming-type and the first linear-programming-type bounds for the AQCs are deduced similarly.
In a recent paper, Shor and Laflamme (see Phys. Rev. Lett., vol.78, p.1600-2, 1997) defined two "weight enumerators" for quantum error-correcting codes, connected by a MacWilliams transform, and used them to give a linear programming bound for quantum codes. We introduce two new enumerators which, while much less powerful at producing bounds, are useful tools nonetheless. The new enumerators are connected by a much simpler duality transform, clarifying the duality between Shor and Laflamme's enumerators. We also use the new enumerators to give a simpler condition for a quantum code to have specified minimum distance, and to extend the enumerator theory to codes with block size greater than 2.
This paper develops a MacWilliams-type enumerator theory and semidefinite programming bounds for intrinsic quantum codes. An intrinsic code is a subspace C⊂V of a finite-dimensional unitary representation V of a group G, with errors organized into the isotypic components of L(V) under conjugation. The Knill-Laflamme conditions persist under every G-equivariant realization of V, aallowing intrinsic bounds to apply across diverse physical encodings. Without a group action, we first construct projector and twirl quadratic enumerators for an arbitrary orthogonal decomposition of L(V), analogous respectively to the A and B enumerators of Shor-Laflamme theory. These enumerators satisfy positivity, normalization, and Knill-Laflamme inequalities, but the two superoperator families need not span the same space and therefore admit no canonical duality. A group action places their generalized versions in the same equivariant intertwiner algebra, and the change of basis between them defines the intrinsic MacWilliams transform. When the conjugation representation has multiplicities, this algebra is noncommutative and the enumerators are matrix-valued; positivity and detection are encoded by Loewner-order constraints, making the natural programming bound a semidefinite program. The multiplicity-free specialization recovers the known scalar MacWilliams transform and linear-programming framework. For symmetric powers, intrinsic depth equals ordinary qudit distance, yielding extremality certificates for permutation-invariant qudit codes. Finally, for the 27-dimensional SU(3) representation V=(2,2), an exact dual certificate proves the sharp bound K≤5 for codes detecting the full adjoint isotypic component. An explicit 5-dimensional code attains the bound and, under the canonical embedding, gives a four-qutrit distance-2 code.
Throughout its history, the theory of quantum error correction has heavily benefited from translating classical concepts into the quantum setting. In particular, classical notions of weight enumerators, which relate to the performance of an error-correcting code, and MacWilliams’ identity, which links enumerators of a code to the ones of its dual, have been generalized to the quantum case. In this work, we establish a relationship between the theoretical machinery of quantum weight enumerators and a seemingly unrelated physics experiment: we prove that Rains’ quantum shadow enumerators—a powerful mathematical tool—arise as probabilities of observing fixed numbers of triplets in a two-copy Bell sampling experiment. This insight allows us to develop here a rigorous framework for the direct measurement of quantum weight enumerators, thus enabling experimental and theoretical studies of the entanglement structure of any quantum error-correcting code or quantum state under investigation. On top of that, we derive concrete sample complexity bounds and physically motivated robustness guarantees against unavoidable experimental imperfections. Finally, we demonstrate the feasibility of experimentally learning weight enumerators on a trapped-ion quantum computer. Our experimental findings are in good agreement with theoretical predictions and illuminate how entanglement theory and quantum error correction cross-fertilize each other once two-copy Bell sampling experiments are combined with the theoretical machinery of quantum weight enumerators.
As emerging quantum architectures evolve into heterogeneous networks combining different physical substrates, such as qubits for logic and higher-dimensional qudits for robust communication, the traditional scalar metrics of quantum error correction become insufficient. To address this, we introduce a mathematical framework based on dimension multisets to characterize quantum error-correcting codes (QECC) and absolutely maximally entangled (AME) states in mixed-dimensional Hilbert spaces. By replacing scalar weights with multisets, we accurately capture the exact physical composition of error supports across these diverse systems. Our central result is the mixed-dimensional quantum MacWilliams identity, which establishes the formal algebraic relationship between Shor-Laflamme enumerators and unitary weight enumerators. From this foundation, we deduce the mixed-dimensional shadow identity and derive rigorous, generalized constraints on code parameters, explicitly formulating the mixed-dimensional quantum Hamming, Singleton and Scott bounds, and developing a linear program to systematically evaluate code viability. For the Singleton bound, a tighter bound that has no homogeneous analogue is derived for pure mixed-dimensional codes. Finally, we deploy this enumerator machinery to thoroughly analyze AME states, utilizing shadow inequalities to constrain their existence and introducing a combinatorial grid method for the explicit construction of mixed-dimensional tripartite AME states.
In a previous paper, Shor and Laflamme (see Phys. Rev. Lett., vol.78, p.1600-02, 1997) define two "weight enumerators" for quantum error-correcting codes, connected by a MacWilliams (1977) transform, and use them to give a linear-programming bound for quantum codes. We extend their work by introducing another enumerator, based on the classical theory of shadow codes, that tightens their bounds significantly. In particular, nearly all of the codes known to be optimal among additive quantum codes (codes derived from orthogonal geometry) can be shown to be optimal among all quantum codes. We also use the shadow machinery to extend a bound on additive codes to general codes, obtaining as a consequence that any code of length, can correct at most [(n+1)/6] errors.