Pith. sign in

REVIEW

The multiplicative domain in quantum error correction

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 0811.0947 v1 pith:CWHQMOCU submitted 2008-11-06 quant-ph

The multiplicative domain in quantum error correction

classification quant-ph
keywords codesquantumcasechannelcorrectabledomainerrormultiplicative
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved
0 comments
read the original abstract

We show that the multiplicative domain of a completely positive map yields a new class of quantum error correcting codes. In the case of a unital quantum channel, these are precisely the codes that do not require a measurement as part of the recovery process, the so-called unitarily correctable codes. Whereas in the arbitrary, not necessarily unital case they form a proper subset of unitarily correctable codes that can be computed from properties of the channel. As part of the analysis we derive a representation theoretic characterization of subsystem codes. We also present a number of illustrative examples.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.