Pith. sign in

REVIEW

A simple family of nonadditive quantum codes

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv quant-ph/0701065 v2 pith:GZUSY4DG submitted 2007-01-11 quant-ph

classification quant-ph
keywords codesnonadditivequantumadditivefamilysimplewhileabelian
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
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.

Discussion (0). Continue with ORCID to comment.

Pith tools