For two pure states of overlap , a quantum channel attempts to turn copies into copies. Let be the failure probability of the all-copies projector test on input . The pure-state trace distance and fidelity identity, trace-distance contraction under quantum channels, pure-target upper bound on trace distance and triangle inequality give the displayed strictly positive gap . Hence , and for positive priors , weighted Cauchy-Schwarz inequality gives . No positive state-by-state bound holds: preparing one candidate perfectly makes its own conditional failure probability zero.
When two density operators are commuting elements, choose a common orthonormal eigenbasis and write , . Their quantum fidelity becomes the classical overlap of the two probability distributions, while their trace distance becomes total variation distance:
This follows by computing the positive square root of an operator entry by entry in the common eigenbasis. For the qubit mixed states and ,
The two contributions to quantum fidelity are about and . In contrast, the chance that two independent computational basis measurements, one on each preparation, print the same label is . That particular event has a specified probability; neither nor is that probability.
Figure 1.
Commuting mixed-state probabilities, square-root overlap contributions to unsquared fidelity F, squared fidelity Fsq, and trace distance D
. Details.
Here trace distance means an equal-prior quantum state discrimination success of by the Holevo–Helstrom theorem. Measuring in the common computational basis and guessing on outcome zero and on outcome one achieves . Also : the pure-state trace distance and fidelity identity is an equality for pure states, rather than a formula for arbitrary mixed states.
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]
For all finite-dimensional density operators, including pure states and mixed states, the unsquared quantum fidelity and trace distance obey
In the squared quantum fidelity convention this is . The bounds translate a high quantum fidelity into a small operationally meaningful trace distance. If with , then ; if , then . The upper bound is attained by the pure-state trace distance and fidelity identity. For the fidelity of commuting mixed states example, the bounds read . [ref]
There is a necessary distinction between a failure bound averaged over the unknown state, a worst-case bound, and a separate bound for each candidate state. The last interpretation is false: a forger can discard the inputs and always prepare . If the actual state is , every authenticity test passes with probability one. The meaningful uniform statement concerns worst-case failure, or average failure under any fixed prior giving both states positive probability. The PDF does not specify that prior; the argument below gives an explicit bound for either interpretation.
Put . Any unconditional strategy producing output qubits, including ancillas, adaptive measurement in quantum measurements and correlated outputs, is a quantum channel . Its inputs and ideal outputs are the density operators
The projective measurements on the different banknotes commute, and their all-pass effect is exactly . Therefore the probability of at least one rejection, conditional on input , is
This remains true for entangled outputs; no independence of their individual test outcomes is assumed.
Use trace distance . The pure-state trace distance and fidelity identity gives
For completeness, two pure-state projectors differ by a matrix with nonzero eigenvalues , which proves this identity. Also the pure-target upper bound on trace distance gives . To see the mixed-state step, write and use convexity of the trace norm followed by the Cauchy-Schwarz inequality:
Finally, trace-distance contraction under quantum channels gives . This follows from : the adjoint channel is positive and unital, so its image of any effect is still an effect.
The triangle inequality now yields
Thus the cloning failure bound from trace-distance contraction is
and in particular . For positive priors , another Cauchy-Schwarz inequality gives
so the average rejection probability satisfies
For equal priors, one may take ; the same choice is a strict lower bound on worst-case rejection. This proves a quantitative version of the no-cloning theorem for the bank's all-pass test. It concerns an unconditional attempt: heralded success cannot be postselected while omitting failed attempts from the accounting.
Write and . A pure-state density matrix is a rank-one orthogonal projector, so and
Taking its square root and trace yields the unsquared quantum fidelity
Use unitary invariance of trace distance and fidelity to choose a basis of the span of the two quantum states in which and , with and . Choosing state-vector phases to make the coefficients nonnegative does not change either density matrix. On that span,
Its eigenvalues are and , with zero eigenvalues on the orthogonal complement. The positive square root of therefore has two eigenvalues , so the trace distance is . Thus the pure-state trace distance and fidelity identity is
Identical pure quantum states give ; orthogonal pure quantum states give . If the span is one-dimensional, the identical-state result follows directly, so no second basis vector is required. This formula uses the unsquared fidelity convention in the paper; if fidelity denotes squared overlap instead, the square inside the formula is omitted.
Compare the qubit pure state
with , using the computational basis. Its Bloch vector is : it follows a meridian of the Bloch sphere from the north pole through to the south pole . The inner product with is , nonnegative on this interval. Consequently quantum fidelity, squared quantum fidelity, and trace distance are
At the triple is ; at it is ; at it is . The angle between the Bloch vectors is , while the quantum fidelity uses its half-angle. The pure-state trace distance and fidelity identity becomes the familiar relation .
Figure 1.
A Bloch sphere meridian and the corresponding unsquared fidelity F, squared fidelity Fsq, and trace distance D relative to the north-pole state
. Details.
For equal prior probabilities, the Holevo–Helstrom theorem gives optimal quantum state discrimination success . Along this meridian it rises from to one, with at . This connects the geometric trace distance to the best possible decision from a single preparation; it is a different measurement task from the target-acceptance probability defining squared quantum fidelity.