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

We develop a framework for constructing quantum error-correcting codes and logical gates for three types of spaces -- composite permutation-invariant spaces of many qubits or qudits, composite constant-excitation Fock-state spaces of many bosonic modes, and monolithic nuclear state spaces of atoms, ions, and molecules. By identifying all three spaces with discrete simplices and representations of the Lie group , we prove that many codes and their gates in  can be inter-converted between the three state spaces. We construct new code instances for all three spaces using classical  codes and Tverberg's theorem, a classic result from convex geometry. We obtain new families of quantum codes with distance that scales almost linearly with the code length  by constructing  codes based on combinatorial patterns called Sidon sets and utilizing their Tverberg partitions. This improves upon the existing designs for all the state spaces. We present explicit constructions of codes with shorter length or lower total spin/excitation than known codes with similar parameters, new bosonic codes with exotic Gaussian gates, as well as examples of short codes with distance larger than the known constructions.