We construct a new family of permutationally invariant codes that correct t Pauli errors for any t≥1 . We also show that codes in the new family correct quantum deletion errors as well as spontaneous decay errors. Our construction contains some of the previously known permutationally invariant quantum codes as particular cases, which also admit transversal gates. In many cases, the codes in the new family are shorter than the best previously known explicit permutationally invariant codes for Pauli errors and deletions. Furthermore, our new code family includes a new ((4,2,2)) optimal single-deletion-correcting code. As a separate result, we generalize the conditions for permutationally invariant codes to correct t Pauli errors from the previously known results for t=1 to any number of errors. For small t , these conditions can be used to construct new examples of codes by computer.
We construct a new family of permutationally in-variant codes that correct
tPauli errors for any
t⩾1. We also show that codes in the new family correct quantum deletion errors as well as spontaneous decay errors. Our construction contains some of the previously known permutationally invariant quantum codes as particular cases. In many cases, the codes in the new family are shorter than the best previously known explicit permutationally invariant codes for Pauli errors and deletions. This is an extended abstract of the preprint [1].
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≥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
Symn(Cq) for
n≤3. Hence four qudits are necessary and sufficient.
The construction has a simple representation-theoretic and combinatorial description. In the irreducible
SU(q)-module
Sym4(Cq), 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
Kq: for odd
q, they are organized by the midpoint rule, while for even
q, they are organized by a decomposition of
Kq 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
Kq.