Minimal Permutation-Invariant Qudit Codes from Edge-Colorings of Complete Graphs
Fuente:
arXiv
Saved in:
| Main Authors: | , |
|---|---|
| Format: | Preprint |
| Published: |
2026
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866913152703135744 |
|---|---|
| author | Kubischta, Eric Teixeira, Ian |
| author_facet | Kubischta, Eric Teixeira, Ian |
| contents | 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$. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2605_22439 |
| institution | arXiv |
| publishDate | 2026 |
| record_format | arxiv |
| spellingShingle | Minimal Permutation-Invariant Qudit Codes from Edge-Colorings of Complete Graphs Kubischta, Eric Teixeira, Ian Quantum Physics Information Theory 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$. |
| title | Minimal Permutation-Invariant Qudit Codes from Edge-Colorings of Complete Graphs |
| topic | Quantum Physics Information Theory |
| url | https://arxiv.org/abs/2605.22439 |