§4.1, fidelity and trace-distance bounds (28)–(32)
OpenQAlgorithms.Papers.Independent.Intakenext100.P45.fidelityBoundsFor finite-dimensional densities , put , , and use the unsquared fidelity . The complete bounds are
If either state is pure, . These compare the operational Chernoff coefficient with standard state distinguishability measures.
import Definitions.Def_QAlgorithms_Papers_Independent_Intakenext100_P45
noncomputable section
namespace QAlgorithms.Papers.Independent.Intakenext100.P45
open QAlgorithms Filter
open scoped Matrix ComplexConjugate ComplexOrder ENNReal BigOperators Topology
open QAlgorithms.Papers.Independent.Information100.P07
(support positivePart positiveProjection IsProjection)
open QAlgorithms.Papers.Independent.Information100.P56 (IsLaw)
open QAlgorithms.Papers.Independent.Information100.P60 (Mat copies)
open QAlgorithms.Papers.Independent.Dependency50.P28 (logNonnegativeExtended relativeEntropy)
open QAlgorithms.Papers.Independent.Claimed50.P15 (positiveMatrixRpow)
attribute [local instance] Classical.propDecidable Classical.decEq
variable {I J : Type} [Fintype I] [DecidableEq I] [Fintype J] [DecidableEq J]
/-- arXiv:0708.4282v1, PDF pp.16,17: §4.1, fidelity and trace-distance bounds (28)–(32). -/
theorem fidelityBounds (rho sigma : Mat I)
(hrho : IsDensityMatrix rho) (hsigma : IsDensityMatrix sigma) :
let Q := chernoffInfimum rho sigma
let F := rootFidelity rho sigma
let T := traceDist rho sigma
Q ≤ (positiveMatrixRpow rho (1/2) * positiveMatrixRpow sigma (1/2)).trace.re ∧
(positiveMatrixRpow rho (1/2) * positiveMatrixRpow sigma (1/2)).trace.re =
traceNorm (positiveMatrixRpow rho (1/4) * positiveMatrixRpow sigma (1/2) * positiveMatrixRpow rho (1/4)) ∧
traceNorm (positiveMatrixRpow rho (1/4) * positiveMatrixRpow sigma (1/2) * positiveMatrixRpow rho (1/4)) ≤
traceNorm (positiveMatrixRpow rho (1/2) * positiveMatrixRpow sigma (1/2)) ∧
traceNorm (positiveMatrixRpow rho (1/2) * positiveMatrixRpow sigma (1/2)) = F ∧
(1-F)^2 ≤ T^2 ∧ T^2 ≤ 1-F^2 ∧ Q^2+T^2 ≤ 1 ∧
1-Real.sqrt (1-F^2) ≤ 1-T ∧ 1-T ≤ Q ∧ Q ≤ F ∧
F ≤ Real.sqrt (1-T^2) ∧ F^2 ≤ Q ∧
((densityIdempotence rho ∨ densityIdempotence sigma) → Q=F^2) := by sorry
end QAlgorithms.Papers.Independent.Intakenext100.P45
end
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
For every finite index type with decidable equality and every positive semidefinite complex matrices indexed by with trace one, define
All matrix powers and square roots here are defined by continuous functional calculus using the corresponding real functions; in particular, the powers at the endpoints of the infimum use . Then
and all the following inequalities hold:
If either or , then . The density hypotheses exclude an empty .
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.