For input dimension , an input of entropy gives output entropy and reference-output entropy . These follow from entropy of an orthogonal quantum mixture and purity of the input purification. Thus the quantum mutual information is , maximized at . The entanglement-assisted classical capacity is consequently bits per use; for a binary input it is .
For a memoryless quantum channel , successive uses are described by . Its entanglement-assisted classical capacity is the supremum of classical bits per use achievable with error tending to zero when sender and receiver may use unlimited preshared quantum entanglement, independent of the message. Only the channel is used to transmit the message.
For input state , choose a purification and set . The capacity formula is
Purifications differ only by an isometry on the reference, so this expression depends only on the input density matrix. The quantity optimized is quantum mutual information.
The binary quantum erasure channel sends a qubit to a qubit subspace plus an orthogonal erasure flag:
On the nonerased branch it transmits the entire state, including its coherences. Put . The entropy of an orthogonal quantum mixture gives
The reference-output state has two orthogonal branches:
The first branch is pure; the second has entropy . Thus and
A qubit has entropy at most one bit, with equality at . We conclude
The endpoint capacities are two and zero. As an operational check, superdense coding encodes four classical messages in one member of a shared Bell pair. A successful channel use lets the receiver identify the message; an erased qubit yields the flag. This induces a four-symbol classical erasure channel of capacity , agreeing with the entropy calculation.
Introduce an orthonormal classical-label basis and the classical-quantum state
Its reduced density operators are and . If are the eigenvalues of , the eigenvalues of are . Thus the entropy of an orthogonal quantum mixture is
where is the Shannon entropy. Apply the proved Subadditivity of Von Neumann entropy to and and cancel . This gives Concavity of Von Neumann entropy:
Zero-probability terms may simply be omitted. The equality condition from the preceding solution implies that equality holds precisely when all the positive-probability states are the same: the block equations follow from .
Write . The Holevo quantity is
where is Von Neumann entropy, with a consistent logarithm base. Attach an orthogonal classical label register to form the classical-quantum state
The entropy of an orthogonal quantum mixture gives
Here is the Shannon entropy of the classical label. Hence , where denotes quantum mutual information.
Let be the proposed quantum channel. Using its Kraus representation, define an linear isometry , since . This is a Stinespring representation. Apply it to , obtaining a state ; tracing out applies to every ensemble member. An linear isometry preserves nonzero eigenvalues and therefore Von Neumann entropy, so
Their difference is
The Strong subadditivity of Von Neumann entropy states that this expression is nonnegative for every tripartite state. Consequently
Thus the Holevo quantity under a quantum channel decreases because discarding the dilation environment cannot improve correlations with the classical label. The probabilities remain unchanged throughout.
Use logarithms to base two, so all Von Neumann entropies and Shannon entropies are measured in bits. Write the nonzero eigenvalues of as . Orthogonality of the supports makes the mixture a block diagonal matrix, with eigenvalues . Therefore
Each has trace one. Terms with zero probability or zero eigenvalue vanish under the convention . This proves the entropy of an orthogonal quantum mixture.