Key points are not available for this paper at this time.
We simplify the derivation of the Holevo upper bound on the maximum information extractable from a quantum communication channel. This simplification leads to upper and lower bounds for binary channels, both of which depend explicitly on the message ensemble.
Fuchs et al. (Mon,) studied this question.