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

• URL: http://arxiv.org/abs/2605.15372v1
• Date: Thu, 14 May 2026 19:58:50 GMT
• Title: Orthogonal Polynomials and the MacWilliams Transform for Permutation-Invariant Qudit Codes
• Abstract summary: We derive an explicit formula for the intrinsic MacWilliams transform for permutation-invariant qudit codes.<n>The resulting formula supplies an explicit MacWilliams matrix for computing linear programming bounds on permutation-invariant qudit codes.
• Score: 2.538209532048867
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• 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.

Related papers

• MacWilliams Identities for Intrinsic Quantum Codes [4.297070083645049]
  An intrinsic quantum code is a subspace of a representation $V$ of a group $G$.<n>Errors are organized by the decomposition of the conjugation representation on $mathcalL(V)$ into isotypic subspaces.
  arXiv  Detail & Related papers  (2026-04-17T12:53:17Z)
• Irreducible matrix representations for the walled Brauer algebra [0.9374652839580183]
  This paper investigates the representation theory of the algebra of partially transposed permutation operators, $mathcalAd_p,p$.<n>It provides a matrix representation for the abstract walled Brauer algebra.<n>This algebra has recently gained significant attention due to its relevance in quantum information theory.
  arXiv  Detail & Related papers  (2025-01-22T18:22:20Z)
• High-Rank Irreducible Cartesian Tensor Decomposition and Bases of Equivariant Spaces [48.465738895704455]
  We construct path matrices for decomposition of Cartesian tensors up to rank $n=9$ with reduced and affordable complexity.<n>Our method avoids the RREF algorithm and maintains a fully analytical derivation of each ICT decomposition matrix.<n>We extend our result to the arbitrary tensor product and direct sum spaces, enabling free design between different spaces while keeping symmetry.
  arXiv  Detail & Related papers  (2024-12-24T08:25:38Z)
• Entrywise application of non-linear functions on orthogonally invariant matrices [44.99833362998488]
  We investigate how the entrywise application of a non-linear function to symmetric invariant random matrix ensembles alters the spectral distribution.<n>We find that in all those cases a Gaussian equivalence principle holds, that is, the effect of the non-linear function is the same as taking a linear combination of the involved matrices and an additional independent GOE.
  arXiv  Detail & Related papers  (2024-12-09T19:41:09Z)
• Transforming optimization problems into a QUBO form: A tutorial [45.31975029877049]
  Practically relevant problems of quadratic optimization often contain multidimensional arrays of variables interconnected by linear constraints. The paper identifies and considers three main transformations of the original problem statement. Convenient formulas for calculations are presented and proven, simplifying the implementation of these transformations.
  arXiv  Detail & Related papers  (2024-10-28T14:38:09Z)
• Can Transformers Do Enumerative Geometry? [44.99833362998488]
  We introduce a Transformer-based approach to computational enumerative geometry.<n>We compute intersection numbers across a value range from $10-45$ to $1045$.<n>We show that the network is implicitly modeling the Virasoro constraints in a purely data-driven manner.
  arXiv  Detail & Related papers  (2024-08-27T09:44:01Z)
• Efficient conversion from fermionic Gaussian states to matrix product states [48.225436651971805]
  We propose a highly efficient algorithm that converts fermionic Gaussian states to matrix product states.<n>It can be formulated for finite-size systems without translation invariance, but becomes particularly appealing when applied to infinite systems.<n>The potential of our method is demonstrated by numerical calculations in two chiral spin liquids.
  arXiv  Detail & Related papers  (2024-08-02T10:15:26Z)
• A Galois theorem for machine learning: Functions on symmetric matrices and point clouds via lightweight invariant features [26.619014249559942]
  We present a mathematical formulation for machine learning of functions on symmetric matrices and point clouds.<n>We provide a general construction of generically separating invariant features using ideas inspired by Galois theory.<n>We prove that the number of invariant features can be reduced, generically without losing expressivity, to $O(n)$, where $n$ is the number of points.
  arXiv  Detail & Related papers  (2024-05-13T18:24:03Z)
• Unitarization of Pseudo-Unitary Quantum Circuits in the S-matrix Framework [0.0]
  We show a family of pseudo-unitary and inter-pseudo-unitary circuits with full diagrammatic representation in three dimensions. The outcomes of our study expand the methodological toolbox needed to build a family of pseudo-unitary and inter-pseudo-unitary circuits.
  arXiv  Detail & Related papers  (2023-02-09T14:55:20Z)
• Permutation symmetry in large N Matrix Quantum Mechanics and Partition Algebras [0.0]
  We describe the implications of permutation symmetry for the state space and dynamics of quantum mechanical systems of general size $N$. A symmetry-based mechanism for quantum many body scars discussed in the literature can be realised in these matrix systems with permutation symmetry.
  arXiv  Detail & Related papers  (2022-07-05T16:47:10Z)
• Convolutional Filtering and Neural Networks with Non Commutative Algebras [153.20329791008095]
  We study the generalization of non commutative convolutional neural networks. We show that non commutative convolutional architectures can be stable to deformations on the space of operators.
  arXiv  Detail & Related papers  (2021-08-23T04:22:58Z)
• Positive maps and trace polynomials from the symmetric group [0.0]
  We develop a method to obtain operator inequalities and identities in several variables. We give connections to concepts in quantum information theory and invariant theory.
  arXiv  Detail & Related papers  (2020-02-28T17:43:37Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.