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:2409.03576

An invariant-theoretic approach to three weight enumerators of self-dual quantum codes

Yin Chen, Ren, Shan, Zhang, Runxuan

Published Sep 5, 2024• 0 citations
arXivHTMLPDF

Abstract

This article is a continuation of our recent work (Yin Chen and Runxuan Zhang, Shape enumerators of self-dual NRT codes over finite fields. SIAM J. Discrete Math. 38 (2024), no. 4, 2841-2854) in the setting of quantum error-correcting codes. We use algebraic invariant theory to study three weight enumerators of formally self-dual quantum codes over arbitrary finite fields. We derive a quantum analogue of Gleason's theorem, demonstrating that the weight enumerator of a formally self-dual quantum code can be expressed algebraically by two polynomials. We also show that the double weight enumerator of a formally self-dual quantum code can be expressed algebraically by five polynomials. We explicitly compute the complete weight enumerators of some special self-dual quantum codes. Our approach illustrates the potential of employing algebraic invariant theory to compute weight enumerators of self-dual quantum codes.

DOI
10.48550/arxiv.2409.03576

Related papers

Three MacWilliams type identities and quantum error-correcting $ G $ -codes

Chuangxun Cheng, Xiaoguang Shang

We prove three MacWilliams type identities for irreducible projective representations of finite groups. As an application, we deduce the MacWilliams identities of weight enumerators, double weight enumerators and complete weight enumerators for quantum error-correcting $ G $-codes and obtain the Singleton bounds.

Advances in Mathematics of Communications•Dec 27, 2024•0 citations

Invariant Theory, Magic State Distillation, and Bounds on Classical Codes

Amolak Ratan Kalra, Shiroman Prakash

We show that the physical consistency of magic state distillation imposes new constraints on the weight enumerators of classical error-correcting codes. We establish that for $|T\rangle$-state distillation protocols based on linear self-orthogonal $GF(4)$ codes, the distillation threshold and noise-suppression exponent are directly determined by the code's simple weight enumerator. By enforcing the physical consistency of the distillation process -- specifically, that the probability of successfully projecting onto the target state must be non-negative -- we derive a new set of constraints on classical weight enumerators. These ``quantum consistency'' constraints prove to be strictly stronger than those derived from classical invariant theory, yielding new upper bounds on the minimum distance of certain classical and quantum codes. Most notably, we show that these new constraints resolve a long-standing open problem in classical coding theory by proving the non-existence of extremal Hermitian self-dual codes over $GF(4)$ with parameters $[12m, 6m, 4m+2]$. Additionally, we use our formalism to perform an exhaustive search of distillation protocols based on linear $GF(4)$ codes with $n < 20$, finding no protocols with thresholds exceeding the 5-qubit code, and we derive analytic upper bounds on the noise-suppression exponents of such distillation routines as a function of $n$.

arXiv:2501.10163•Jan 17, 2025•6 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

Families of Cyclic Codes over Finite Chain Rings

Andrew Nemec

A major difficulty in quantum computation and communication is preventing and correcting errors in the quantum bits. Most of the research in this area has focused on stabilizer codes derived from self-orthogonal cyclic error-correcting codes over finite fields. Our goal is to develop a similar theory for self-orthogonal cyclic codes over the class of finite chain rings which have been proven to also produce stabilizer codes. We also will discuss these restrictions on families of cyclic codes, including, but not limited to quadratic residue codes and Bose-Chaudhuri-Hocquenghem codes. Finally, we will extend the concepts of weight enumerators to the class of Frobenius rings and use them to derive bounds for our codes.

•Sep 29, 2015•0 citations

Theory of low-weight quantum codes

Fuchuan Wei, Zhengyi Han, Austin Yubo He +2 more

Low check weight is a crucial code property for fault-tolerant quantum computing, which underlies the strong interest in quantum low-density parity-check (qLDPC) codes. Here, we initiate the theory of weight-constrained stabilizer codes from various foundational perspectives including the complexity of computing code weight and the explicit boundary of feasible low-weight codes in both theoretical and practical settings. We first prove that computing the optimal generator weight of a stabilizer code is $\mathsf{NP}$-hard, motivating efficiently computable bounds. We derive analytical lower bounds on check weight in terms of code rate and distance, identifying the minimum weights needed for single-qubit error detection and correction, as well as the sharp distance and rate limits of weight-three error-detecting codes. Matching constructions show that these bounds are tight in several regimes. To establish refined finite-size constraints, we develop a linear programming framework based on quantum weight enumerators subject to generator-weight constraints, yielding exact optimal weights for all parameter combinations with $n\le9$. Finally, we show that the same framework can incorporate architecture-dependent constraints, using the 127-qubit IBM Eagle chip as a concrete example. Our study brings the weight as a crucial parameter into coding theory and provides guidance for code design and utility in practical scenarios.

quant-pharXiv:2601.19848•Jan 28, 2026•3 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
This article is a continuation of our recent work (Yin Chen and Runxuan Zhang, Shape enumerators of self-dual NRT codes over finite fields. SIAM J. Discrete Math. 38 (2024), no. 4, 2841-2854) in the setting of quantum error-correcting codes. We use algebraic invariant theory to study three weight enumerators of formally self-dual quantum codes over arbitrary finite fields. We derive a quantum analogue of Gleason's theorem, demonstrating that the weight enumerator of a formally self-dual quantum code can be expressed algebraically by two polynomials. We also show that the double weight enumerator of a formally self-dual quantum code can be expressed algebraically by five polynomials. We explicitly compute the complete weight enumerators of some special self-dual quantum codes. Our approach illustrates the potential of employing algebraic invariant theory to compute weight enumerators of self-dual quantum codes.
We show that the physical consistency of magic state distillation imposes new constraints on the weight enumerators of classical error-correcting codes. We establish that for ∣T⟩|T\rangle∣T⟩-state distillation protocols based on linear self-orthogonal GF(4)GF(4)GF(4) codes, the distillation threshold and noise-suppression exponent are directly determined by the code's simple weight enumerator. By enforcing the physical consistency of the distillation process -- specifically, that the probability of successfully projecting onto the target state must be non-negative -- we derive a new set of constraints on classical weight enumerators. These ``quantum consistency'' constraints prove to be strictly stronger than those derived from classical invariant theory, yielding new upper bounds on the minimum distance of certain classical and quantum codes. Most notably, we show that these new constraints resolve a long-standing open problem in classical coding theory by proving the non-existence of extremal Hermitian self-dual codes over GF(4)GF(4)GF(4) with parameters [12m,6m,4m+2][12m, 6m, 4m+2][12m,6m,4m+2]. Additionally, we use our formalism to perform an exhaustive search of distillation protocols based on linear GF(4)GF(4)GF(4) codes with n<20n < 20n<20, finding no protocols with thresholds exceeding the 5-qubit code, and we derive analytic upper bounds on the noise-suppression exponents of such distillation routines as a function of nnn.
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).
A major difficulty in quantum computation and communication is preventing and correcting errors in the quantum bits. Most of the research in this area has focused on stabilizer codes derived from self-orthogonal cyclic error-correcting codes over finite fields. Our goal is to develop a similar theory for self-orthogonal cyclic codes over the class of finite chain rings which have been proven to also produce stabilizer codes. We also will discuss these restrictions on families of cyclic codes, including, but not limited to quadratic residue codes and Bose-Chaudhuri-Hocquenghem codes. Finally, we will extend the concepts of weight enumerators to the class of Frobenius rings and use them to derive bounds for our codes.
Low check weight is a crucial code property for fault-tolerant quantum computing, which underlies the strong interest in quantum low-density parity-check (qLDPC) codes. Here, we initiate the theory of weight-constrained stabilizer codes from various foundational perspectives including the complexity of computing code weight and the explicit boundary of feasible low-weight codes in both theoretical and practical settings. We first prove that computing the optimal generator weight of a stabilizer code is NP\mathsf{NP}NP-hard, motivating efficiently computable bounds. We derive analytical lower bounds on check weight in terms of code rate and distance, identifying the minimum weights needed for single-qubit error detection and correction, as well as the sharp distance and rate limits of weight-three error-detecting codes. Matching constructions show that these bounds are tight in several regimes. To establish refined finite-size constraints, we develop a linear programming framework based on quantum weight enumerators subject to generator-weight constraints, yielding exact optimal weights for all parameter combinations with n≤9n\le9n≤9. Finally, we show that the same framework can incorporate architecture-dependent constraints, using the 127-qubit IBM Eagle chip as a concrete example. Our study brings the weight as a crucial parameter into coding theory and provides guidance for code design and utility in practical scenarios.
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.