Entanglement-assisted capacity of a quantum channel and the reverse Shannon theorem

The entanglement-assisted classical capacity of a noisy quantum channel (C/sub E/) is the amount of information per channel use that can be sent over the channel in the limit of many uses of the channel, assuming that the sender and receiver have access to the resource of shared quantum entanglement, which may be used up by the communication protocol. We show that the capacity C/sub E/ is given by an expression parallel to that for the capacity of a purely classical channel: i.e., the maximum, over channel inputs /spl rho/, of the entropy of the channel input plus the entropy of the channel output minus their joint entropy, the latter being defined as the entropy of an entangled purification of /spl rho/ after half of it has passed through the channel. We calculate entanglement-assisted capacities for two interesting quantum channels, the qubit amplitude damping channel and the bosonic channel with amplification/attenuation and Gaussian noise. We discuss how many independent parameters are required to completely characterize the asymptotic behavior of a general quantum channel, alone or in the presence of ancillary resources such as prior entanglement. In the classical analog of entanglement-assisted communication - communication over a discrete memoryless channel (DMC) between parties who share prior random information - we show that one parameter is sufficient, i.e., that in the presence of prior shared random information, all DMCs of equal capacity can simulate one another with unit asymptotic efficiency.

[1]  Alexei E. Ashikhmin,et al.  Nonbinary quantum stabilizer codes , 2001, IEEE Trans. Inf. Theory.

[2]  Ashish V. Thapliyal,et al.  Entanglement-Assisted Classical Capacity of Noisy Quantum Channels , 1999, Physical Review Letters.

[3]  Benjamin Schumacher,et al.  A new proof of the quantum noiseless coding theorem , 1994 .

[4]  Hoi-Kwong Lo,et al.  Classical Communication Cost of Entanglement Manipulation: Is Entanglement an Interconvertible Resource? , 1999, quant-ph/9902045.

[5]  Toby Berger,et al.  Review of Information Theory: Coding Theorems for Discrete Memoryless Systems (Csiszár, I., and Körner, J.; 1981) , 1984, IEEE Trans. Inf. Theory.

[6]  E. Lieb,et al.  Proof of the strong subadditivity of quantum‐mechanical entropy , 1973 .

[7]  Aaas News,et al.  Book Reviews , 1893, Buffalo Medical and Surgical Journal.

[8]  C. H. Bennett,et al.  Unextendible product bases and bound entanglement , 1998, quant-ph/9808030.

[9]  G. Lindblad Quantum entropy and quantum measurements , 1991 .

[10]  Noga Alon,et al.  The Probabilistic Method , 2015, Fundamentals of Ramsey Theory.

[11]  Schumacher,et al.  Quantum data processing and error correction. , 1996, Physical review. A, Atomic, molecular, and optical physics.

[12]  Charles H. Bennett,et al.  Concentrating partial entanglement by local operations. , 1995, Physical review. A, Atomic, molecular, and optical physics.

[13]  M. Nielsen,et al.  Information transmission through a noisy quantum channel , 1997, quant-ph/9702049.

[14]  A. Wehrl General properties of entropy , 1978 .

[15]  Charles H. Bennett,et al.  Communication via one- and two-particle operators on Einstein-Podolsky-Rosen states. , 1992, Physical review letters.

[16]  Michal Horodecki,et al.  Binding entanglement channels , 1999, quant-ph/9904092.

[17]  C. Adami,et al.  VON NEUMANN CAPACITY OF NOISY QUANTUM CHANNELS , 1996 .

[18]  Schumacher,et al.  Quantum coding. , 1995, Physical review. A, Atomic, molecular, and optical physics.

[19]  Samuel L. Braunstein,et al.  Dense coding for continuous variables , 1999, quant-ph/9910010.

[20]  B. M. Terhal,et al.  QUANTUM CAPACITY IS PROPERLY DEFINED WITHOUT ENCODINGS , 1998 .

[21]  R. Werner,et al.  Evaluating capacities of bosonic Gaussian channels , 1999, quant-ph/9912067.

[22]  Peter W. Shor,et al.  Quantum Information Theory , 1998, IEEE Trans. Inf. Theory.

[23]  Charles H. Bennett,et al.  Teleporting an unknown quantum state via dual classical and Einstein-Podolsky-Rosen channels. , 1993, Physical review letters.

[24]  Thomas M. Cover,et al.  Elements of Information Theory , 2005 .

[25]  Alexander S. Holevo,et al.  The Capacity of the Quantum Channel with General Signal States , 1996, IEEE Trans. Inf. Theory.

[26]  Charles H. Bennett,et al.  Teleporting an unknown quantum state via dual classical and EPR channels , 1993 .

[27]  P. Shor,et al.  Unextendible Product Bases, Uncompletable Product Bases and Bound Entanglement , 1999, quant-ph/9908070.

[28]  J. Cirac,et al.  Irreversibility in asymptotic manipulations of entanglement. , 2001, Physical review letters.

[29]  C. King Additivity for unital qubit channels , 2001, quant-ph/0103156.

[30]  A. Furusawa,et al.  Teleportation of continuous quantum variables , 1998, Technical Digest. Summaries of Papers Presented at the International Quantum Electronics Conference. Conference Edition. 1998 Technical Digest Series, Vol.7 (IEEE Cat. No.98CH36236).

[31]  Schumacher,et al.  Classical information capacity of a quantum channel. , 1996, Physical review. A, Atomic, molecular, and optical physics.

[32]  Michael D. Westmoreland,et al.  Sending classical information via noisy quantum channels , 1997 .

[33]  R. Jozsa,et al.  A Complete Classification of Quantum Ensembles Having a Given Density Matrix , 1993 .

[34]  A. Holevo On entanglement-assisted classical capacity , 2001, quant-ph/0106075.