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 range equality and products
Statement
For finite-dimensional density operators , For density operators on and on ,
Facts & Assumptions
Given: Nonzero finite-dimensional spaces and density operators on them.
Taking the fixed auxiliary space , root fidelity is the maximum absolute inner product of purifications (Fidelity Purification Characterization); the QC06 theorem proves this as part of its every- statement.
Root fidelity equals (Fidelity), the trace norm is a norm, and singular values of a tensor product are pairwise products of singular values (Every linear map between finite-dimensional real or complex inner product spaces admits a singular value decomposition, Trace Norm Duality And Norm Properties). The QC01 norm theorem body is present as a draft.
Density operators are nonnegative and have trace one (Density operator).
Cauchy–Schwarz bounds the absolute inner product of unit vectors by one, with equality exactly for linearly dependent vectors (Cauchy–Schwarz: , with equality exactly for dependent pairs).
On finite product spaces, is nonnegative and squares to : diagonalize both nonnegative factors in orthonormal eigenbases; the product basis has eigenvalues equal to products of their nonnegative eigenvalues, and tensor-map composition gives the square identity. Uniqueness of the nonnegative square root identifies it with (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, Ordered tensor registers, their inner product, and wire permutations, Tensor products of finitely many linear maps, Tensor maps preserve composition, identities, and adjoints, A non-negative operator has a unique non-negative square root).
The trace norm of a tensor product of finite-dimensional maps is the product of the trace norms (Trace norm of a tensor product).
Proof
The fidelity is nonnegative because it is a trace norm. Choose unit purifications attaining the maximum in [L1]; [F1] gives their overlap at most one, so . If , equality in [F1] makes the two purifying vectors scalar multiples of modulus one. Their partial traces are then equal, hence . Conversely, if , choose the same purification twice to obtain overlap one.
By [L2], exactly when , since a norm vanishes only at zero. The range of is , while the kernel of is . Thus the product is zero exactly when , which is the asserted orthogonality.
By [F3] and uniqueness of the nonnegative square root, . Tensor-map composition gives . Now [L3] makes the trace norm of this product the product of the two factor trace norms, which by the root-fidelity definition is .
Depends on
- Fidelity
- Fidelity Purification Characterization
- Every linear map between finite-dimensional real or complex inner product spaces admits a singular value decomposition
- Density operator
- 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
- A non-negative operator has a unique non-negative square root
- Trace Norm Duality And Norm Properties
- Cauchy–Schwarz: $|\langle x,y\rangle|\le\|x\|\,\|y\|$, with equality exactly for dependent pairs
- Tensor products of finitely many linear maps
- Ordered tensor registers, their inner product, and wire permutations
- Tensor maps preserve composition, identities, and adjoints
- Trace norm of a tensor product
Used by
Dependency tree · two levels
54 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)