title: Simple family of nonadditive quantum codes.
abstract: Most known quantum codes are additive, meaning the code 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 distance 2 nonadditive quantum codes for all odd block lengths n, that has a particularly simple form. Our codes detect single qubit errors (or correct single qubit erasures) while encoding a higher dimensional space than is possible with an additive code or, for n> or =11, any previous codes. We exhibit the encoding circuits and automorphism group for our codes as well.
authors.affiliation: IBM T.J. Watson Research Center, Yorktown Heights, New York 10598, USA. smolin@watson.ibm.com
authors.forename: John A
authors.initials: JA
authors.lastname: Smolin
authors.forename: Graeme
authors.initials: G
authors.lastname: Smith
authors.forename: Stephanie
authors.initials: S
authors.lastname: Wehner