A note on random coding bounds for classical-quantum channels

Abstract

A modified derivation of achievability results in classical-quantum channel coding theory is proposed, which has, in our opinion, two main benefits over previously used methods: it allows to (i) follow in a simple and clear way how binary hypothesis testing relates to channel coding achievability results, and (ii) derive in a unified way all previously known random coding achievability bounds on error exponents for classical and classical-quantum channels.

Partially supported by the Italian Ministry of Education under grant PRIN 2015 D72F1600079000.