Common-qubit trace-distance and root-fidelity inequality
OpenQAlgorithms.Papers.Independent.Intakenext100.P32.lemma1_common_qubitLet and be positive trace-class operators of trace one on a complex Hilbert space . Suppose both supports are contained in one common subspace of complex dimension at most two. Write and for trace distance and unsquared root fidelity. Then
This strengthens the general trace-distance lower bound for a common qubit support. Pure and coincident states are included, as are states with a zero Bloch vector.
import Definitions.Def_QAlgorithms_Papers_Independent_Intakenext100_P32
noncomputable section
namespace QAlgorithms.Papers.Independent.Intakenext100.P32
open QAlgorithms.Papers.Independent.Support50.P44
(IsHilbertDensity hilbertFidelity hilbertTraceNorm)
variable {H : Type*} [NormedAddCommGroup H] [InnerProductSpace ℂ H] [CompleteSpace H]
/-- PDF p.4, Lemma 1; proof in the appendix, PDF pp.10--11.
Fidelity is unsquared root fidelity; trace distance is HALF the trace norm.
Pure states, coincident states and zero Bloch vectors are included. -/
theorem lemma1_common_qubit
{I : Type*} (basis : HilbertBasis I ℂ H) (rho sigma : H →L[ℂ] H)
(hrho : IsHilbertDensity basis rho) (hsigma : IsHilbertDensity basis sigma)
(hsupport : CommonQubitSupport rho sigma) :
1 - hilbertFidelity basis rho sigma ^ 2 ≤
hilbertTraceNorm basis (rho - sigma) / 2 := by sorry
end QAlgorithms.Papers.Independent.Intakenext100.P32
end
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
Let be a complex Hilbert space, let be any index type, and let be a Hilbert basis of . For an operator , write , and call trace class here when there exist sequences , indexed by , such that is summable and for every . Suppose are continuous complex-linear operators that are trace class, positive, and satisfy . Suppose also that both ranges lie in one finite-dimensional complex subspace of dimension at most two. Define
where square roots use continuous functional calculus and operator products mean composition. Then
There is no countability assumption on .
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.