Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:2406.18280 · IEEE Transactions on Information Theory

Exploring Quantum Weight Enumerators From the n -Qubit Parallelized SWAP Test

Fei Shi, Kaiyi Guo, Xiande Zhang, Qi Zhao

Published Nov 18, 2025• 2 citations
arXivHTMLPDF

Abstract

Quantum weight enumerators are fundamental tools for analyzing quantum error-correcting codes and multipartite entanglement, offering insights into the existence of quantum error-correcting codes andk-uniform states. In this work, we establish a connection between quantum weight enumerators and then-qubit parallelized SWAP test. We demonstrate that each shadow enumerator corresponds to a probability derived from this test, providing a physical interpretation for the shadow enumerators. Leveraging the non-negativity of these probabilities, we present an elegant proof for the shadow inequalities. Additionally, we show that the Shor-Laflamme weight enumerators and the Rains unitary enumerators can be calculated using then-qubit parallelized SWAP test. For applications, we utilize this test to compute the distances of quantum error-correcting codes, determine thek-uniformity of pure states, and evaluate multipartite entanglement measures. Our results indicate that quantum weight enumerators can be efficiently estimated on quantum computers, opening a path to calculate and verify the distances of quantum error-correcting codes.

DOI
10.1109/tit.2025.3634135

Related papers

Experimental measurement and a physical interpretation of quantum shadow enumerators

Daniel Miller, Kyano Levi, Lukas Postler +18 more

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.

arXiv:2408.16914•Physical Review Research•Mar 6, 2026•17 citations

Quantum shadow enumerators

Eric M. Rains

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.

arXiv:quant-ph/9611001•IEEE Transactions on Information Theory•Jan 1, 1999•115 citations

Quantum weight enumerators

Eric M. Rains

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.

arXiv:quant-ph/9612015•IEEE Transactions on Information Theory•Jul 1, 1998•139 citations

Mixed-dimensional quantum MacWilliams identity: Bounds for codes and absolutely maximally entangled states in heterogeneous systems

David González-Lociga, Simeon Ball

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.

quant-pharXiv:2604.25790•Physical Review A•Apr 29, 2026•3 citations

Polynomial invariants of quantum codes

Eric M. Rains

The weight enumerators (Shor and Laflamme 1997) of a quantum code are quite powerful tools for exploring its structure. As the weight enumerators are quadratic invariants of the code, this suggests the consideration of higher degree polynomial invariants. We show that the space of degree k invariants of a code of length n is spanned by a set of basic invariants in one-to-one correspondence with S/sub k//sup n/. We then present a number of equations and inequalities in these invariants; in particular, we give a higher order generalization of the shadow enumerator of a code, and prove that its coefficients are nonnegative. We also prove that the quartic invariants of a ((4, 4, 2))/sub 2/ code are uniquely determined, an important step in a proof that any ((4, 4, 2))/sub 2/ code is additive (Rains 1999).

arXiv:quant-ph/9704042•IEEE Transactions on Information Theory•Jan 1, 2000•112 citations

Complete Weight Distributions and MacWilliams Identities for Asymmetric Quantum Codes

Chuangqiang Hu, Shudi Yang, Stephen S.‐T. Yau

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.

arXiv:1810.11969•IEEE Access•Jan 1, 2019•7 citations
Quantum weight enumerators are fundamental tools for analyzing quantum error-correcting codes and multipartite entanglement, offering insights into the existence of quantum error-correcting codes andk-uniform states. In this work, we establish a connection between quantum weight enumerators and then-qubit parallelized SWAP test. We demonstrate that each shadow enumerator corresponds to a probability derived from this test, providing a physical interpretation for the shadow enumerators. Leveraging the non-negativity of these probabilities, we present an elegant proof for the shadow inequalities. Additionally, we show that the Shor-Laflamme weight enumerators and the Rains unitary enumerators can be calculated using then-qubit parallelized SWAP test. For applications, we utilize this test to compute the distances of quantum error-correcting codes, determine thek-uniformity of pure states, and evaluate multipartite entanglement measures. Our results indicate that quantum weight enumerators can be efficiently estimated on quantum computers, opening a path to calculate and verify the distances of quantum error-correcting codes.
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.
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.
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.
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.
The weight enumerators (Shor and Laflamme 1997) of a quantum code are quite powerful tools for exploring its structure. As the weight enumerators are quadratic invariants of the code, this suggests the consideration of higher degree polynomial invariants. We show that the space of degree k invariants of a code of length n is spanned by a set of basic invariants in one-to-one correspondence with S/sub k//sup n/. We then present a number of equations and inequalities in these invariants; in particular, we give a higher order generalization of the shadow enumerator of a code, and prove that its coefficients are nonnegative. We also prove that the quartic invariants of a ((4, 4, 2))/sub 2/ code are uniquely determined, an important step in a proof that any ((4, 4, 2))/sub 2/ code is additive (Rains 1999).
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.