A family of permutationally invariant quantum codes

Abstract

We construct a new family of permutationally invariant codes that correct $t$ Pauli errors for any $t\ge 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.

v3: Accepted to Quantum. This is the published version of the paper, formatted in the style of the journal

References in corpus (13)

• From Classical to Quantum Shannon Theory
• Bosonic Quantum Codes for Amplitude Damping
• Permutation-invariant quantum codes
• Preparation of Dicke States in an Ion Chain
• Encoding a qubit in a spin
• msolve: A Library for Solving Polynomial Systems
• Transversal Clifford gates on folded surface codes
• Permutation-invariant constant-excitation quantum codes for amplitude damping
• Super-Golden-Gates for PU(2)
• Quantum storage in quantum ferromagnets
• A Family of Quantum Codes with Exotic Transversal Gates
• Single Quantum Deletion Error-Correcting Codes
• Truncated channel representations for coupled harmonic oscillators

Cited by in corpus (10)

• Quantum Codes from Twisted Unitary $t$-groups
• Symmetric quantum states: a review of recent progress
• Permutation-Invariant Quantum Codes with Transversal Generalized Phase Gates
• Class of codes correcting absorptions and emissions
• Degenerate quantum erasure decoding
• Robust projective measurements through measuring code-inspired observables
• Quantum error correction beyond $SU(2)$: spin, bosonic, and permutation-invariant codes from convex geometry
• Measurement-free code-switching for low overhead quantum computation using permutation invariant codes
• Flexible Fault Tolerant Gate Gadgets
• Qudit encoding in Rydberg blockaded arrays of atoms