Squared-fidelity variation is bounded by sine distance
OpenQAlgorithms.Papers.Independent.Intakenext100.P97.fidelity_variationAll states are positive semidefinite, trace-one matrices, including pure and rank-deficient states. Write for squared Uhlmann fidelity, , and .
For any three density operators on the same finite-dimensional system,
This controls changes in fidelity with a fixed reference state, including equality and orthogonality of and .
import Definitions.Def_QAlgorithms_Papers_Independent_Intakenext100_P97
noncomputable section
open scoped Matrix ComplexConjugate
namespace QAlgorithms.Papers.Independent.Intakenext100.P97
open QAlgorithms.Papers.Independent.Information100.P67
(squaredFidelity sineDistance receiverChannel)
open QAlgorithms.Papers.Independent.Dependency50.P48 (densityPower)
/-- PDF p.2, §II, Lemma 1, Eq. (5). Absolute-value bars are visible
in the PDF; `F` is squared fidelity, not the root fidelity. -/
theorem fidelity_variation {d : ℕ} (chi omega rho : Matrix (Fin d) (Fin d) ℂ)
(hchi : IsDensityMatrix chi) (homega : IsDensityMatrix omega)
(hrho : IsDensityMatrix rho) :
|squaredFidelity chi rho - squaredFidelity omega rho| ≤ sineDistance chi omega := by sorry
end QAlgorithms.Papers.Independent.Intakenext100.P97
end
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
For every natural number and every three positive semidefinite complex matrices , each of trace , define
The theorem asserts
Here matrix square roots are those supplied by real continuous functional calculus. No distinctness assumption is imposed. Although is quantified over, its trace- hypotheses cannot be satisfied.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.