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]
Subtract the two density operators. The difference is Hermitian with zero diagonal and off-diagonal entry . A matrix has eigenvalues , because its square is . Its two singular values are therefore both . By the definition of the trace norm,
For the intended real-overlap phase-flip channel, , giving
This vanishes for a computational basis state, since a phase flip then changes only an unobservable global phase. Its largest value at fixed is , attained when . The general formula remains correct even when the probabilistic premise of part 1 fails.
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.
Give its natural trace-class topology: differentiability means , with remainder small in trace norm. The Fredholm determinant is the continuous extension of finite-rank determinants; it is multiplicative by finite-rank approximation and satisfies
near zero. For example its exterior-power series bounds the remainder by , proving that estimate directly.
Factor . Multiplicativity and the preceding expansion give
The determinant is nonzero for invertible , so division yields the required logarithmic derivative. Differentiability only in the bounded-operator norm would not justify this trace formula; the specified topology is essential.
Split into strictly negative and strictly positive Fourier parts, and let , . The Toeplitz multiplication rule is when is coanalytic or is analytic. It follows directly because the discarded negative Fourier part cannot return to the Hardy space in those cases. Thus exponentiation within either subalgebra is exact, and
The constant terms cancel. If is the unilateral shift, and . The commutator is finite rank, with trace when and zero otherwise. For equal powers it is the projection onto the first basis vectors; for unequal powers its matrix has no diagonal entries. Its trace norm is bounded by . Smoothness of makes the weighted double coefficient sum finite, so the commutator series converges in trace norm and
Applying part (c) proves the Toeplitz exponential determinant identity
In particular the product is an invertible identity-plus-trace-class operator, so the determinant in the formula is well-defined.
For a finite-rank operator , define and its trace norm by
where are its nonzero singular values, counted with multiplicity. The finite-rank spectral theorem gives orthonormal systems with , where .
For every bounded operator ,
Choose the contraction taking to and vanishing on their orthogonal complement. It attains equality, so
This formula proves the triangle inequality and absolute homogeneity. Also , so vanishing of the trace norm forces . Thus it is a norm on the vector space of finite-rank operators.
The map , where , is a bounded linear map into the dual of this normed space. Its norm is at most . Rank-one tests give the reverse inequality: and , so taking unit vectors gives .
Conversely, let be a bounded linear functional for the trace norm. The sesquilinear form satisfies
The Riesz representation theorem gives a unique bounded operator with , and . Since every finite-rank operator is a finite sum of rank-one operators, linearity implies for every . Hence
The same identification extends to the completion, the trace-class operators. This is trace-class duality; completeness of the original finite-rank space is not required to identify its bounded dual.
Use the unsquared quantum fidelity convention in the question. For any matrix , its trace norm is : the two positive matrices have the same nonzero eigenvalues, namely the squared singular values. This follows directly from the singular value decomposition.
Set . Then and . Their positive square roots therefore have the same trace, proving
The argument also covers singular density operators, since zero singular values contribute zero.
Use the unsquared convention for quantum fidelity. For density operators on a common finite-dimensional Hilbert space,
Here is the trace norm, and all square roots are the positive operator square roots. The two displayed expressions agree because and its adjoint have the same singular values. This convention has ; some literature squares this quantity, but that convention is not used here.
For normalized pure states, the rank-one operator has a single nonzero singular value. Therefore
For any linear operator, the trace norm is , the sum of its singular values. For a Hermitian operator,
The Holevo–Helstrom theorem concerns minimum-error discrimination of two density operators . If their prior probabilities are and , the maximum success probability over all quantum measurements is
An optimal binary POVM declares on the positive spectral subspace of and declares on its negative spectral subspace; zero-eigenvalue vectors can be assigned either way. For equal priors the formula becomes .
For a symmetric matrix with simple largest eigenvalue and spectral gap , the Davis-Kahan curvature lemma says , where is its leading unit eigenvector. Applying this to a leading eigenvector of , the maximal Rayleigh quotient and duality of the operator norm and trace norm give ; the projector difference has matrix rank at most two. This is a rank-one eigenprojector perturbation bound.
Here has independent centered bounded upper-triangular entries, apart from symmetry. The spectral norm bound for a centered Bernoulli adjacency matrix gives . Taking and therefore gives, for the largest-eigenvalue estimator,
The printed argmin selects the wrong end of the spectrum. For a minimizing unit eigenvector , compare its Rayleigh quotient with any unit vector orthogonal to . This yields , and hence . Its mean projector error is at least , using . Along with sufficiently large even , the printed parameter restriction holds and this lower bound tends to , contradicting an error of order . Replace argmin by argmax, or negate the entire matrix before minimizing.
The absolute value of an operator, trace norm, and operator norm are respectively
The positive square root of an operator makes well defined. Its eigenvalues are the singular values of , so and .
Use the polar decomposition of a bounded operator , with the given unitary operator . In an orthonormal eigenbasis for ,
The operator norm assumption and unitarity imply . The triangle inequality therefore yields the required trace estimate:
Choosing attains equality, which also gives the finite-dimensional trace duality formula . A singular causes no difficulty: in a finite-dimensional square space the polar factor can be extended to a unitary operator on the complementary subspaces.
Write . Normalization says , and the Schmidt rank equals the matrix rank of . Its nonzero singular values are therefore with .
The overlap with the maximally entangled state is . The trace norm estimate of Q3(i), with test linear operator , followed by the Cauchy-Schwarz inequality, gives
For two pure states, the unsquared quantum fidelity is the absolute value of their overlap. Hence the maximally entangled overlap bound from Schmidt rank is
The bound is attained by . Thus uniform Schmidt coefficients on aligned basis pairs give the greatest possible overlap for that Schmidt rank.
For factorizations and , the Procrustes distance between covariance operators is the following infimum over unitary operators :
Unitary invariance of the Hilbert-Schmidt norm gives
The polar decomposition of a bounded operator and trace duality imply
where the last equality expresses the trace norm as the sum of the singular values. Taking the infimum proves
The Quantum de Finetti theorem says that the fixed- reduced density matrix of an exchangeable -particle state approaches
as . Finite versions bound the trace norm error by a constant of order . On a bipartite lattice, the corresponding two-sublattice form is a mixture
This is the mean-field ansatz from the quantum de Finetti theorem.
The bond energy is a linear functional of . A convex combination cannot have energy below its lowest product component, so it remains only to minimize
The Cauchy-Schwarz inequality gives , with equality for pure antiparallel vectors. This reproduces the Néel state and per bond found in part (a).
Yes. The limiting state saturates the de Finetti mean-field lower bound: the minimizing product state belongs to the allowed de Finetti mixture, and the finite-de-Finetti error tends to zero as . At finite the theorem gives only an approximation; entanglement and correlated fluctuations can lower the energy below the product-state value by corrections that vanish in the infinite-coordination limit.
For , the weighted difference of the two Werner–Holevo channels is
Thus the map is the transposition map divided by . The diamond norm of the transposition map and invariance of the trace norm under matrix transpose give
Substitution into the optimal-error formulas shows that an entangled quantum ancilla permits perfect discrimination, whereas every ancilla-free strategy has
For normalized pure states and , the trace distance and quantum fidelity satisfy
The last two expressions distinguish the unsquared quantum fidelity from the squared quantum fidelity. Identical pure states give , and orthogonal pure states give . The equality need not hold for mixed states; the Fuchs-van de Graaf inequalities give bounds in that case.
Brief proof: for two distinct pure states, their two-dimensional span contains the nonzero part of . This restriction has trace zero and determinant , hence eigenvalues . Its trace norm is twice the positive eigenvalue, giving trace distance . For identical pure states, directly.