Simple Family of Nonadditive Quantum Codes
From MaRDI portal
Publication:3107752
Abstract: Most known quantum codes are additive, meaning the codespace can be described as the simultaneous eigenspace of an abelian subgroup of the Pauli group. While in some scenarios such codes are strictly suboptimal, very little is understood about how to construct nonadditive codes with good performance. Here we present a family of nonadditive quantum codes for all odd blocklengths, n, that has a particularly simple form. Our codes correct single qubit erasures while encoding a higher dimensional space than is possible with an additive code or, for n of 11 or greater, any previous codes.
Recommendations
- Two Infinite Families of Nonadditive Quantum Error-Correcting Codes
- Publication:4939165
- Nonadditive quantum error-correcting code
- A new description of the additive quantum codes
- Some families of quantum BCH codes
- Nonbinary quantum codes
- Nonbinary quantum stabilizer codes
- Nonbinary quantum Reed-Solomon codes
- Some families of optimal quantum codes derived from constacyclic codes
- New quantum codes from constacyclic and additive constacyclic codes
Cites work
Cited in
(8)- Non-stabilizer quantum codes from Abelian subgroups of the error group
- Nonadditive quantum error-correcting code
- Two Infinite Families of Nonadditive Quantum Error-Correcting Codes
- Non-Pauli observables for CWS codes
- Codeword stabilized quantum codes: algorithm and structure
- Inhomogeneous quantum codes. II: Non-additive case
- Permutationally invariant codes for quantum error correction
- scientific article; zbMATH DE number 1406138 (Why is no real title available?)
This page was built for publication: Simple Family of Nonadditive Quantum Codes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3107752)