On converse bounds for classical communication over quantum channels

Publication Type:
Journal Article
Citation:
IEEE Transactions on Information Theory, 2019, 65 (7), pp. 4609 - 4619
Issue Date:
2019-07-01
Filename Description Size
On converse bounds for classical communication over quantum channels.pdfAccepted manuscript455.31 kB
Adobe PDF
Full metadata record
© 1963-2012 IEEE. We explore several new converse bounds for classical communication over quantum channels in both the one-shot and asymptotic regimes. First, we show that the Matthews-Wehner meta-converse bound for entanglement-Assisted classical communication can be achieved by activated, no-signaling assisted codes, suitably generalizing a result for classical channels. Second, we derive a new efficiently computable meta-converse on the amount of classical information unassisted codes can transmit over a single use of a quantum channel. As applications, we provide a finite resource analysis of classical communication over quantum erasure channels, including the second-order and moderate deviation asymptotics. Third, we explore the asymptotic analogue of our new meta-converse, the \Upsilon-information of the channel. We show that its regularization is an upper bound on the classical capacity, which is generally tighter than the entanglement-Assisted capacity and other known efficiently computable strong converse bounds. For covariant channels, we show that the \Upsilon-information is a strong converse bound.
Please use this identifier to cite or link to this item: