pith. sign in

arxiv: 2605.22439 · v1 · pith:GHBJVT73new · submitted 2026-05-21 · 🪐 quant-ph · cs.IT· math.IT

Minimal Permutation-Invariant Qudit Codes from Edge-Colorings of Complete Graphs

Eric Kubischta , Ian Teixeira This is my paper

Pith reviewed 2026-05-22 05:46 UTC · model grok-4.3

classification 🪐 quant-ph cs.ITmath.IT
keywords permutation-invariant codesqudit codessymmetric subspaceKnill-Laflamme conditionsedge coloringscomplete graphsquantum error correction
0
0 comments X

The pith

Four qudits suffice to encode one logical qudit with distance two in the symmetric subspace for any local dimension q.

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

The paper constructs a family of permutation-invariant codes that protect one logical qudit against single errors using only four physical qudits, for every local dimension q greater than or equal to two. It works inside the fully symmetric subspace of four qudits and reduces the error-correction requirements to a graph-coloring task on the complete graph with q vertices. A sympathetic reader would care because the result identifies the smallest number of physical systems that can achieve this protection level in the symmetric setting and shows the size stays fixed as q grows.

Core claim

For every integer q at least 2, a permutation-invariant code with parameters ((4,q,2))_q exists inside Sym^4 of q-dimensional qudits. The construction restricts support to the even-entry occupation layer so that root-error conditions vanish, then satisfies the remaining Cartan conditions by organizing occupation-vector packets according to edge colorings of the complete graph K_q, using the midpoint rule when q is odd and a perfect-matching decomposition when q is even. Linear-programming bounds on the symmetric subspace further show that no such code of dimension q and distance at least 2 exists for three or fewer qudits, establishing that four physical qudits are necessary and sufficient.

What carries the argument

The even-entry occupation layer of Sym^4(C^q), whose packets are balanced by edge-colorings of K_q to meet the Cartan conditions after the root conditions are automatically satisfied.

Load-bearing premise

Restricting supports to occupation vectors with even entries makes all root-error conditions vanish so that the remaining conditions reduce to solvable linear balancing constraints.

What would settle it

An explicit check for small q, such as q=2 or q=3, that either finds a valid distance-two code on three qudits or shows the four-qudit states built from the claimed edge-coloring fail to correct all single errors.

read the original abstract

We study permutation-invariant quantum codes in the symmetric subspace $\mathrm{Sym}^n(\mathbb{C}^q) $ of $n$ qudits of local dimension $q$. For every integer $q\geq 2$, we construct a permutation-invariant code with parameters $((4,q,2))_q$. Thus four physical qudits suffice to encode one logical qudit with distance two in the symmetric sector for every local dimension. We also show, using linear-programming constraints for permutation-invariant quantum codes, that no permutation-invariant code of dimension $q$ and distance at least $2$ exists in $\mathrm{Sym}^n(\mathbb{C}^q)$ for $n\leq 3$. Hence four qudits are necessary and sufficient. The construction has a simple representation-theoretic and combinatorial description. In the irreducible $\mathrm{SU}(q)$-module $\mathrm{Sym}^4(\mathbb{C}^q)$, the distance-two Knill-Laflamme conditions split into root and Cartan parts. By restricting supports to the even-entry occupation layer, all root-error conditions vanish automatically. The remaining Cartan conditions reduce to linear balancing constraints on packets of occupation vectors. These packets admit a natural graph-theoretic interpretation in terms of the vertices and edges of the complete graph $K_q$: for odd $q$, they are organized by the midpoint rule, while for even $q$, they are organized by a decomposition of $K_q$ into perfect matchings. In this way, the existence of minimal $((4,q,2))_q$ permutation-invariant codes is reduced to a parity-dependent edge-coloring problem on $K_q$.

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

0 major / 2 minor

Summary. The manuscript constructs permutation-invariant quantum codes in the symmetric subspace Sym^n(C^q). For every integer q ≥ 2 it gives an explicit construction of a code with parameters ((4,q,2))_q. Using linear-programming constraints derived from the Knill-Laflamme conditions specialized to permutation-invariant codes, it proves that no code of dimension q and distance at least 2 exists for n ≤ 3. The construction restricts support to the even-entry occupation layer of Sym^4(C^q), which automatically satisfies all root-error conditions; the remaining Cartan-Cartan conditions reduce to linear balancing equations on occupation packets that are solved by parity-dependent edge-colorings of the complete graph K_q (midpoint rule for odd q, 1-factorization for even q).

Significance. If the claims hold, the work determines that four physical qudits are necessary and sufficient to encode one logical qudit of dimension q with distance 2 inside the symmetric subspace. The representation-theoretic splitting of the Knill-Laflamme conditions together with the parity argument that eliminates root operators, and the explicit reduction to a standard combinatorial problem on K_q, constitute clear strengths. The linear-programming upper bound on n is obtained directly from the same permutation-invariant matrix and supplies an independent verification of minimality. These elements make the result both constructive and tight.

minor comments (2)
  1. §3 (or the section presenting the construction): an explicit listing of the multiplicity vector or the resulting codewords for one small odd q (e.g., q=3) and one small even q (e.g., q=2) would make the edge-coloring solution immediately verifiable.
  2. The linear-programming section: the precise form of the permutation-invariant Knill-Laflamme matrix used for the n≤3 bound should be displayed as an equation or table so that the reader can reproduce the infeasibility certificate without reconstructing it from the text.

Simulated Author's Rebuttal

0 responses · 0 unresolved

We thank the referee for their careful reading of the manuscript and for the positive recommendation to accept. We are pleased that the representation-theoretic splitting of the Knill-Laflamme conditions, the combinatorial reduction to edge-colorings of K_q, and the linear-programming minimality argument were viewed as strengths.

Circularity Check

0 steps flagged

No significant circularity; construction reduces to independent graph-theoretic existence

full rationale

The derivation begins from the Knill-Laflamme conditions on the symmetric subspace Sym^4(C^q) and splits them into root and Cartan parts. Restricting to the even-entry occupation layer makes all root-error matrix elements vanish identically by parity (root operators change occupation numbers by ±1 and thus map even to odd sectors). The remaining Cartan-Cartan conditions become linear balancing equations on occupation packets, which the paper solves by mapping to vertices and edges of K_q and invoking standard, parity-dependent edge-colorings (midpoint rule for odd q; 1-factorization into perfect matchings for even q). These combinatorial objects are external to the quantum parameters and exist independently. The complementary upper bound ruling out n ≤ 3 is obtained directly from the same permutation-invariant LP matrix and contains no fitted quantities or self-referential steps. No equation reduces a claimed prediction or distance parameter back to a quantity defined by the construction itself.

Axiom & Free-Parameter Ledger

0 free parameters · 1 axioms · 0 invented entities

The central claim rests on standard representation theory of SU(q) and the Knill-Laflamme conditions; no new free parameters or postulated entities are introduced in the abstract.

axioms (1)
  • domain assumption In the irreducible SU(q)-module Sym^4(C^q), the distance-two Knill-Laflamme conditions split into root and Cartan parts.
    Invoked to justify restricting to the even-entry occupation layer.

pith-pipeline@v0.9.0 · 5834 in / 1315 out tokens · 34918 ms · 2026-05-22T05:46:36.620137+00:00 · methodology

discussion (0)

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

Lean theorems connected to this paper

Citations machine-checked in the Pith Canon. Every link opens the source theorem in the public Lean library.

What do these tags mean?
matches
The paper's claim is directly supported by a theorem in the formal canon.
supports
The theorem supports part of the paper's argument, but the paper may add assumptions or extra steps.
extends
The paper goes beyond the formal theorem; the theorem is a base layer rather than the whole result.
uses
The paper appears to rely on the theorem as machinery.
contradicts
The paper's claim conflicts with a theorem or certificate in the canon.
unclear
Pith found a possible connection, but the passage is too broad, indirect, or ambiguous to say the theorem truly supports the claim.

Reference graph

Works this paper leans on

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

  1. [1]

    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

  2. [2]

    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

  3. [3]

    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

  4. [4]

    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

  5. [5]

    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

  6. [6]

    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

  7. [7]

    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

  8. [8]

    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

  9. [9]

    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

  10. [10]

    Permutation-invariant quantum codes with transversal generalized phase gates,

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

    work page 2025

  11. [11]

    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

  12. [12]

    Codes inW ∗-metric spaces: Theory and examples,

    C. J. Bumgardner, “Codes inW ∗-metric spaces: Theory and examples,” Ph.D. dissertation, University of California, Davis, 2011

    work page 2011

  13. [13]

    Quantum error detection and lie theory,

    I. Shors, “Quantum error detection and lie theory,” 2022, uC Davis Mathematics REU report. [Online]. Available: https://reu.math.ucdavis. edu/application/files/8316/7872/4883/shors-final.pdf

    work page 2022

  14. [14]

    Classical construction of quantum codes,

    R. Xu, “Classical construction of quantum codes,” 2022, uC Davis Mathematics REU report. [Online]. Available: https://reu.math.ucdavis. edu/application/files/3316/7929/5227/xu-report.pdf

    work page 2022

  15. [15]

    Quantum error correction beyond SU(2): Spin, bosonic, and permutation-invariant codes from convex geometry,

    A. Aydin, V . V . Albert, and A. Barg, “Quantum error correction beyond SU(2): Spin, bosonic, and permutation-invariant codes from convex geometry,”PRX Quantum, vol. 7, p. 010341, Feb 2026. [Online]. Available: https://link.aps.org/doi/10.1103/kx3b-4nrp

    work page doi:10.1103/kx3b-4nrp 2026

  16. [16]

    A theory of quantum error correction for permutation-invariant codes,

    Y . Ouyang and G. K. Brennen, “A theory of quantum error correction for permutation-invariant codes,” 2026. [Online]. Available: https://arxiv.org/abs/2602.13638

    work page arXiv 2026

  17. [17]

    Qudit-based quantum error- correcting codes from irreducible representations of SU(d),

    R. F. Uy and D. A. Gangloff, “Qudit-based quantum error- correcting codes from irreducible representations of SU(d),”Phys. Rev. A, vol. 112, p. 042402, Oct 2025. [Online]. Available: https://link.aps.org/doi/10.1103/6z3t-96t9

    work page doi:10.1103/6z3t-96t9 2025

  18. [18]

    Qutrit codes within representations of SU(3),

    X. Herbert, J. Gross, and M. Newman, “Qutrit codes within representations of SU(3),” 2023. [Online]. Available: https://arxiv.org/ abs/2312.00162

    work page arXiv 2023

  19. [19]

    Intrinsic quantum codes,

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

    work page arXiv 2026

  20. [20]

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

    I. Teixeira, “Orthogonal polynomials and the Macwilliams transform for permutation-invariant qudit codes,” 2026. [Online]. Available: https://arxiv.org/abs/2605.15372

    work page internal anchor Pith review Pith/arXiv arXiv 2026