pith. sign in

arxiv: 2605.15372 · v1 · pith:LIS6DBFKnew · submitted 2026-05-14 · 🪐 quant-ph · cs.IT· math.IT

Orthogonal Polynomials and the MacWilliams Transform for Permutation-Invariant Qudit Codes

Ian Teixeira This is my paper

Pith reviewed 2026-05-19 15:34 UTC · model grok-4.3

classification 🪐 quant-ph cs.ITmath.IT
keywords MacWilliams transformpermutation-invariant codesqudit codesRacah polynomialsorthogonal polynomialsquantum error correctionlinear programming boundshypergeometric series
0
0 comments X p. Extension
pith:LIS6DBFK Add to your LaTeX paper What is a Pith Number? 
\usepackage{pith}
\pithnumber{LIS6DBFK}

Prints a linked pith:LIS6DBFK badge after your title and writes the identifier into PDF metadata. Compiles on arXiv with no extra files. Learn more

The pith

The MacWilliams transform for permutation-invariant qudit codes equals a finite Racah transform built from orthogonal polynomials.

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

The paper tries to establish an explicit formula for the MacWilliams transform that applies to quantum error-correcting codes invariant under any permutation of their qudits. The key step is recognizing that this transform is the same as a finite version of the Racah transform. The entries of the matrix are written using a hypergeometric series that terminates, and each row is a Racah polynomial whose shape depends on how many qudits there are and what dimension each has. If this holds, researchers can write down the bounds that limit the performance of such codes without having to compute everything from scratch.

Core claim

The intrinsic MacWilliams matrix for permutation-invariant qudit codes is identified with a finite Racah transform whose entries are given by a terminating hypergeometric series and whose rows are Racah orthogonal polynomials with parameters determined by block length and local dimension.

What carries the argument

The finite Racah transform, a matrix whose rows are Racah orthogonal polynomials parametrized by block length and local dimension, that serves as the intrinsic MacWilliams matrix.

If this is right

  • Closed-form orthogonality, detailed-balance, and involutivity identities hold for the transform.
  • The spectrum of the degree-one twirl lies on an affine quadratic lattice.
  • A tridiagonal multiplication rule follows from the representation theory of the adjoint sector.
  • Linear programming bounds on permutation-invariant qudit codes can now be computed explicitly.

Where Pith is reading between the lines

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

  • This identification may allow similar explicit transforms for other quantum codes with symmetric structures.
  • Connections to classical coding theory could be strengthened by viewing the Racah polynomials as weight enumerators in higher dimensions.
  • Further work might test whether the affine quadratic lattice spectrum appears in related quantum information quantities.

Load-bearing premise

The conjugation action on the operator space breaks down into distinct irreducible parts without any duplicates.

What would settle it

Computing the MacWilliams matrix entries for small values of block length and local dimension and finding they do not match the terminating hypergeometric series would falsify the claim.

read the original abstract

We derive an explicit formula for the intrinsic MacWilliams transform for permutation-invariant qudit codes. Such codes naturally live in symmetric power representations, where the relevant error sectors are determined by the irreducible decomposition of the conjugation action on the associated operator space. Using the multiplicity-free structure of this decomposition and the corresponding intertwiner algebra, we identify the intrinsic MacWilliams matrix with a finite Racah transform. The entries are given by a terminating hypergeometric series, and the rows of the matrix are Racah orthogonal polynomials with parameters determined explicitly by the block length and local dimension. Computing the spectrum of the degree-one twirl reveals that this spectrum lies on an affine quadratic lattice. Then we derive a tridiagonal multiplication rule from the representation theory of the adjoint sector. As consequences, we obtain closed-form orthogonality, detailed-balance, and involutivity identities for the transform. The resulting formula supplies an explicit MacWilliams matrix for computing linear programming bounds on permutation-invariant qudit codes.

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

1 major / 2 minor

Summary. The manuscript derives an explicit formula for the intrinsic MacWilliams transform for permutation-invariant qudit codes. It identifies this transform with a finite Racah transform whose entries are given by a terminating hypergeometric series, with the rows being Racah orthogonal polynomials parameterized by block length and local dimension. The derivation uses the multiplicity-free decomposition of the conjugation action on the operator space End(Sym^n C^d), computes the spectrum of the degree-one twirl on an affine quadratic lattice, derives a tridiagonal multiplication rule from the representation theory of the adjoint sector, and obtains closed-form identities for orthogonality, detailed-balance, and involutivity as consequences.

Significance. If the central identification holds, the result supplies an explicit, parameter-free MacWilliams matrix for computing linear programming bounds on permutation-invariant qudit codes. The approach draws on standard representation-theoretic facts about symmetric powers and the Racah algebra to obtain explicit formulas and orthogonal polynomial structure; this is a strength when the derivation is fully verified.

major comments (1)
  1. [Abstract and §2] The multiplicity-free decomposition of the conjugation action on End(Sym^n C^d) is load-bearing for the identification of the intertwiner algebra with the Racah algebra and the claim that the MacWilliams matrix is precisely the scalar Racah transform (without multiplicity blocks). The abstract invokes this structure, but an explicit verification or reference establishing that all irreps appear with multiplicity one for arbitrary n and d is required; if any irrep has multiplicity m>1, the commutant contains M_m(C) factors and the plain _4F3 Racah matrix would not suffice.
minor comments (2)
  1. [§3] Clarify the precise range of summation and the explicit dependence of the Racah polynomial parameters on n and d in the hypergeometric expression for the matrix entries.
  2. [§4] Add a short remark on how the affine quadratic lattice for the spectrum of the degree-one twirl follows from the representation theory of the adjoint sector.

Simulated Author's Rebuttal

1 responses · 0 unresolved

We thank the referee for the careful reading of our manuscript and for the constructive major comment. We appreciate the opportunity to clarify the foundational representation-theoretic structure underlying our results on the MacWilliams transform for permutation-invariant qudit codes.

read point-by-point responses

  1. Referee: [Abstract and §2] The multiplicity-free decomposition of the conjugation action on End(Sym^n C^d) is load-bearing for the identification of the intertwiner algebra with the Racah algebra and the claim that the MacWilliams matrix is precisely the scalar Racah transform (without multiplicity blocks). The abstract invokes this structure, but an explicit verification or reference establishing that all irreps appear with multiplicity one for arbitrary n and d is required; if any irrep has multiplicity m>1, the commutant contains M_m(C) factors and the plain _4F3 Racah matrix would not suffice.

    Authors: We agree that the multiplicity-free character of the decomposition is essential to the identification with the scalar Racah transform. In the revised manuscript we will expand §2 with an explicit verification. The conjugation representation on End(Sym^n V) is equivalent to the GL(V)-module Sym^n V ⊗ Sym^n V^*, whose irreducible constituents are the representations with highest weights of the form (λ, −λ) for partitions λ of length at most d and weight at most n. Each such irrep appears with multiplicity exactly one; this can be seen by constructing a unique (up to scalar) highest-weight vector for each admissible λ via the standard monomial basis of the symmetric power and verifying that the Littlewood–Richardson coefficients in the relevant range are 0 or 1. Consequently the commutant is commutative and isomorphic to the Racah algebra generated by the degree-one twirl, so the MacWilliams matrix is indeed the plain terminating _4F3 Racah matrix without matrix blocks. We will also cite the relevant background from the representation theory of GL(d) (e.g., the decomposition of symmetric–dual-symmetric tensor products). revision: yes

Circularity Check

0 steps flagged

Multiplicity-free decomposition treated as external input; no self-referential reduction in Racah identification

full rationale

The derivation begins from the stated multiplicity-free decomposition of the conjugation action on End(Sym^n C^d) and the resulting intertwiner algebra. These are invoked as representation-theoretic facts to equate the intrinsic MacWilliams matrix with the finite Racah transform whose entries are the terminating _4F3 series. No parameter is fitted to the target formula and then relabeled as a prediction, no self-citation chain is load-bearing for the central identification, and the orthogonality/detailed-balance identities are derived as consequences rather than presupposed. The construction therefore remains self-contained against external benchmarks.

Axiom & Free-Parameter Ledger

0 free parameters · 2 axioms · 0 invented entities

The derivation relies on the multiplicity-free property of the symmetric-power representation and the standard theory of the Racah algebra; no new free parameters or invented entities are introduced.

axioms (2)
  • domain assumption The conjugation action on the operator space of the symmetric power decomposes multiplicity-free into irreducibles.
    Invoked to identify the intertwiner algebra with the Racah algebra without multiplicity corrections.
  • domain assumption The spectrum of the degree-one twirl lies on an affine quadratic lattice.
    Used to obtain the tridiagonal multiplication rule.

pith-pipeline@v0.9.0 · 5693 in / 1365 out tokens · 30045 ms · 2026-05-19T15:34:27.473137+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

28 extracted references · 28 canonical work pages · 1 internal anchor

  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

    work page 1963

  2. [2]

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

    work page 1977

  3. [3]

    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

    work page 1973

  4. [4]

    Bannai and T

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

    work page 1984

  5. [5]

    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 1997. [Online]. Available: https://link.aps.org/doi/10. 1103/PhysRevLett.78.1600

    work page 1997

  6. [6]

    Quantum weight enumerators,

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

    work page 1998

  7. [7]

    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–

    work page 1997

  8. [8]

    Quantum shadow enumerators,

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

    work page 1999

  9. [9]

    Upper bounds on the size of quantum codes,

    A. Ashikhmin and S. Litsyn, “Upper bounds on the size of quantum codes,”IEEE Transactions on Information Theory, vol. 45, no. 4, pp. 1206–1215, 1999

    work page 1999

  10. [10]

    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

  11. [11]

    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

    work page 2004

  12. [12]

    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

    work page 2014

  13. [13]

    Permutation-invariant codes encoding more than one qubit,

    Y . Ouyang and J. Fitzsimons, “Permutation-invariant codes encoding more than one qubit,”Physical Review A, vol. 93, p. 042340, Apr

    work page

  14. [14]

    Available: https://doi.org/10.1103/PhysRevA.93.042340

    [Online]. Available: https://doi.org/10.1103/PhysRevA.93.042340

    work page doi:10.1103/physreva.93.042340

  15. [15]

    Permutation-invariant qudit codes from polynomials,

    Y . Ouyang, “Permutation-invariant qudit codes from polynomials,” Linear Algebra and its Applications, vol. 532, p. 43–59, Nov. 2017. [Online]. Available: http://dx.doi.org/10.1016/j.laa.2017.06.031

    work page doi:10.1016/j.laa.2017.06.031 2017

  16. [16]

    Permutation-invariant constant-excitation quantum codes for amplitude damping,

    Y . Ouyang and R. Chao, “Permutation-invariant constant-excitation quantum codes for amplitude damping,”IEEE Transactions on Infor- mation Theory, vol. 66, no. 5, pp. 2921–2933, 2020

    work page 2020

  17. [17]

    Permutation-invariant quantum coding for quantum dele- tion channels,

    Y . Ouyang, “Permutation-invariant quantum coding for quantum dele- tion channels,” in2021 IEEE International Symposium on Information Theory (ISIT), 2021, pp. 1499–1503

    work page 2021

  18. [18]

    Permutation-invariant quantum codes for deletion errors,

    T. Shibayama and M. Hagiwara, “Permutation-invariant quantum codes for deletion errors,” in2021 IEEE International Symposium on Infor- mation Theory (ISIT), 2021, pp. 1493–1498

    work page 2021

  19. [19]

    A family of permutationally invariant quantum codes,

    A. Aydin, M. A. Alekseyev, and A. Barg, “A family of permutationally invariant quantum codes,”Quantum, vol. 8, p. 1321, Apr. 2024. [Online]. Available: http://dx.doi.org/10.22331/q-2024-04-30-1321

    work page doi:10.22331/q-2024-04-30-1321 2024

  20. [20]

    Intrinsic quantum codes,

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

    work page arXiv 2026

  21. [21]

    MacWilliams Identities for Intrinsic Quantum Codes

    ——, “Macwilliams identities for intrinsic quantum codes,” 2026. [Online]. Available: https://arxiv.org/abs/2604.16023

    work page internal anchor Pith review Pith/arXiv arXiv 2026

  22. [22]

    Fulton and J

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

    work page 1999

  23. [23]

    Koekoek, P

    R. Koekoek, P. A. Lesky, and R. F. Swarttouw,Hypergeometric Or- thogonal Polynomials and Theirq-Analogues, ser. Springer Monographs in Mathematics. Berlin: Springer, 2010, racah polynomials treated in section 9.2

    work page 2010

  24. [24]

    Some hypergeometric orthogonal polynomials,

    J. A. Wilson, “Some hypergeometric orthogonal polynomials,”SIAM Journal on Mathematical Analysis, vol. 11, no. 4, pp. 690–701, 1980

    work page 1980

  25. [25]

    T. S. Chihara,An Introduction to Orthogonal Polynomials, ser. Math- ematics and Its Applications. New York: Gordon and Breach, 1978, reprinted by Dover Publications, 2011, ISBN 978-0-486-47929-3

    work page 1978

  26. [26]

    Szego,Orthogonal Polynomials, 4th ed., ser

    G. Szego,Orthogonal Polynomials, 4th ed., ser. Colloquium Publica- tions. Providence, RI: American Mathematical Society, 1975, vol. 23

    work page 1975

  27. [27]

    A set of orthogonal polynomials that generalize the Racah coefficients or6-jsymbols,

    R. Askey and J. A. Wilson, “A set of orthogonal polynomials that generalize the Racah coefficients or6-jsymbols,”SIAM Journal on Mathematical Analysis, vol. 10, no. 5, pp. 1008–1016, 1979

    work page 1979

  28. [28]

    The Askey-scheme of hypergeometric orthogonal polynomials and itsq-analogue,

    R. Koekoek and R. F. Swarttouw, “The Askey-scheme of hypergeometric orthogonal polynomials and itsq-analogue,” Delft University of Technology, Faculty of Technical Mathematics and Informatics, Tech. Rep. 98-17, 1998. [Online]. Available: https://arxiv.org/abs/math/ 9602214 APPENDIXA CASIMIREIGENVALUES ANDNORMALIZATION This appendix records the Casimir eig...

    work page 1998