Pith. sign in

REVIEW

Quantum Error Correcting Codes From The Compression Formalism

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/0511101 v2 pith:GR5K4Q3Z submitted 2005-11-10 quant-ph math.FAmath.OA

Quantum Error Correcting Codes From The Compression Formalism

classification quant-ph math.FAmath.OA
keywords codeserrorquantumchannelscompressioncorrectionformalismhilbert
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved
0 comments
read the original abstract

We solve the fundamental quantum error correction problem for bi-unitary channels on two-qubit Hilbert space. By solving an algebraic compression problem, we construct qubit codes for such channels on arbitrary dimension Hilbert space, and identify correctable codes for Pauli-error models not obtained by the stabilizer formalism. This is accomplished through an application of a new tool for error correction in quantum computing called the ``higher-rank numerical range''. We describe its basic properties and discuss possible further applications.

discussion (0)

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