Entropic bounds on coding for noisy quantum channels

Nicolas J. Cerf
Phys. Rev. A 57, 3330 – Published 1 May 1998
PDFExport Citation

Abstract

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) 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 nonzero. 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.

  • Received 11 July 1997

DOI:https://doi.org/10.1103/PhysRevA.57.3330

©1998 American Physical Society

Authors & Affiliations

Nicolas J. Cerf

  • W. K. Kellogg Radiation Laboratory, California Institute of Technology, Pasadena, California 91125
  • Information and Computing Technologies Research Section, Jet Propulsion Laboratory, Pasadena, California 91109
  • Center for Nonlinear Phenomena and Complex Systems, Université Libre de Bruxelles, 1050 Bruxelles, Belgium

References (Subscription Required)

Click to Expand
Issue

Vol. 57, Iss. 5 — May 1998

Reuse & Permissions
Access Options
Author publication services for translation and copyediting assistance advertisement

Authorization Required


×
×

Images

×

Sign up to receive regular email alerts from Physical Review A

Log In

Cancel
×

Search


Article Lookup

Paste a citation or DOI

Enter a citation
×