Pith. sign in

REVIEW

Decoherence-Insensitive Quantum Communication by Optimal C^*-Encoding

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/0605235 v1 pith:NYQ5LVYL submitted 2006-05-29 quant-ph

Decoherence-Insensitive Quantum Communication by Optimal C^*-Encoding

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

The central issue in this article is to transmit a quantum state in such a way that after some decoherence occurs, most of the information can be restored by a suitable decoding operation. For this purpose, we incorporate redundancy by mapping a given initial quantum state to a messenger state on a larger-dimensional Hilbert space via a $C^*$-algebra embedding. Our noise model for the transmission is a phase damping channel which admits a noiseless or decoherence-free subspace or subsystem. More precisely, the transmission channel is obtained from convex combinations of a set of lowest rank yes/no measurements that leave a component of the messenger state unchanged. The objective of our encoding is to distribute quantum information optimally across the noise-susceptible component of the transmission when the noiseless component is not large enough to contain all the quantum information to be transmitted. We derive simple geometric conditions for optimal encoding and construct examples.

discussion (0)

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