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.

• Received 3 August 1994

DOI:https://doi.org/10.1103/PhysRevLett.73.3047