Quantum Information, Quantum Computing.
information implies the additivity of Minimum Output Entropy, and vice versa. Now, let’s consider two random channels: Our goal is to prove their non-additivity: Let’s see how to achieve this goal! First, we apply this tensor-product channel to a maximally entangled state: That is: According to