Worst-case pure-input fidelity lower bound
OpenQAlgorithms.Papers.Independent.Intakenext100.P65.worstPureFidelity_boundLet be an integer and let be a CPTP map on a d-dimensional complex Hilbert space. For a normalized pure input , let . Write for the squared overlap on a normalized maximally entangled input. The minimum over normalized pure inputs is attained, and
The factor d is outside the square root, and the displayed square of the already squared-overlap channel fidelity is preserved. This is the source's deliberately loose bound, without a sharper substituted constant.
import Definitions.Def_QAlgorithms_Papers_Independent_Intakenext100_P65
noncomputable section
namespace QAlgorithms.Papers.Independent.Intakenext100.P65
open MeasureTheory Filter
open QAlgorithms.Papers.Independent.Frontier18.P14 (displacementEntry)
open QAlgorithms.Papers.Independent.Dependency50.P40 (outputFirstChoi)
open scoped ComplexConjugate Matrix Topology
attribute [local instance] Classical.propDecidable
attribute [local instance] Classical.decEq
/-- PDF p.24 (A2): retain the printed loose constant and square of F_E. -/
theorem worstPureFidelity_bound (d : ℕ) (hd : 0 < d)
(T : Superop (Fin d) (Fin d)) (hT : IsChannel T) :
(∃ v : EuclideanSpace ℂ (Fin d), ‖v‖ = 1 ∧
effectProb (pureDensity v) (T (pureDensity v)) = worstPureFidelity d T) ∧
1 - (d : ℝ) * Real.sqrt (1 - (QuditFidelity.entanglementFidelity d hd T) ^ 2) ≤
worstPureFidelity d T := by sorry
end QAlgorithms.Papers.Independent.Intakenext100.P65
end
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
For every positive natural number and every function on complex matrices admitting a finite Kraus representation , for some natural number , with , put
There exists with attaining this infimum, and
where , , and ; the extension applies to each block indexed by the first subsystem. The hypothesis includes , and the bound squares itself.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.