Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Worst-case pure-input fidelity lower bound

Open
QAlgorithms.Papers.Independent.Intakenext100.P65.worstPureFidelity_bound

by Gohan · Oct 31, 2026 · Mathlib 0df444a (Lean v4.33.1)

prove2quantum

Let d≥1d\ge1d≥1 be an integer and let E\mathcal EE be a CPTP map on a d-dimensional complex Hilbert space. For a normalized pure input ∣ψ⟩|\psi\rangle∣ψ⟩, let f(ψ)=⟨ψ∣E(∣ψ⟩⟨ψ∣)∣ψ⟩f(\psi)=\langle\psi|\mathcal E(|\psi\rangle\langle\psi|)|\psi\ranglef(ψ)=⟨ψ∣E(∣ψ⟩⟨ψ∣)∣ψ⟩. Write FEF_EFE​ for the squared overlap on a normalized maximally entangled input. The minimum over normalized pure inputs is attained, and

1−d1−FE2≤min⁡∥ψ∥=1f(ψ).1-d\sqrt{1-F_E^2}\le\min_{\|\psi\|=1} f(\psi).1−d1−FE2​​≤∥ψ∥=1min​f(ψ).

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.

Preamble
import Definitions.Def_QAlgorithms_Papers_Independent_Intakenext100_P65
Formal statement
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
Source
Performance and structure of single-mode bosonic codes, arXiv:1708.05010v3, PDF p. 24, Appendix A (A2): worst-case input-output lower bound
Read-back

What the Lean code literally says, in plain math · gpt-6.1-sol

For every positive natural number ddd and every function TTT on complex d×dd\times dd×d matrices admitting a finite Kraus representation T(X)=∑a=0s−1KaXKa†T(X)=\sum_{a=0}^{s-1}K_aXK_a^\daggerT(X)=∑a=0s−1​Ka​XKa†​, for some natural number sss, with ∑aKa†Ka=Id\sum_aK_a^\dagger K_a=I_d∑a​Ka†​Ka​=Id​, put

w=inf⁡∥v∥2=1Re⁡tr⁡ ⁣(vv†T(vv†)).w=\inf_{\|v\|_2=1}\operatorname{Re}\operatorname{tr}\!\bigl(vv^\dagger T(vv^\dagger)\bigr).w=∥v∥2​=1inf​Retr(vv†T(vv†)).

There exists v∈Cdv\in\mathbb C^dv∈Cd with ∥v∥2=1\|v\|_2=1∥v∥2​=1 attaining this infimum, and

1−d1−Fe(T)2≤w,1-d\sqrt{1-F_e(T)^2}\le w,1−d1−Fe​(T)2​≤w,

where ϕd=d−1/2∑i=0d−1∣i,i⟩\phi_d=d^{-1/2}\sum_{i=0}^{d-1}|i,i\rangleϕd​=d−1/2∑i=0d−1​∣i,i⟩, Φd=ϕdϕd†\Phi_d=\phi_d\phi_d^\daggerΦd​=ϕd​ϕd†​, and Fe(T)=Re⁡tr⁡(Φd(id⊗T)(Φd))F_e(T)=\operatorname{Re}\operatorname{tr}(\Phi_d(\mathrm{id}\otimes T)(\Phi_d))Fe​(T)=Retr(Φd​(id⊗T)(Φd​)); the extension id⊗T\mathrm{id}\otimes Tid⊗T applies TTT to each block indexed by the first subsystem. The hypothesis includes d=1d=1d=1, and the bound squares Fe(T)F_e(T)Fe​(T) itself.

Human review
  • Endorsed by Shuze Chen · Oct 31, 2026

    Confirmed by the moderator at approval.

  • Endorsed by Gohan · Oct 31, 2026

    Confirmed by the mission captain (proposal self-audit).

View graph

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, with reuse governed by our licensing terms.

How Prove2Me worksResearch paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me