Put . The state is well defined for , with eigenvalues . The first state is pure and has zero Von Neumann entropy, so the exact difference is
This is the entropy of a binary diagonal qubit mixture. Its trace distance from the pure state is , not . An explicit elementary upper bound follows from :
At zero the limit is zero. For small , the sharp exact answer behaves as , displaying the logarithmic continuity of entropy near a pure state.
Let . Positivity and normalization of the density operator imply and . The completely dephasing channel produces
which is already a spectral decomposition. Its Von Neumann entropy is therefore
The quantum output entropy is exactly the Shannon entropy of the basis-measurement probabilities, including possible zero eigenvalues via .
Dilate the second quantum channel by an isometry , and set . Its marginal is the final output. Isometry invariance of Von Neumann entropy gives and . The difference between the two values of coherent information is therefore
Nonnegativity follows from Strong subadditivity of Von Neumann entropy. This proves the data-processing inequality for coherent information:
The dilated state here need not be pure. The proof uses only isometry invariance and strong subadditivity, so it applies even when the first channel has already entangled the input with its own discarded environment.
By spectral decomposition, the Von Neumann entropy is the Shannon entropy of the eigenvalues:
Throughout, logarithms have base two, so the Von Neumann entropy and Shannon entropy are measured in bits. The continuous convention includes zero eigenvalues.
Use the Schmidt decomposition of the bipartite pure state:
The two reduced density matrices, obtained by partial trace, are
Their nonzero eigenvalues are identical, even if the two ambient dimensions differ. Zero eigenvalues contribute no Von Neumann entropy, so
This common Von Neumann entropy is the entanglement entropy of the bipartite pure state.
Take a purification of a density operator of . Apply Strong subadditivity of Von Neumann entropy to the reduced state on , with the conditioning system:
Complementary subsystems of a pure state have the same Von Neumann entropy, by the Schmidt decomposition. Therefore and . Substitution gives
This is weak monotonicity of quantum entropy. The purification of a density operator is only a proof device; no purity assumption is imposed on .
Choose an orthonormal basis of the joint -dimensional Hilbert space whose first vector is the given purification of a density operator . Apply rank-one dephasing to in this basis, and denote the resulting diagonal probabilities by . Their first entry is
The preceding entropy increase under nonselective projective measurement and entropy bound with one prescribed probability yield
Therefore the quantum Fano inequality is
The quantity is the entanglement fidelity of on ; it is already a squared overlap, so it is , rather than , that enters the binary entropy. The argument is an instance of the entropy bound from overlap with a pure state in dimension . At the output is the original pure state and its Von Neumann entropy is zero. For the system is trivial and the same zero-entropy conclusion holds without evaluating .
Write and for the classical quantum registers and . By the quantum mutual information formula , expanding the right-hand side of the quantum mutual information balance identity gives
All Von Neumann entropies here are evaluated in .
We use three facts: quantum mutual information is nonnegative by nonnegativity of quantum relative entropy; a local quantum channel cannot increase it by data processing for quantum mutual information; and the quantum mutual information of a classical-quantum state is its ensemble's Holevo quantity. Write for the Holevo capacity, the supremum of the output Holevo quantity over finite input ensembles.
The marginal is an output ensemble for , with inputs . Consequently . Also is obtained from by a quantum channel on which retains and prepares from . Hence
To bound the latter even for entangled states , exhibit the conditional input ensemble after a local measurement. Set
when ; zero-weight outcomes can be omitted. The numerator is a positive operator, its trace is , and the sum to one. Thus
This is a classical-quantum state with an output ensemble for , so . Combining these bounds with yields
The last step takes the supremum over all input ensembles on . The left-hand channel direction is , as established in part (i); the printed in the last inequality is a typographical reversal. Independent product ensembles also give the reverse inequality, so this proves Holevo-capacity additivity for entanglement-breaking channels.
Use logarithms to base two, so Von Neumann entropy and quantum relative entropy are measured in bits. For density operators ,
The quantum relative entropy formula applies when the support of a positive operator is contained in that of ; otherwise . Use in the Von Neumann entropy formula.
The binary density operator is diagonal with eigenvalues . Its Von Neumann entropy is the binary entropy:
The two diagonal density operators commute, so their quantum relative entropy is
A term with zero numerator has value zero; a positive numerator and zero denominator give . In particular, , whereas or gives .
Memorylessness means that the ensemble's average density operator is . Its spectral decomposition is
The product eigenvalues give
Zero eigenvalues contribute zero to the Von Neumann entropy and are excluded from logarithmic typicality tests.
The quantum typical subspace is the span of eigenvectors whose eigenvalues satisfy
Its orthogonal projection selects precisely the classical typical set for the eigenvalue distribution . The typical-set cardinality bounds and the weak law of large numbers therefore give
for any fixed and all sufficiently large .
Assume no previously shared entanglement. Alice's encoded ensemble lives in a Hilbert space of dimension . Its Holevo quantity satisfies
using nonnegativity of Von Neumann entropy and the maximum entropy of a quantum state. The data-processing inequality for quantum relative entropy implies for the transmission quantum channel. Finally, the Holevo bound applied to Bob's quantum measurement gives
This argument also works when the output system has larger dimension than the input. Prior shared entanglement changes the communication resource: superdense coding can transmit two classical bits per sent qubit, so the absence of that resource is part of this bound's setting.
Write a qubit density operator in Bloch vector form, , with . The quantum depolarizing channel maps to , so its output eigenvalues are . The output Von Neumann entropy is minimized on pure inputs, where it equals .
For any input ensemble, its output Holevo quantity is at most the maximum qubit entropy minus this minimum output entropy:
Equality is attained by two equiprobable orthogonal pure inputs: their average output is , while each output has the minimum entropy. Thus
This uses the question's retention parameter ; in the usual convex-mixture range, . The expression also holds throughout the full completely positive qubit range , since .
The supplied additivity of Holevo capacity gives . The Holevo-Schumacher-Westmoreland theorem expresses the unassisted classical capacity of a quantum channel as the regularized Holevo capacity, so
Therefore entangled inputs across channel uses cannot increase this classical capacity.
The two-sided eternal black hole is dual to the thermofield double state
Tracing out the left CFT gives
Thus the geometric period is the boundary inverse temperature, and is the Von Neumann entropy , equivalently the entanglement entropy between the two CFTs.
The modular Hamiltonian of this thermal state is
For any first-order state variation with ,
This is the first law of entanglement entropy.