Entropic bounds on coding for noisy quantum channels

Physics – Quantum Physics

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

20 pages RevTeX, 10 Postscript figures. Expanded Section II, added 1 figure, changed title. To appear in Phys. Rev. A (May 98)

Scientific paper

10.1103/PhysRevA.57.3330

In analogy with its classical counterpart, a noisy quantum channel is characterized by a loss, a quantity that depends on the channel input and the quantum operation performed by the channel. The loss reflects the transmission quality: if the loss is zero, quantum information can be perfectly transmitted at a rate measured by the quantum source entropy. By using block coding based on sequences of n entangled symbols, the average loss (defined as the overall loss of the joint n-symbol channel divided by n, when n tends to infinity) can be made lower than the loss for a single use of the channel. In this context, we examine several upper bounds on the rate at which quantum information can be transmitted reliably via a noisy channel, that is, with an asymptotically vanishing average loss while the one-symbol loss of the channel is non-zero. These bounds on the channel capacity rely on the entropic Singleton bound on quantum error-correcting codes [Phys. Rev. A 56, 1721 (1997)]. Finally, we analyze the Singleton bounds when the noisy quantum channel is supplemented with a classical auxiliary channel.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

Entropic bounds on coding for noisy quantum channels does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Entropic bounds on coding for noisy quantum channels, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Entropic bounds on coding for noisy quantum channels will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-399508

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.