The additivity of the classical capacity of any memoryless quantum channel remains an open problem in quantum information theory. The Holevo-Schumacher-Westmoreland (HSW) theorem states that the classical capacity of a memoryless quantum channel Λ utilizing product state encoding is given by the formula,
for S(ω) the von Neumann entropy of the state ω.
Product state encoding is a form of block coding that takes n copies of a channel
and encodes the input message into a product state codeword
. The output from the block encoding is thus also a product state
. However, there is nothing stopping the sender encoding the message into states that are entangled across channels such that the input
and possibly the output
are entangled. The HSW theorem states that the capacity for input states that are product states for blocks of channels of size n, is thus,
where the ensemble of states
may be entangled across blocks of n channels.
Asymptotically, this leads to the expression for the classical capacity in regularized form,
It is straightforward to see that
. The additivity problem is then to prove (or disprove) the conjecture that
, giving a "single-letter" formula for the classical capacity of a memoryless quantum channel.

