A simple family of nonadditive quantum codes
classification
🪐 quant-ph
keywords
codesnonadditivequantumadditivefamilysimplewhileabelian
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.