A suMcient condition on concavity of the auxiliary function which appears in the random coding exponent as the lower bound of the qu'antum reliability function for general quantum states is noted.The validity of its suMcient condition is shown by some numerical computatlons.
The auxiliary function of a classical channel appears in two fundamental quantities, the random coding exponent and the sphere-packing exponent, which yield upper and lower bounds on the error probability of decoding, respectively. A crucial property of the auxiliary function is its concavity, and this property consequently leads to several important results in finite blocklength analysis. In this paper, we prove that the auxiliary function of a classical-quantum channel also enjoys the same concavity property, extending an earlier partial result to its full generality. We also prove that the auxiliary function satisfies the data-processing inequality, among various other important properties. Furthermore, we show that the concavity property of the auxiliary function enables a geometric interpretation of the random coding exponent and the sphere-packing exponent of a classical-quantum channel. The key component in our proof is an important result from the theory of matrix geometric means.
In information theory, the reliability function and its bounds, describing the exponential behavior of the error probability, are important quantitative characteristics of the channel performance. From a more general point of view, these bounds provide certain measures of distinguishability of a given set of classical states. In a previous paper, quantum analogs of the random coding and expurgation lower bounds for the case of pure signal states were introduced. Here we discuss the case of general quantum states, in particular, we prove the expurgation bound conjectured previously and find the quantum cutoff rate for arbitrary mixed signal states.