For a positive-definite Hermitian operator and a unit vector , the weights form a probability distribution. Scalar logarithmic concavity bounds their average of by the logarithm of their average of . Positive semidefinite operators follow by a limiting convention. Using the eigenbasis of a density operator gives , where is the spectrum of and the diagonal of in that basis. This yields nonnegativity of quantum relative entropy without commutativity.
Klein's inequality Created 2026-10-05 Updated 2026-10-06
For positive-definite Hermitian matrices , Klein's inequality gives
with equality exactly when . To prove it, let be their eigenvalues and their orthonormal eigenvectors. The weights have row and column sums one. The difference between the two sides is
by the scalar logarithm inequality . Equality requires whenever , implying . Limits extend the result to positive semidefinite matrices with the appropriate support condition. Applying it to trace-one matrices proves nonnegativity of quantum relative entropy.
Maximum entropy of a quantum state Created 2026-10-05 Updated 2026-10-06
On a -dimensional Hilbert space, the Von Neumann entropy is maximized uniquely by . Indeed, nonnegativity of quantum relative entropy gives
with equality exactly when .
True: quantum entropy is subadditive. Write . Positivity ensures the support of lies in that of . Indeed, if , then ; all summands are nonnegative, so for every . Thus annihilates , and similarly the kernel from the other factor.
On the resulting support, . Using the defining property of the partial trace and nonnegativity of quantum relative entropy proved in part (i),
Hence
Equality holds exactly for the product state . This proves Subadditivity of Von Neumann entropy directly.
The concavity inequality is true, but its printed equality condition is false. At equality always holds, even for distinct states; for example take and . The correct statement on is
For , entropy is therefore strictly concave.
We give the matrix inequality needed for the proof. Define the quantum relative entropy if the support of is contained in that of , and otherwise. Diagonalize the two states with eigenvalues , and put . Each row and column of sums to one. The elementary scalar inequality
follows from , with equality exactly at ; use limits at zero. Consequently
Equality forces whenever . Hence every eigenvector of is also a -eigenvector with eigenvalue , so . Conversely identical states give zero relative entropy. This proves nonnegativity of quantum relative entropy and its equality condition, including states with zero eigenvalues under the support convention.
Now set . For its support contains both component supports. Direct expansion gives
Since both coefficients are positive, equality holds exactly when both component states equal , equivalently . At either endpoint the mixture has only one component and equality is automatic. This proves the corrected strict concavity of Von Neumann entropy.
For a density matrix on a -dimensional Hilbert space, its Von Neumann entropy, in bits, is
where the are its eigenvalues and . Each summand is nonnegative, proving , with equality exactly when one eigenvalue is one and the rest zero, namely for a pure state.
We first prove the nonnegativity of quantum relative entropy needed below. Diagonalize with eigenvalues and eigenvectors , and with eigenvalues and eigenvectors . Put and . Each row of sums to one. Concavity of the ordinary logarithm gives . Consequently
The final Gibbs inequality follows directly from . Support failure gives ; zero eigenvalues can otherwise be handled by restriction or regularization. Equality requires and equality in the logarithm inequality on every positive-weight row. Thus is a eigenvector of eigenvalue wherever . The remaining diagonal entries of vanish and positivity makes the remaining rows and columns zero. Hence equality holds exactly when .
Taking gives , proving
The lower equality is attained exactly by pure states and the upper exactly by the maximally mixed state .
For , each positive-weight state has support contained in that of . Expanding the quantum relative entropy gives
This proves Concavity of Von Neumann entropy, with equality precisely when every positive-weight is the same state.
For the upper entropy bound for a quantum mixture, diagonalize each component, , and set . Form the rectangular matrix whose columns are . Then , while the Gram matrix has diagonal . The two matrices have the same nonzero eigenvalues: and map corresponding positive-eigenvalue eigenspaces isomorphically. Thus .
If there are columns, let , with . Then
All the summands have the same Von Neumann entropy. The just-proved concavity therefore implies . Finally,
We have proved both requested bounds:
For the upper equality, strictness in the concavity argument forces to be diagonal. Its entries between two positive-weight component eigenvectors then force those vectors to be orthogonal. Thus upper equality holds exactly when the supports of the positive-weight component states are mutually orthogonal. In that case their classical label is perfectly distinguishable, explaining the extra bits.
Let a density operator on a Hilbert space have the spectral decomposition
Introduce an auxiliary Hilbert space with an orthonormal basis containing vectors , and set
This vector has norm one. Its partial trace is
This explicitly constructs a purification of a density operator. The same construction works for an arbitrary trace-class density operator: its nonzero eigenvalues form a finite or countable summable family, and the displayed vector converges in the Hilbert space norm. The entropy inequality below is understood with finite Von Neumann entropies, avoiding undefined differences of infinities.
Apply this construction with to obtain a joint pure state on . The Schmidt decomposition across , and respectively gives
Now apply Subadditivity of Von Neumann entropy to the reduced density matrices on and :
These inequalities say and . Replacing by proves the Araki–Lieb inequality:
The subadditivity used here concerns the actual reduced density operators, rather than statistical independence. In particular it follows from nonnegativity of quantum relative entropy, since
and similarly for . Thus no independence assumption on the purification of a density operator is needed.
Use base-two logarithms, so Von Neumann entropy is measured in bits, and set . Write for the quantum relative entropy, the quantity denoted in the paper. It is unless the support of a positive operator lies within that of .
We first establish nonnegativity of quantum relative entropy, including its equality condition. Let and , and suppose the support condition holds. Put . Concavity of the scalar logarithm gives
Terms with have zero weight here. Working first with natural logarithms, the inequality yields
since the sum to at most . Equality forces for every positive-weight eigenvector, no remaining weight of outside their span, and equality in the logarithm's strict concavity. The latter makes each an eigenvector of with eigenvalue . Thus exactly when .
For the bipartite density operator,
Indeed, a projector onto the kernel of , tensored with , has zero expectation in . Positivity implies that annihilates its range: . The same argument applies to . Hence the quantum relative entropy below is finite. On this support,
Using the partial trace to evaluate the two local terms gives
This proves Subadditivity of Von Neumann entropy:
The proof also identifies equality exactly with the product state .
Fix paired orthonormal bases in the two -dimensional Hilbert spaces. A maximally entangled state is
It is normalized, and the partial traces of its rank-one density operator are . Thus all its Schmidt coefficients are and its entanglement entropy is . No pure bipartite state of these dimensions can have larger entanglement entropy: nonnegativity of quantum relative entropy applied to a reduced state and gives . Hence it is maximally entangled.
The unread measurement is the pinching map , a nonselective projective measurement. Its output is block diagonal and commutes with each , so also commutes with the projectors on its support.
First the quantum relative entropy is finite. If lies in the kernel of , positivity gives
Every summand is zero; summing gives . Thus , equivalently .
The block-diagonal logarithm obeys on this support. Cyclicity of the trace therefore gives
Consequently the relative entropy of a pinched state is exactly the entropy increase:
By the proved nonnegativity of quantum relative entropy and its equality condition,
Equivalently, equality holds exactly when all off-diagonal blocks for already vanish, or when commutes with every measurement projector. This argument proves the equality condition even when the projectors are degenerate and the states singular.
Use base-two logarithms, so entanglement entropy is measured in bits. Write for the binary entropy, with . Taking a partial trace over any two parties removes the off-diagonal terms: the two traced strings are orthogonal. Consequently all three one-party reduced density matrices of the first pure state are
Each division into two groups is one party versus the other two. The Schmidt coefficients are and , so the entanglement entropy across each of , and is . For the second pure state, set : every one-party reduced density matrix is , and all three entanglement entropies are one bit.
For every pair , the first pure state instead gives the reduced density matrix
This is a separable quantum state, explicitly a convex combination of two product states. Its relative entropy of entanglement is therefore zero: in , choose to attain zero, while nonnegativity of quantum relative entropy excludes a negative value. The same argument with equal weights applies to the second pure state. Thus
The pairwise density matrices contain classical correlations, despite the entanglement of the global pure state; discarding a party loses the coherence between its two branches.
The entanglement entropy of independent source copies across any cut is , whereas copies of the target GHZ state have entanglement entropy . Average monotonicity of pure-state entanglement entropy under LOCC gives for exact successful forward branches. In a reversible asymptotic conversion the reverse direction similarly prevents a first-order deficit, since . For asymptotically faithful outputs, a continuity bound for quantum conditional entropy with trivial conditioning changes these inequalities only by . Hence the reversible leading-order rate is
The zero pairwise relative entropies of entanglement are consistent with this conversion: no independent pairwise resource has to be supplied or removed.
There is a qualification to the literal finite-block formulation in the source. For , the Schmidt rank of the exact state of source copies is , whereas target GHZ states have Schmidt rank . Every refined LOCC branch acts by a product of local linear operators and cannot increase this Schmidt rank. For , the displayed rate has for sufficiently large blocks when , so an exact successful reverse conversion is impossible, irrespective of its claimed probability. The exact dilution obstruction from Schmidt rank is avoided in the usual asymptotic formulation by allowing outputs approaching the desired pure state. The leading-order rate above and the exact forward protocol below remain valid; neither establishes the source's stronger exact round-trip claim. At the two states are identical. At or , the source is a known product state, the rate is zero, and local preparation supplies any desired number of source copies.
For probability distributions and on a finite alphabet, their classical relative entropy in bits is
A zero- term contributes zero, including when ; a term with and makes the result . In that infinite case nonnegativity is immediate. Otherwise on the support of . For every , : the function has derivative and its minimum zero at . Apply this with to obtain
The last inequality uses normalization of . Thus . Equality requires wherever and no -mass outside that support, hence occurs precisely when .
For density matrices, use
when the support of a positive operator is contained in that of , and set it to otherwise. The data-processing inequality for quantum relative entropy states that for any quantum channel ,
Thus the relative entropy of the two output states cannot exceed that of the inputs.
For the states with a classical flag, omit indices of weight zero. On a positive-weight block, the matrix logarithms obey
on the relevant supports. The logarithms of cancel. Taking the trace block by block therefore gives the relative entropy of classically flagged states:
If support inclusion fails in a positive-weight block, both sides are infinite. A zero-weight block makes no contribution, even if its unweighted relative entropy is infinite.
Tracing out the flag is a quantum channel with operators , since . It sends the two flagged states to and . Applying the data-processing inequality for quantum relative entropy to this partial trace proves joint convexity of quantum relative entropy:
For a bipartite state, set and . Its quantum mutual information is
where is the Von Neumann entropy. The support of lies in . To justify this when marginals are singular, let project onto . Then ; positivity implies . Applying the same argument on proves the claimed support inclusion.
On that support, product eigenvectors show
The definition of the partial trace therefore gives
Consequently .
For completeness, nonnegativity of quantum relative entropy also follows from the classical proof above. Diagonalize in a basis , with eigenvalues , and put . These are two classical probability distributions. Scalar concavity of the logarithm applied to the spectral weights of gives whenever and support inclusion holds. Hence
The support-failure case is again infinite. Applying this to the product of the marginals proves without requiring an additional entropy inequality.
Using base-two logarithms, define the quantum conditional entropy by
The Subadditivity of Von Neumann entropy, , immediately gives .
For the lower bound, purify by an auxiliary system . Complementary subsystems of a pure state have the same nonzero reduced-state eigenvalues, by the Schmidt decomposition. Hence and . Applying Subadditivity of Von Neumann entropy to gives
Rearranging yields . This is the relevant side of the Araki–Lieb inequality, here derived using purification.
Finally the maximum entropy of a quantum state gives . For example, this follows directly from
by nonnegativity of quantum relative entropy. Combining the two bounds proves
Both signs can be attained: a maximally mixed independent of has the positive extreme, while a maximally entangled state with a sufficiently large has the negative extreme.
Let be the pinching map determined by the projectors, and put . This is a nonselective projective measurement; its projectors are its Kraus operators. We will prove the exact relative entropy of a pinched state identity.
First the support of is contained in that of . Indeed, if lies in the kernel of , positivity gives
Every summand is zero. Since , also , and thus is in the kernel of . Therefore the logarithm of may be used on its support without an infinite relative-entropy term.
The operator is block diagonal, so each commutes with on that support. Cyclicity of the trace gives
Expand the quantum relative entropy:
Its nonnegativity now proves the entropy increase under nonselective projective measurement:
The equality case in nonnegativity of quantum relative entropy says equality holds exactly when . Equivalently,
Thus equality means the state already has no coherence between distinct measurement blocks. It need not be diagonal inside a block of rank greater than one.
The quantum relative entropy is when the support of a positive operator is contained in that of , and otherwise. Write spectral decompositions and , and set .
The weights sum to one. Concavity of the scalar logarithm gives the diagonal logarithm concavity bound
For , support inclusion removes overlaps with zero eigenvalues of ; alternatively take a positive regularization and pass to the limit. The two diagonal vectors and are probability distributions. Therefore
This proves nonnegativity of quantum relative entropy without assuming the states commute. Equality in the strict logarithmic concavity condition makes each occupied an eigenvector of ; classical equality gives and no weight outside the support, hence equality occurs exactly for .
Use Klein's inequality, or equivalently nonnegativity of quantum relative entropy. First check the support needed for the logarithm. If , positivity gives for every ; the corresponding row and column vanish. Thus support inclusion under rank-one dephasing gives , and the logarithms may be evaluated on this support.
Since is diagonal in the dephasing basis,
The relative-entropy identity for rank-one dephasing follows:
Klein's inequality gives . Therefore
Equality holds precisely when , meaning that the input was already diagonal in the chosen basis. This quantifies why rank-one dephasing removes coherence without reducing the entropy.
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.
By Donald's identity, the objective equals
The nonnegativity of quantum relative entropy makes the last term at least zero, with equality exactly when . Hence the unique minimizing density operator is the ensemble average and
For the classical-quantum state , its marginal on has entropy , its marginal on is , and its joint entropy is . Substituting in the definition of quantum mutual information gives
This is the relative-entropy barycenter of a quantum ensemble: the average state minimizes mean distinguishability from the ensemble. Its minimal value is exactly the Holevo quantity.
For any tripartite density operator, expanding the three quantum mutual information terms in Von Neumann entropy gives . This algebraic identity allows separate bounds on two information contributions, while nonnegativity of quantum relative entropy allows the last term to be dropped in an upper bound.
The ensemble average uniquely minimizes over density operators . Donald's identity separates this objective into a constant plus , and nonnegativity of quantum relative entropy proves the claim. The minimum is the Holevo quantity , equivalently the quantum mutual information of the associated classical-quantum state.