Information Theory: Coding Theorems for Discrete Memoryless Systems
Information Theory: Coding Theorems for Discrete Memoryless Systems
The capacity of the quantum channel with general signal states
IEEE Transactions on Information Theory
Coding theorem and strong converse for quantum channels
IEEE Transactions on Information Theory
Strong converse to the quantum channel coding theorem
IEEE Transactions on Information Theory
General formulas for capacity of classical-quantum channels
IEEE Transactions on Information Theory
Information Theory, Combinatorics, and Search Theory
| Hi-index | 754.84 |
We determine the capacity of compound classical-quantum channels. As a consequence, we obtain the capacity formula for the averaged classical-quantum channels. The capacity result for compound channels demonstrates, as in the classical setting, the existence of reliable universal classical-quantum codes in scenarios where the only a priori information about the channel used for the transmission of information is that it belongs to a given set of memoryless classical-quantum channels. Our approach is based on a universal classical approximation of the quantum relative entropy which in turn relies on a universal hypothesis testing result.