A. S. Holevo
Published 2002-11-26, updated 2003-01-04Version 2
In this paper we fill the gap in previous works by proving the formula for entanglement-assisted capacity of quantum channel with additive constraint (such as bosonic Gaussian channel). The main tools are the coding theorem for classical-quantum constrained channels and a finite dimensional approximation of the input density operators for entanglement-assisted capacity. The new version contains improved formulation of sufficient conditions under which suprema in the capacity formulas are attained.
Comments: Extended version of paper presented at Quantum Informatics Symposium, Zvenigorod, 1-4.10.2002
Majorization ladder in bosonic Gaussian channels
Entanglement-assisted capacity of a quantum channel and the reverse Shannon theorem
Entanglement-Assisted Capacity of Quantum Multiple-Access Channels
