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.
Qutrit codes within representations of su(3)
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
citation-role summary
background 1
citation-polarity summary
fields
quant-ph 2years
2026 2verdicts
UNVERDICTED 2roles
background 1polarities
background 1representative citing papers
Finite subgroups of SU(d) can serve as both dynamical decoupling groups and generators of quantum error-correcting codes in qudit systems.
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.
-
Dynamical decoupling and quantum error correction with SU(d) symmetries
Finite subgroups of SU(d) can serve as both dynamical decoupling groups and generators of quantum error-correcting codes in qudit systems.