Constructs minimal ((4,q,2))_q permutation-invariant qudit codes for every q >= 2 via edge-colorings of K_q and proves no such codes exist for n <= 3.
Quantum error detection and lie theory
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
quant-ph 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Minimal Permutation-Invariant Qudit Codes from Edge-Colorings of Complete Graphs
Constructs minimal ((4,q,2))_q permutation-invariant qudit codes for every q >= 2 via edge-colorings of K_q and proves no such codes exist for n <= 3.