Permutation-Invariant Quantum Codes with Transversal Generalized Phase Gates
arXiv:2310.17652 · doi:10.1109/TIT.2024.3487964
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 gate using fewer qubits and with a better minimum distance than is possible with the best known stabilizer codes.
arXiv commentChanged 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 (26)
- A Theory of Quantum Error-Correcting Codes
- 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
- Deterministic Preparation of Dicke States
- Qudit versions of the qubit "pi-over-eight" gate
- Permutation-invariant quantum codes
- Preparation of Dicke States in an Ion Chain
- Codes and Protocols for Distilling , controlled-, and Toffoli Gates
- Encoding a qubit in a spin
- On Optimality of CSS Codes for Transversal
- A Divide-and-Conquer Approach to Dicke State Preparation
- The disjointness of stabilizer codes and limitations on fault-tolerant logical gates
- Short-Depth Circuits for Dicke State Preparation
- Semi-Clifford operations, structure of hierarchy, and gate complexity for fault-tolerant quantum computation
- Error Correction of Quantum Reference Frame Information
- Preparing Dicke states in a spin ensemble using phase estimation
- A Family of Quantum Codes with Exotic Transversal Gates
- Quantum Goethals-Preparata Codes
- Geometric pathway to scalable quantum sensing
- Multispin Clifford codes for angular momentum errors in spin systems
- A family of permutationally invariant quantum codes
- Towers of generalized divisible quantum codes
- Breaking classical Lie groups to finite subgroups - an automated approach
- On Groups in the Qubit Clifford Hierarchy
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 : spin, bosonic, and permutation-invariant codes from convex geometry
- Qudit encoding in Rydberg blockaded arrays of atoms
- Flexible Fault Tolerant Gate Gadgets