For density operators on the same finite-dimensional Hilbert space, quantum fidelity measures how close their quantum states are. This article uses the unsquared convention:
Each square root is the positive square root of an operator, and is the trace norm. Quantum fidelity is symmetric in its inputs; it is one exactly when , and zero exactly when , meaning that the support of a positive operator for one state is orthogonal to that for the other. Larger quantum fidelity means greater similarity. The separate squared quantum fidelity is . [ref]
For two normalized pure states, quantum fidelity is the magnitude of their inner product, . Thus compared with itself has , while and have . For , comparison with gives , , and trace distance by the pure-state trace distance and fidelity identity.
Why compare density operators rather than their entries? A change of coordinates should not make the same physical preparations look more or less alike. Unitary invariance of trace distance and fidelity makes quantum fidelity independent of a common basis choice. Multiplying a pure state vector by a global phase leaves its density operator unchanged, so its quantum fidelity with the original state is one. These features make quantum fidelity useful for checking whether quantum channels, state preparations, and Schumacher compression preserve a target quantum state.
The connection to Uhlmann's theorem supplies another beautiful interpretation: quantum fidelity is the largest absolute inner product between pure vectors obtained from a purification of a density operator for each state, using a sufficiently large common reference space. Uhlmann's 1976 paper extended transition probability to algebraic states, including those of a C-star algebra; for density operators its transition probability corresponds to our squared quantum fidelity. The measurement characterization of quantum fidelity gives a complementary description directly in terms of observable outcome statistics. [ref]
Nonnegativity of quantum relative entropy Created 2026-10-05 Updated 2026-10-14
For density operators, Klein's inequality gives , with equality exactly when . If the support of a positive operator is not contained in that of , the quantum relative entropy is .
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 .
Omit indices of probability zero. The support of a positive operator of every remaining lies within that of , because is a positive sum containing . Thus is finite.
First suppose , so all quantities are finite. Expand the trace definitions of quantum relative entropy:
Therefore Donald's identity is
If the support condition on fails, at least one positive-weight also fails it. The left side and the final term on the right are then , while the first right-hand sum remains finite. The equality is valid in this extended sense, without taking any undefined difference of infinities.
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.
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 .
Put . The rank-one dephasing is . If , positivity gives
so . The kernel of is exactly the span of these zero-probability basis vectors and is therefore contained in the kernel of . Taking orthogonal complements proves support inclusion under rank-one dephasing:
Here the support of a positive operator is the orthogonal complement of its kernel.
On that support, is diagonal in the measurement basis, giving
Consequently the relative-entropy identity for rank-one dephasing is
Klein's inequality gives , since both density operators have trace one. For singular , first restrict to where is positive definite, replace by , and let . The support inclusion ensures that the limit is finite. Thus
This proves entropy increase under nonselective projective measurement using Klein's inequality. Equality holds exactly when , so the original density operator was already diagonal in the chosen basis.
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 .
Let . When the relative entropies are finite, expanding their trace definitions gives
Thus Donald's identity is
For every , the support of a positive operator lies in that of , so the first sum on the right is finite in finite dimension. If the support of is not contained in the support of , at least one positive-weight also violates the support condition. Both sides of the identity are then . This extends the conclusion without subtracting infinite quantities.
If every allowed input density operator has support of a positive operator inside a subspace with orthogonal projector , completeness need only equal on that subspace. To define a measurement on the full Hilbert space, one can append when the original operators act only on the subspace. The added outcome has zero probability on supported inputs. The effects form a POVM; the operators themselves additionally specify state updates.