Phys. Rev. A 56, 3470 - 3483 (1997)von Neumann capacity of noisy quantum channels |
C. Adami1,2,3 and N. J. Cerf1,3
1W. K. Kellogg Radiation Laboratory, California Institute of Technology, Pasadena, California 91125
2Computation and Neural Systems, California Institute of Technology, Pasadena, California 91125
3Institute for Theoretical Physics, University of California, Santa Barbara, California 93106
Received 15 October 1996; revised 2 June 1997
We discuss the capacity of quantum channels for information transmission and storage. Quantum channels have dual uses: they can be used to transmit known quantum states which code for classical information, and they can be used in a purely quantum manner, for transmitting or storing quantum entanglement. We propose here a definition of the von Neumann capacity of quantum channels, which is a quantum-mechanical extension of the Shannon capacity and reverts to it in the classical limit. As such, the von Neumann capacity assumes the role of a classical or quantum capacity depending on the usage of the channel. In analogy to the classical construction, this capacity is defined as the maximum von Neumann mutual entropy processed by the channel, a measure which reduces to the capacity for classical information transmission through quantum channels (the “Kholevo capacity”) when known quantum states are sent. The quantum mutual entropy fulfills all basic requirements for a measure of information, and observes quantum data-processing inequalities. We also derive a quantum Fano inequality relating the quantum loss of the channel to the fidelity of the quantum code. The quantities introduced are calculated explicitly for the quantum depolarizing channel. The von Neumann capacity is interpreted within the context of superdense coding, and an extended Hamming bound is derived that is consistent with that capacity.
©1997 The American Physical Society
URL: http://link.aps.org/abstract/PRA/v56/p3470
DOI: 10.1103/PhysRevA.56.3470
PACS: 03.65.Bz, 89.70.+c
[ Abstract | Previous article | Next article | Issue 5 ]


