Strong converse exponent for classical-quantum channel coding

From MaRDI portal



Abstract: We determine the exact strong converse exponent of classical-quantum channel coding, for every rate above the Holevo capacity. Our form of the exponent is an exact analogue of Arimoto's, given as a transform of the Renyi capacities with parameters alpha>1. It is important to note that, unlike in the classical case, there are many inequivalent ways to define the Renyi divergence of states, and hence the R'enyi capacities of channels. Our exponent is in terms of the Renyi capacities corresponding to a version of the Renyi divergences that has been introduced recently in [M"uller-Lennert, Dupuis, Szehr, Fehr and Tomamichel, J. Math. Phys. 54, 122203, (2013)], and [Wilde, Winter, Yang, Commun. Math. Phys. 331, (2014)]. Our result adds to the growing body of evidence that this new version is the natural definition for the purposes of strong converse problems.


The exact strong converse exponent of classical-quantum channel coding is determined for every rate above the Holevo capacity. This form of the exponent is an exact analogue of Arimoto's, given as a transform of the Rényi capacities with parameters \(\alpha>1\). It is important to note that, unlike in the classical case, there are many inequivalent ways to define the Rényi divergence of states, and hence the Rényi capacities of channels. Suggested exponent is in terms of the Rényi capacities corresponding to a version of the Rényi divergences that has been introduced recently in Müller-Lennert et al. The structure of the paper is as follows. In Section II, the necessary mathematical preliminaries is summarized. Section III is devoted to Rényi divergences. The new contribution here is the investigation of the properties of the \(D_{\alpha}^b\) divergences. Section IV is devoted to overview of the different notions of mutual information and capacity formulas derived from Rényi divergences. In Section V, after an overview of the problem of classical-quantum channel coding a lower bound on the strong converse exponent is given. In Sections V C--V D was shown that this lower bound is also an upper bound. Finally, in Section VI, the main results for classical-quantum channels are applied to obtain the exact strong converse exponent for some classes of quantum channels.



Cites work


Cited in
(33)








This page was built for publication: Strong converse exponent for classical-quantum channel coding

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2408555)