Permutation-Invariant Quantum Codes with Transversal Generalized Phase Gates

Abstract

With respect to the transversal gate group (an invariant of quantum codes), we demonstrate that non-additive codes can outperform stabilizer codes. We do this by constructing spin codes that correspond to permutation-invariant multiqubit codes that can implement generalized phase gates transversally. Of particular note, we construct permutation-invariant quantum codes that implement a transversal $T$ gate using fewer qubits and with a better minimum distance than is possible with the best known stabilizer codes.

Changed title and abstract to more accurately reflect the contents of the paper. Changed to IEEE transactions formatting. Added more complete proofs of all major results. Added more references

References in corpus (8)

• Magic state distillation with low overhead
• Detecting multiparticle entanglement of Dicke states
• Magic state distillation in all prime dimensions using quantum Reed-Muller codes
• Universal transversal gates with color codes - a simplified approach
• Qudit versions of the qubit "pi-over-eight" gate
• Quantum Goethals-Preparata Codes
• A family of permutationally invariant quantum codes
• Breaking classical Lie groups to finite subgroups - an automated approach

Cited by in corpus (5)

• Fault-tolerant compiling of classically hard IQP circuits on hypercubes
• Classification of the Subgroups of the Two-Qubit Clifford Group
• Quantum error correction beyond $SU(2)$: spin, bosonic, and permutation-invariant codes from convex geometry
• Qudit encoding in Rydberg blockaded arrays of atoms
• Flexible Fault Tolerant Gate Gadgets