pith. machine review for the scientific record. sign in

arxiv: 2604.16023 · v1 · submitted 2026-04-17 · 🪐 quant-ph · cs.IT· math.IT

Recognition: unknown

MacWilliams Identities for Intrinsic Quantum Codes

Eric Kubischta, Ian Teixeira

Authors on Pith no claims yet

Pith reviewed 2026-05-10 07:55 UTC · model grok-4.3

classification 🪐 quant-ph cs.ITmath.IT
keywords MacWilliams identitiesquantum error correctionintrinsic quantum codessymmetry groupspermutation-invariant codesWigner 6j-symbolslinear programming boundsequivariant quantum codes
0
0 comments X

The pith

When the conjugation representation is multiplicity-free, projector and twirl enumerators for intrinsic quantum codes are related by a linear MacWilliams transform.

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The paper develops enumerators for quantum error correction that are intrinsic to unitary representations of symmetry groups. Errors are classified according to the isotypic decomposition of the conjugation representation on the space of operators. Projector and twirl enumerators are introduced that obey positivity, normalization, and Knill-Laflamme inequalities. When the representation is multiplicity-free these enumerators are connected by a linear transformation that serves as an intrinsic MacWilliams identity. For the group SU(2) this transformation is expressed using Wigner 6j-symbols, which then produces linear programming bounds on the parameters of permutation-invariant qubit and qudit codes.

Core claim

An intrinsic quantum code is a subspace of a representation V of a group G. The conjugation representation on L(V) decomposes into isotypic subspaces, and associated projector and twirl enumerators satisfy positivity, normalization, and Knill-Laflamme type inequalities. When the conjugation representation is multiplicity-free, these enumerators are related by a linear transform that we interpret as an intrinsic MacWilliams identity. For G=SU(2), we compute this transform explicitly in terms of Wigner 6j-symbols. Applied to symmetric-power representations, this gives linear programming bounds for permutation-invariant qubit and qudit codes, including extremality results for the four-qubit,七qu

What carries the argument

The projector and twirl enumerators associated to an orthogonal decomposition of L(V), which are related by a linear transform (the intrinsic MacWilliams identity) when the conjugation representation is multiplicity-free.

If this is right

  • Linear programming bounds for permutation-invariant qubit and qudit codes.
  • Extremality results for the four-qubit, seven-qubit, and three-qutrit examples.
  • Matrix-valued enumerators and block-unitary MacWilliams transforms when multiplicities are present.
  • Semidefinite feasibility problems in the general equivariant theory, illustrated for a non-multiplicity-free SU(3) example.

Where Pith is reading between the lines

These are editorial extensions of the paper, not claims the author makes directly.

  • The 6j-symbol expression may simplify further computations of distance bounds for any SU(2)-symmetric code whose isotypic decomposition is known.
  • The same construction could be carried out for other compact Lie groups once their recoupling coefficients are available, producing analogous bounds for codes invariant under those symmetries.
  • If the transform is positive-preserving in general, it could yield new symmetry-adapted quantum Singleton or Hamming bounds without requiring an explicit code construction.

Load-bearing premise

Errors can be organized by the isotypic decomposition of the conjugation representation on L(V) into subspaces such that the projector and twirl enumerators satisfy positivity, normalization, and Knill-Laflamme type inequalities that enable the linear transform.

What would settle it

A multiplicity-free representation together with an explicit valid intrinsic code whose projector and twirl enumerator vectors fail to satisfy the claimed linear relation, or a permutation-invariant code whose parameters violate the derived linear programming bound.

read the original abstract

We develop an intrinsic enumerator framework for quantum error correction in unitary representations of symmetry groups. An intrinsic quantum code is a subspace of a representation $V$ of a group $G$, and errors are organized by the decomposition of the conjugation representation on $\mathcal{L}(V)$ into isotypic subspaces. Associated with any orthogonal decomposition of $\mathcal{L}(V)$ we introduce two families of quadratic enumerators, called projector and twirl enumerators, which satisfy positivity, normalization, and Knill--Laflamme type inequalities. When the conjugation representation is multiplicity--free, these enumerators are related by a linear transform that we interpret as an intrinsic MacWilliams identity. For $G=\mathrm{SU}(2)$, we compute this transform explicitly in terms of Wigner $6j$-symbols. Applied to symmetric-power representations, this gives linear programming bounds for permutation-invariant qubit and qudit codes, including extremality results for the four-qubit, seven-qubit, and three-qutrit examples treated here. We also develop the general equivariant theory in the presence of multiplicities, where the enumerators become matrix-valued, the MacWilliams transform becomes block unitary, and the resulting feasibility problem becomes semidefinite; we illustrate this theory in a first non-multiplicity-free $\mathrm{SU}(3)$ example.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, simulated authors' rebuttal, and a circularity audit. Tearing a paper down is the easy half of reading it; the pith above is the substance, this is the friction.

Referee Report

2 major / 3 minor

Summary. The paper introduces an intrinsic enumerator framework for quantum error correction in unitary representations of symmetry groups. An intrinsic quantum code is defined as a subspace of a representation V of a group G, with errors organized by the isotypic decomposition of the conjugation representation on L(V). It introduces projector and twirl enumerators satisfying positivity, normalization, and Knill-Laflamme type inequalities. When the conjugation representation is multiplicity-free, these are related by a linear transform interpreted as an intrinsic MacWilliams identity, explicitly computed for G=SU(2) using Wigner 6j-symbols. This is applied to symmetric-power representations to obtain linear programming bounds for permutation-invariant qubit and qudit codes, including extremality results for the four-qubit, seven-qubit, and three-qutrit examples. The general theory with multiplicities is developed, leading to matrix-valued enumerators and semidefinite programming feasibility problems, illustrated with an SU(3) example.

Significance. If the key properties of the enumerators are rigorously established, this work provides a significant extension of MacWilliams identities to the quantum setting with group symmetries. The explicit computation of the transform in terms of 6j-symbols and the derivation of bounds for permutation-invariant codes represent concrete advances. The extremality results for specific codes and the generalization to the multiplicity case are valuable contributions. The framework could enable new analyses of symmetric quantum codes, though its impact depends on verifying the foundational inequalities.

major comments (2)
  1. [Framework for projector and twirl enumerators] The central results depend on the projector and twirl enumerators satisfying positivity, normalization, and Knill-Laflamme type inequalities for any code subspace in a multiplicity-free conjugation representation. The manuscript outlines these properties but lacks full derivations or explicit verifications, particularly for the symmetric-power representations of SU(2). This is load-bearing for the linear programming bounds and the extremality claims for the four-qubit, seven-qubit, and three-qutrit codes, as the transformed enumerators must preserve these conditions to yield valid bounds.
  2. [Computation of the MacWilliams transform for SU(2)] The linear transform is presented as being computed explicitly in terms of Wigner 6j-symbols. However, the manuscript does not provide a detailed step-by-step derivation showing how the 6j-symbols arise from the recoupling of isotypic projectors and group twirls, nor does it confirm that the transform maps the enumerators while maintaining the necessary inequalities for the LP applications.
minor comments (3)
  1. The abstract is quite technical and dense; expanding the introduction to better motivate the 'intrinsic' aspect relative to standard quantum coding theory would improve accessibility.
  2. [The SU(3) example] Additional details or a small table illustrating the matrix-valued enumerators in the non-multiplicity-free case would help clarify the semidefinite programming setup.
  3. Some notation for the enumerators could be clarified with explicit definitions early in the text to avoid back-referencing.

Simulated Author's Rebuttal

2 responses · 0 unresolved

We thank the referee for their careful reading of the manuscript and for highlighting the foundational aspects of the enumerator framework that support the linear programming bounds. We address each major comment below and will revise the manuscript to incorporate additional detail where needed.

read point-by-point responses

  1. Referee: The central results depend on the projector and twirl enumerators satisfying positivity, normalization, and Knill-Laflamme type inequalities for any code subspace in a multiplicity-free conjugation representation. The manuscript outlines these properties but lacks full derivations or explicit verifications, particularly for the symmetric-power representations of SU(2). This is load-bearing for the linear programming bounds and the extremality claims for the four-qubit, seven-qubit, and three-qutrit codes, as the transformed enumerators must preserve these conditions to yield valid bounds.

    Authors: We agree that the manuscript states the required properties of the enumerators and sketches their verification in the general multiplicity-free setting, but does not supply fully expanded derivations specialized to the symmetric-power representations of SU(2). In the revised version we will add explicit verifications of positivity, normalization, and the Knill-Laflamme-type inequalities for these representations, together with a short argument confirming that the MacWilliams transform preserves the cone of admissible enumerators. This will directly support the validity of the linear-programming bounds and the extremality statements for the cited codes. revision: yes

  2. Referee: The linear transform is presented as being computed explicitly in terms of Wigner 6j-symbols. However, the manuscript does not provide a detailed step-by-step derivation showing how the 6j-symbols arise from the recoupling of isotypic projectors and group twirls, nor does it confirm that the transform maps the enumerators while maintaining the necessary inequalities for the LP applications.

    Authors: The manuscript presents the closed-form expression for the transform in terms of 6j-symbols but condenses the intermediate recoupling steps. We will expand the relevant section to include a step-by-step derivation that traces the appearance of the 6j-symbols from the composition of isotypic projectors with the group twirl. We will also include a short lemma verifying that the resulting linear map sends the cone defined by the positivity and Knill-Laflamme inequalities into itself, thereby confirming that the transformed enumerators remain admissible for the linear-programming applications. revision: yes

Circularity Check

0 steps flagged

No significant circularity; new enumerators and MacWilliams transform defined independently from representation theory

full rationale

The paper introduces projector and twirl enumerators associated to orthogonal decompositions of L(V), proves they satisfy positivity, normalization, and Knill-Laflamme-type inequalities from first principles, then derives the linear (or block-unitary) relation between them under the multiplicity-free assumption using standard Wigner 6j-symbols for SU(2). This relation is computed explicitly rather than fitted or assumed by self-citation. The LP bounds and extremality claims for symmetric-power examples follow by applying the independently derived transform to the enumerators; no step reduces a claimed prediction to a fitted parameter or renames an input by construction. The framework extends established coding-theory and representation-theory tools without load-bearing self-referential definitions.

Axiom & Free-Parameter Ledger

0 free parameters · 2 axioms · 3 invented entities

The framework relies on domain assumptions from representation theory and quantum error correction but introduces new definitions for enumerators and the identity without external independent evidence beyond the internal consistency of the setup.

axioms (2)
  • domain assumption Decomposition of the conjugation representation on L(V) into isotypic subspaces organizes the errors
    Invoked to define how errors are classified for the enumerators.
  • domain assumption Projector and twirl enumerators satisfy positivity, normalization, and Knill-Laflamme type inequalities
    Required for the quadratic enumerators to enable the MacWilliams transform and bounds.
invented entities (3)
  • Intrinsic quantum code no independent evidence
    purpose: Subspace of a group representation V with errors from conjugation representation decomposition
    New definition introduced to frame quantum codes intrinsically within symmetry groups.
  • Projector and twirl enumerators no independent evidence
    purpose: Quadratic enumerators associated with orthogonal decompositions of L(V)
    New families of enumerators defined in the paper.
  • Intrinsic MacWilliams identity no independent evidence
    purpose: Linear transform relating enumerators in multiplicity-free cases
    Interpreted as such for the quantum symmetric setting.

pith-pipeline@v0.9.0 · 5527 in / 1790 out tokens · 39933 ms · 2026-05-10T07:55:39.930090+00:00 · methodology

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Reference graph

Works this paper leans on

27 extracted references · 14 canonical work pages

  1. [1]

    A theorem on the distribution of weights in a systematic code,

    F. J. MacWilliams, “A theorem on the distribution of weights in a systematic code,”Bell System Technical Journal, vol. 42, pp. 79–94, 1963

    1963

  2. [2]

    Delsarte,An Algebraic Approach to the Association Schemes of Coding Theory

    P. Delsarte,An Algebraic Approach to the Association Schemes of Coding Theory. Eindhoven: Philips Research Reports Supplements, 1973, vol. 10

    1973

  3. [3]

    F. J. MacWilliams and N. J. A. Sloane,The Theory of Error-Correcting Codes. North-Holland, 1977

    1977

  4. [4]

    Bannai and T

    E. Bannai and T. Ito,Algebraic Combinatorics I: Association Schemes, ser. Mathematics Lecture Note Series. Menlo Park, CA: Benjamin/Cummings, 1984

    1984

  5. [5]

    Quantum error correction via codes overGF(4),

    A. Calderbank, E. Rains, P. Shor, and N. Sloane, “Quantum error correction via codes overGF(4),” inProceedings of IEEE International Symposium on Information Theory, 1997, pp. 292–

    1997

  6. [6]

    Quantum weight enumerators,

    E. Rains, “Quantum weight enumerators,”IEEE Transactions on Information Theory, vol. 44, no. 4, pp. 1388–1394, 1998

    1998

  7. [7]

    Quantum analog of the macwilliams identities for classical coding theory,

    P. Shor and R. Laflamme, “Quantum analog of the macwilliams identities for classical coding theory,”Phys. Rev. Lett., vol. 78, pp. 1600–1602, Feb

  8. [8]

    Available: https://link.aps.org/doi/10.1103/PhysRevLett.78.1600

    [Online]. Available: https://link.aps.org/doi/10.1103/PhysRevLett.78.1600

    work page doi:10.1103/physrevlett.78.1600

  9. [9]

    Quantum shadow enumerators,

    E. Rains, “Quantum shadow enumerators,”IEEE Transactions on Information Theory, vol. 45, no. 7, pp. 2361–2366, 1999

    1999

  10. [10]

    Intrinsic quantum codes

    E. Kubischta and I. Teixeira, “Intrinsic quantum codes,” 2026. [Online]. Available: https://arxiv.org/abs/2511.14840

    work page arXiv 2026

  11. [11]

    Permutation-invariant quantum codes with transversal generalized phase gates,

    ——, “Permutation-invariant quantum codes with transversal generalized phase gates,”IEEE Transactions on Information Theory, vol. 71, no. 1, pp. 485–498, 2025

    2025

  12. [12]

    Quantum nonlocality without entanglement,

    C. H. Bennett, D. P. DiVincenzo, C. A. Fuchs, T. Mor, E. Rains, P. W. Shor, J. A. Smolin, and W. K. Wootters, “Quantum nonlocality without entanglement,”Phys. Rev. A, vol. 59, pp. 1070–1091, Feb 1999. [Online]. Available: https://link.aps.org/doi/10.1103/PhysRevA.59.1070

    work page doi:10.1103/physreva.59.1070 1999

  13. [13]

    Entanglement measures under symmetry,

    K. G. H. V ollbrecht and R. F. Werner, “Entanglement measures under symmetry,”Phys. Rev. A, vol. 64, p. 062307, Nov 2001. [Online]. Available: https://link.aps.org/doi/10.1103/PhysRevA.64.062307

    work page doi:10.1103/physreva.64.062307 2001

  14. [14]

    A quantum analog of delsarte’s linear programming bounds,

    R. Okada, “A quantum analog of delsarte’s linear programming bounds,” 2025. [Online]. Available: https://arxiv.org/abs/2502.14165

    work page arXiv 2025

  15. [15]

    D. A. Varshalovich, A. N. Moskalev, and V . K. Khersonskii,Quantum Theory of Angular Momentum. WORLD SCIENTIFIC, 1988. [Online]. Available: https://www.worldscientific.com/doi/abs/10.1142/0270

    work page doi:10.1142/0270 1988

  16. [16]

    Fulton and J

    W. Fulton and J. Harris,Representation theory, 1st ed., ser. Graduate texts in mathematics. New York, NY: Springer, Jul. 1999

    1999

  17. [17]

    Pauli exchange errors in quantum computation,

    M. B. Ruskai, “Pauli exchange errors in quantum computation,”Phys. Rev. Lett., vol. 85, pp. 194–197, Jul 2000. [Online]. Available: https://link.aps.org/doi/10.1103/PhysRevLett.85.194

    work page doi:10.1103/physrevlett.85.194 2000

  18. [18]

    Permutation-invariant quantum codes,

    Y . Ouyang, “Permutation-invariant quantum codes,”Physical Review A, vol. 90, no. 6, Dec. 2014. [Online]. Available: http://dx.doi.org/10.1103/ PhysRevA.90.062317

    2014

  19. [19]

    A four-qubits code that is a quantum deletion error-correcting code with the optimal length,

    M. Hagiwara and A. Nakayama, “A four-qubits code that is a quantum deletion error-correcting code with the optimal length,” in2020 International Symposium on Information Theory (ISIT), 2020, pp. 917–921. [Online]. Available: https://ieeexplore.ieee.org/document/9174339

    work page arXiv 2020

  20. [20]

    Single quantum deletion error-correcting codes,

    A. Nakayama and M. Hagiwara, “Single quantum deletion error-correcting codes,” in2021 International Symposium on Information Theory (ISIT), 2021, pp. 1500–1504. [Online]. Available: https://ieeexplore.ieee.org/document/9366129

    work page arXiv 2021

  21. [21]

    Permutation-invariant quantum coding for quantum deletion channels,

    Y . Ouyang, “Permutation-invariant quantum coding for quantum deletion channels,” in2021 IEEE International Symposium on Information Theory (ISIT), 2021, pp. 1499–1504. [Online]. Available: https://ieeexplore.ieee.org/document/9517952

    work page arXiv 2021

  22. [22]

    How much entanglement is needed for quantum error correction?

    S. Bravyi, D. Lee, Z. Li, and B. Yoshida, “How much entanglement is needed for quantum error correction?”Phys. Rev. Lett., vol. 134, p. 210602, May 2025. [Online]. Available: https://link.aps.org/doi/10.1103/PhysRevLett.134.210602

    work page doi:10.1103/physrevlett.134.210602 2025

  23. [23]

    Permutationally invariant codes for quantum error correction,

    H. Pollatsek and M. B. Ruskai, “Permutationally invariant codes for quantum error correction,”Linear Algebra and its Applications, vol. 392, pp. 255–288, 2004. [Online]. Available: https://www.sciencedirect.com/science/article/pii/S0024379504002903

    2004

  24. [24]

    Designing codes around interactions: The case of a spin,

    J. A. Gross, “Designing codes around interactions: The case of a spin,”Phys. Rev. Lett., vol. 127, p. 010504, Jul 2021. [Online]. Available: https://link.aps.org/doi/10.1103/PhysRevLett.127.010504

    work page doi:10.1103/physrevlett.127.010504 2021

  25. [25]

    Family of quantum codes with exotic transversal gates,

    E. Kubischta and I. Teixeira, “Family of quantum codes with exotic transversal gates,”Phys. Rev. Lett., vol. 131, p. 240601, Dec 2023. [Online]. Available: https://link.aps.org/doi/10.1103/PhysRevLett.131.240601

    work page doi:10.1103/physrevlett.131.240601 2023

  26. [26]

    Invariant semidefinite programs,

    C. Bachoc, D. C. Gijswijt, A. Schrijver, and F. Vallentin, “Invariant semidefinite programs,” inHandbook on Semidefinite, Conic and Polynomial Optimization, ser. International Series in Operations Research & Management Science. Springer, 2012, vol. 166, pp. 219–269

    2012

  27. [27]

    Quantum codes from twisted unitaryt-groups,

    E. Kubischta and I. Teixeira, “Quantum codes from twisted unitaryt-groups,”Phys. Rev. Lett., vol. 133, p. 030602, Jul 2024. [Online]. Available: https://link.aps.org/doi/10.1103/PhysRevLett.133.030602

    work page doi:10.1103/physrevlett.133.030602 2024