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.
Partial trace contracts trace distance
Statement
Let be nonzero finite-dimensional complex inner-product spaces and let be density operators on . Then
Facts & Assumptions
Given: The finite-dimensional spaces, density operators , the partial trace over the second factor, and trace distance.
In ordered product orthonormal bases, , and the partial trace satisfies (Partial trace over a finite tensor factor, The partial trace is characterized by the trace pairing and is basis-independent).
The partial trace of a nonnegative operator is nonnegative and it preserves total trace, so it maps density operators to density operators (The partial trace preserves non-negativity and total trace).
Trace distance is one half of the trace norm of the state difference; the trace norm is the sum of singular values and equals (Trace Distance, Trace Norm, Trace Norm Spectral Formula).
A finite-dimensional Hermitian operator has an orthonormal eigenbasis with real eigenvalues (Complex spectral theorem: a normal endomorphism of a finite-dimensional complex inner product space has an orthonormal eigenbasis, and conversely).
acts by on the first factor and identity on the second; the product basis is orthonormal (Tensor products of finitely many linear maps, Ordered tensor registers, their inner product, and wire permutations, The product basis is orthonormal and tensor dimensions multiply).
The operator norm is the maximum of over unit vectors on a nonzero domain (The operator norm is zero on the zero domain and otherwise is max_{||v||=1} ||Tv||).
Cauchy–Schwarz gives (Cauchy–Schwarz: , with equality exactly for dependent pairs).
Proof
Put and . Both are Hermitian. For , this follows directly from [F1]: conjugating its entry and using gives . By [F2], the two partial traces of are density operators, so their trace distance is defined.
For any finite-dimensional Hermitian , diagonalize it in an orthonormal basis with eigenvalues . If and , then each diagonal entry is real and lies in : [F7] gives , where the middle inequality follows from [F6] by scaling a unit vector. Hence by [F3]–[F4]. Equality is attained by the self-adjoint contraction , so .
For every self-adjoint contraction on , [F4] gives an orthonormal eigenbasis of . If for a unit eigenvector, then [F7] and [F6] give . By [F5], the product basis diagonalizes with each eigenvalue repeated, so this tensor operator is a self-adjoint contraction as well. The pairing identity [F1] gives , whose absolute value is at most by step 1.2 applied on . Taking the maximum over in step 1.2 on yields .
Apply the trace-distance definition [F3] to and . Step 2.1 gives ; division by proves the assertion.
Depends on
- Partial trace over a finite tensor factor
- The partial trace is characterized by the trace pairing and is basis-independent
- The partial trace preserves non-negativity and total trace
- Trace Distance
- Trace Norm
- Trace Norm Spectral Formula
- Tensor products of finitely many linear maps
- Ordered tensor registers, their inner product, and wire permutations
- The product basis is orthonormal and tensor dimensions multiply
- Complex spectral theorem: a normal endomorphism of a finite-dimensional complex inner product space has an orthonormal eigenbasis, and conversely
- The operator norm is zero on the zero domain and otherwise is max_{||v||=1} ||Tv||
- Cauchy–Schwarz: $|\langle x,y\rangle|\le\|x\|\,\|y\|$, with equality exactly for dependent pairs
Used by
- Circuit-to-adiabatic simulation Theorem
Dependency tree · two levels
48 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, §3.1.1 (standard reference, not scraped)
- John Preskill, Quantum Computation, Chapter 2: Foundations I: States and Ensembles (standard reference, not scraped)