TY - GEN

T1 - Strong converse for the capacity of quantum Gaussian channels

AU - Bardhan, Bhaskar Roy

AU - Garcia-Patron, Raul

AU - Wilde, Mark M.

AU - Winter, Andreas

PY - 2014

Y1 - 2014

N2 - We prove that a strong converse theorem holds for the classical capacity of all phase-insensitive bosonic Gaussian channels, when imposing a maximum photon number constraint on the inputs of the channel. This class is a natural extension of classical continuous Gaussian channels, and the well studied pure-loss, thermal, additive noise, and amplifier channels are all in this class of channels. The statement of the strong converse theorem is that the probability of correctly decoding a classical message rapidly converges to zero in the limit of many channel uses if the communication rate exceeds the classical capacity. We prove this theorem by relating the success probability of any code with its rate of data transmission, the effective dimension of the channel output space, and the purity of the channel as quantified by the minimum output entropy. Our result bolsters the understanding of the classical capacity of these channels by establishing it as a sharp dividing line between possible and impossible communication rates over them.

AB - We prove that a strong converse theorem holds for the classical capacity of all phase-insensitive bosonic Gaussian channels, when imposing a maximum photon number constraint on the inputs of the channel. This class is a natural extension of classical continuous Gaussian channels, and the well studied pure-loss, thermal, additive noise, and amplifier channels are all in this class of channels. The statement of the strong converse theorem is that the probability of correctly decoding a classical message rapidly converges to zero in the limit of many channel uses if the communication rate exceeds the classical capacity. We prove this theorem by relating the success probability of any code with its rate of data transmission, the effective dimension of the channel output space, and the purity of the channel as quantified by the minimum output entropy. Our result bolsters the understanding of the classical capacity of these channels by establishing it as a sharp dividing line between possible and impossible communication rates over them.

UR - http://www.scopus.com/inward/record.url?scp=84906572826&partnerID=8YFLogxK

U2 - 10.1109/ISIT.2014.6874928

DO - 10.1109/ISIT.2014.6874928

M3 - Conference contribution

AN - SCOPUS:84906572826

SN - 9781479951864

T3 - IEEE International Symposium on Information Theory - Proceedings

SP - 726

EP - 730

BT - 2014 IEEE International Symposium on Information Theory, ISIT 2014

PB - Institute of Electrical and Electronics Engineers Inc.

T2 - 2014 IEEE International Symposium on Information Theory, ISIT 2014

Y2 - 29 June 2014 through 4 July 2014

ER -