How statement and proof provenance work
The first chip identifies the source of the statement or construction; the second identifies the source of its local proof or verification.
- Literature-sourced: the exact statement appears in a cited source; only wording and notation differ.
- AI-adapted: a semantically identical restatement of literature-sourced material, modulo indexing, notation, and boundary cases adopted by the library.
- AI-generated: a genuinely novel statement formulated by AI, with no source for the claim itself.
These labels describe origin, not correctness: citations and verification chips remain separate evidence.
Fidelity classical measurement minimum
Statement
For states on a nonzero finite-dimensional complex Hilbert space , let a finite POVM be a finite family of nonnegative operators summing to . Then The minimum is attained by a projective measurement with rank-one outcomes.
Facts & Assumptions
Given: and density operators on .
Taking the fixed auxiliary space , root fidelity is the maximum overlap of purifications on that common space (Fidelity Purification Characterization). The QC06 theorem proves this case as part of its every- statement.
A finite POVM consists of nonnegative effects summing to identity, and outcome probabilities are (Finite POVMs and their outcome law). The QC04 definition body is present as a draft.
Cauchy–Schwarz for the inner product gives (Cauchy–Schwarz: , with equality exactly for dependent pairs).
Density operators are nonnegative and have trace one (Density operator).
The positive square root is unique, and the root formula follows from the SVD trace-norm formula (A non-negative operator has a unique non-negative square root, The two root-fidelity trace expressions agree).
is compact in its finite matrix coordinates (Unitary Group Compact), and bounded sequences of matrix coordinates have convergent subsequences by finite-dimensional Heine–Borel (Heine-Borel in : with the Euclidean metric a subset of is compact if and only if it is closed and bounded, and the proof by bisection uses no choice principle; the same holds on the real line). The compactness theorem body is a current QC06 draft; the Heine–Borel supplier is published.
Partial trace is characterized by (Partial trace over a finite tensor factor, The partial trace is characterized by the trace pairing and is basis-independent); the QC02 definition and characterization theorem are present as drafts.
The finite trace norm is a norm and satisfies the triangle inequality (Trace Norm Duality And Norm Properties). For a fixed matrix shape , set . SVD gives , since each singular value is at most the square root of the sum of their squares and . Hence for same-shape matrices, proving the coordinate continuity needed below (Every linear map between finite-dimensional real or complex inner product spaces admits a singular value decomposition, Trace Norm).
Every finite-dimensional inner-product space has an orthonormal basis (Every finite-dimensional real or complex inner product space has an orthonormal basis).
A nonnegative endomorphism has an orthonormal eigenbasis with nonnegative eigenvalues (A non-negative operator is equivalently self-adjoint with nonnegative eigenvalues, a positive semidefinite matrix in an orthonormal basis, or an operator of the form S^*S).
The finite trace is the sum of diagonal entries; in an orthonormal coordinate basis, (The basis-independent trace of an endomorphism of a finite-dimensional vector space, The adjoint is characterised by , Rectangular matrix multiplication and the identity matrix , including zero-sized shapes).
A limit of nonnegative matrices is nonnegative because self-adjointness and each quadratic-form inequality pass to the coordinate limit (A non-negative operator is equivalently self-adjoint with nonnegative eigenvalues, a positive semidefinite matrix in an orthonormal basis, or an operator of the form S^*S).
Trace is cyclic for compatible finite-dimensional maps (For and , ).
Proof
Let be purifications attaining as in [L1]. For a finite POVM , put and . Since , the adjoint identity gives . By [L4], and . The triangle inequality and [F1] termwise give . Therefore every finite POVM overlap is at least .
For arbitrary , set and for . Both are positive definite. The root fidelity is continuous on density operators: if are density operators and , then [F5] and [F7] give . Thus the coordinate matrices are bounded. Every convergent subsequence has a nonnegative limit by [F6] and , so uniqueness in [L3] gives . If did not converge to , a subsequence staying a fixed positive distance away would have a convergent subsubsequence by [F2], contradicting that every such limit is . Applying this to both state sequences shows their square roots converge; their product converges by the finite matrix-product formula, and its trace norm converges by [L5]. Hence .
Suppose first that is positive definite. By [F4], choose an orthonormal eigenbasis of ; its eigenvalues are strictly positive by positive definiteness, so is defined by the reciprocal square roots in this basis. Define . Its quadratic form is nonnegative because it is the quadratic form of at , and direct multiplication gives . By [F4], choose an orthonormal eigenbasis of , with rank-one projections and eigenvalues . If , then , so the measurement overlap is by [L3] and [L6]. Thus a rank-one PVM attains the lower bound when is faithful.
Fix an orthonormal basis of by [F3], and identify with . Let be the rank-one projector onto its th basis vector. Define as ordered families for . Every ordered rank-one PVM has this form, since unit vectors spanning its mutually orthogonal one-dimensional ranges form an orthonormal basis. The map is continuous in matrix coordinates, so is compact by [F2]. For every , step 2.1 supplies a minimizing PVM in . For , let be the closure in of all such minimizing PVMs for . The are nonempty nested compact sets, so their intersection is nonempty; fix in it. The overlap function is continuous at every , since trace is a finite coordinate sum and scalar square root is continuous on . Given , choose a neighborhood of where differs from by less than , and choose so large that is inside its -neighborhood and, by step 1.2, for . Since , the definition of closure supplies a minimizing PVM in that neighborhood for some . For this pair, , so . As is arbitrary, . This gives an attaining rank-one PVM also in the singular case.
Step 1.1 bounds every finite POVM overlap below by , and step 3.1 exhibits a finite rank-one PVM whose overlap equals . This proves the stated minimum and attainment.
Depends on
- Fidelity
- Trace Norm
- Finite POVMs and their outcome law
- Fidelity Purification Characterization
- Partial trace over a finite tensor factor
- The partial trace is characterized by the trace pairing and is basis-independent
- A non-negative operator has a unique non-negative square root
- A non-negative operator is equivalently self-adjoint with nonnegative eigenvalues, a positive semidefinite matrix in an orthonormal basis, or an operator of the form S^*S
- Every linear map between finite-dimensional real or complex inner product spaces admits a singular value decomposition
- Density operator
- The two root-fidelity trace expressions agree
- Unitary Group Compact
- Heine-Borel in $\mathbb{R}^n$: with the Euclidean metric a subset of $\mathbb{R}^n$ is compact if and only if it is closed and bounded, and the proof by bisection uses no choice principle; the same holds on the real line
- Trace Norm Duality And Norm Properties
- Cauchy–Schwarz: $|\langle x,y\rangle|\le\|x\|\,\|y\|$, with equality exactly for dependent pairs
- Every finite-dimensional real or complex inner product space has an orthonormal basis
- The basis-independent trace of an endomorphism of a finite-dimensional vector space
- The adjoint $T^*:W\to V$ is characterised by $\langle Tv,w\rangle_W=\langle v,T^*w\rangle_V$
- Rectangular matrix multiplication and the identity matrix $I_n$, including zero-sized shapes
- For $A\in M_{m\times n}(F)$ and $B\in M_{n\times m}(F)$, $\operatorname{tr}(AB)=\operatorname{tr}(BA)$
Used by
- Fuchs Van De Graaf Theorem
- Full Rank Pair No Broadcasting Theorem
Dependency tree · two levels
98 results within two dependency steps of this one, each drawn at its shortest distance from it. An arrow runs from a result to what uses it, so the chart reads left to right and ends at this result, which carries a heavier outline. Every node is a link to that result. Click elsewhere on the chart to enlarge it.
Sources
- John Watrous, The Theory of Quantum Information (standard reference, not scraped)