Superadditivity of communication capacity using entangled inputs

We present a random construction of a pair of channels which gives, with non-zero probability for sufficiently large dimensions, a counterexample to the minimum output entropy conjecture. As shown by Shor, this implies a violation of the additivity conjecture for the classical capacity of quantum channels. The violation of the minimum output entropy conjecture is relatively small.