Prove2Me
Navigate
DiscoverCollectionsFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

Supplement II, Eqs.(125)–(129): optical Choi fidelity

Open
QAlgorithms.Papers.Independent.Intakethird100.P49.optical_choi_fidelity

by Gohan · Nov 1, 2026 · Mathlib 0df444a (Lean v4.33.1)

prove2quantum

Let 0≤η≤10\le\eta\le10≤η≤1 and let the actual real image-mode overlap satisfy −1≤δ≤1-1\le\delta\le1−1≤δ≤1. Set η±=(1±δ)η/2\eta_\pm=(1\pm\delta)\eta/2η±​=(1±δ)η/2. The coherent vacuum/one-photon channels E±:2→3\mathcal E_\pm:2\to3E±​:2→3 send ∣0⟩|0\rangle∣0⟩ to output vacuum and the surviving ∣1⟩|1\rangle∣1⟩ to η+∣+⟩±η−∣−⟩\sqrt{\eta_+}|+\rangle\pm\sqrt{\eta_-}|-\rangleη+​​∣+⟩±η−​​∣−⟩, with vacuum loss probability 1−η1-\eta1−η. Their anti-Bell Choi states, in reference-first order, are

ρ±=1+η2∣Ψ±⟩⟨Ψ±∣+1−η2∣0,0⟩⟨0,0∣,\rho_\pm=\frac{1+\eta}{2}|\Psi_\pm\rangle\langle\Psi_\pm|+\frac{1-\eta}{2}|0,0\rangle\langle0,0|,ρ±​=21+η​∣Ψ±​⟩⟨Ψ±​∣+21−η​∣0,0⟩⟨0,0∣,

where ∣Ψ±⟩=(∣1,0⟩+η+∣0,+⟩±η−∣0,−⟩)/1+η|\Psi_\pm\rangle=(|1,0\rangle+\sqrt{\eta_+}|0,+\rangle\pm\sqrt{\eta_-}|0,-\rangle)/\sqrt{1+\eta}∣Ψ±​⟩=(∣1,0⟩+η+​​∣0,+⟩±η−​​∣0,−⟩)/1+η​. Both channels are CPTP and

F(ρ+,ρ−)=1−η+∣1+δη∣2=1−η(1−δ)2.F(\rho_+,\rho_-)=\frac{1-\eta+|1+\delta\eta|}{2}=1-\frac{\eta(1-\delta)}2.F(ρ+​,ρ−​)=21−η+∣1+δη∣​=1−2η(1−δ)​.

The same fidelity holds for canonical normalized Choi states, since a common reference XXX changes Bell to anti-Bell. This gives an exact optical overlap, including full loss and vanishing mode separation.

Preamble
import Definitions.Def_QAlgorithms_Papers_Independent_Intakethird100_P49
Formal statement
noncomputable section

namespace QAlgorithms.Papers.Independent.Intakethird100.P49

open QAlgorithms Filter

open scoped Matrix ComplexConjugate ComplexOrder BigOperators

attribute [local instance] Classical.propDecidable Classical.decEq

open QAlgorithms.Papers.Independent.Information100.P63 (Mat tensorPower)

open QAlgorithms.Papers.Independent.Dependency50.P18 (bipartiteTensor)

open QAlgorithms.Papers.Independent.Information100.P71 (diamond AdaptiveTest adaptiveInput adaptiveAccept)

open QAlgorithms.Papers.Independent.Bridge50.P25
  (LOCCOn normalizedChannelChoi TwoWayGenerationCode TwoWayChannelProtocol
   generationCodeError twoWayGenerationCapacity sendChannelRegister StateFunctional
   IsDimensionChangingLOCCMonotone privateStateInPartyOrder)

open QAlgorithms.Papers.Independent.Support50.P07 (amplitudeDampingChannel)

/-- Supplement II, PDF p.15, (125)--(129): coherent optical Choi states
and their exact root fidelity. Printed (121)'s fixed minus is corrected using
(117),(118),(124). Anti-Bell differs from canonical Bell by a common reference X,
which preserves fidelity. Joint-vacuum leakage and both parameter endpoints remain. -/
theorem optical_choi_fidelity (eta delta : ℝ)
    (heta : eta ∈ Set.Icc 0 1) (hdelta : delta ∈ Set.Icc (-1) 1) :
    (∀ sign : Bool, IsChannel (opticalChannel eta delta sign) ∧
      opticalChoi eta delta sign =
        (((1+eta)/2 : ℝ) : ℂ) • pureDensity (opticalPsi eta delta sign) +
        (((1-eta)/2 : ℝ) : ℂ) • Matrix.single (0,0) (0,0) 1) ∧
    rootFidelity (opticalChoi eta delta false) (opticalChoi eta delta true) =
      (1-eta+|1+delta*eta|)/2 ∧
    rootFidelity (opticalChoi eta delta false) (opticalChoi eta delta true) =
      1-eta*(1-delta)/2 ∧
    rootFidelity (normalizedChannelChoi (opticalChannel eta delta false))
      (normalizedChannelChoi (opticalChannel eta delta true)) = 1-eta*(1-delta)/2 := by sorry

end QAlgorithms.Papers.Independent.Intakethird100.P49

end
Source
Fundamental limits to quantum channel discrimination, arXiv:1803.02834v4, PDF p. 15, Supplement II, Eqs.(125)–(129): optical Choi fidelity
Read-back

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

For every η,δ∈R\eta,\delta\in\mathbb Rη,δ∈R satisfying 0≤η≤10\le\eta\le10≤η≤1 and −1≤δ≤1-1\le\delta\le1−1≤δ≤1, define εs=−1\varepsilon_s=-1εs​=−1 for s=trues=\mathrm{true}s=true and 111 for s=falses=\mathrm{false}s=false, and let

K0,s=(100(1+δ)η/20εs(1−δ)η/2),K1=(01−η0000),Φs(X)=K0,sXK0,s†+K1XK1†.K_{0,s}=\begin{pmatrix} 1&0\\0&\sqrt{(1+\delta)\eta/2}\\ 0&\varepsilon_s\sqrt{(1-\delta)\eta/2} \end{pmatrix}, \qquad K_1=\begin{pmatrix}0&\sqrt{1-\eta}\\0&0\\0&0\end{pmatrix}, \quad \Phi_s(X)=K_{0,s}XK_{0,s}^\dagger+K_1XK_1^\dagger.K0,s​=​100​0(1+δ)η/2​εs​(1−δ)η/2​​​,K1​=​000​1−η​00​​,Φs​(X)=K0,s​XK0,s†​+K1​XK1†​.

For both Boolean values sss, Φs\Phi_sΦs​ is a channel, meaning that it has a finite Kraus representation with ∑jKj†Kj=1\sum_jK_j^\dagger K_j=1∑j​Kj†​Kj​=1, and, writing

∣χ⟩=∣0,1⟩+∣1,0⟩2,Cs=(id⁡⊗Φs)(∣χ⟩⟨χ∣),∣ψs⟩=∣1,0⟩+(1+δ)η/2∣0,1⟩+εs(1−δ)η/2∣0,2⟩1+η,|\chi\rangle=\frac{|0,1\rangle+|1,0\rangle}{\sqrt2}, \quad C_s=(\operatorname{id}\otimes\Phi_s)(|\chi\rangle\langle\chi|), \quad |\psi_s\rangle= \frac{|1,0\rangle+\sqrt{(1+\delta)\eta/2}|0,1\rangle +\varepsilon_s\sqrt{(1-\delta)\eta/2}|0,2\rangle}{\sqrt{1+\eta}},∣χ⟩=2​∣0,1⟩+∣1,0⟩​,Cs​=(id⊗Φs​)(∣χ⟩⟨χ∣),∣ψs​⟩=1+η​∣1,0⟩+(1+δ)η/2​∣0,1⟩+εs​(1−δ)η/2​∣0,2⟩​,

one has

Cs=1+η2∣ψs⟩⟨ψs∣+1−η2∣0,0⟩⟨0,0∣.C_s=\frac{1+\eta}{2}|\psi_s\rangle\langle\psi_s| +\frac{1-\eta}{2}|0,0\rangle\langle0,0|.Cs​=21+η​∣ψs​⟩⟨ψs​∣+21−η​∣0,0⟩⟨0,0∣.

Moreover,

Fr(Cfalse,Ctrue)=1−η+∣1+δη∣2=1−η(1−δ)2,F_{\mathrm r}(C_{\mathrm{false}},C_{\mathrm{true}}) =\frac{1-\eta+|1+\delta\eta|}{2} =1-\frac{\eta(1-\delta)}2,Fr​(Cfalse​,Ctrue​)=21−η+∣1+δη∣​=1−2η(1−δ)​,

and also

Fr ⁣((id⁡⊗Φfalse)(∣ϕ⟩⟨ϕ∣),(id⁡⊗Φtrue)(∣ϕ⟩⟨ϕ∣))=1−η(1−δ)2,∣ϕ⟩=∣0,0⟩+∣1,1⟩2.F_{\mathrm r}\!\left( (\operatorname{id}\otimes\Phi_{\mathrm{false}})(|\phi\rangle\langle\phi|), (\operatorname{id}\otimes\Phi_{\mathrm{true}})(|\phi\rangle\langle\phi|) \right) =1-\frac{\eta(1-\delta)}2, \qquad |\phi\rangle=\frac{|0,0\rangle+|1,1\rangle}{\sqrt2}.Fr​((id⊗Φfalse​)(∣ϕ⟩⟨ϕ∣),(id⊗Φtrue​)(∣ϕ⟩⟨ϕ∣))=1−2η(1−δ)​,∣ϕ⟩=2​∣0,0⟩+∣1,1⟩​.

Here Fr(X,Y)=Re⁡tr⁡X Y XF_{\mathrm r}(X,Y)=\operatorname{Re}\operatorname{tr}\sqrt{\sqrt X\,Y\,\sqrt X}Fr​(X,Y)=RetrX​YX​​, with square roots taken through continuous functional calculus. All endpoints of the stated parameter intervals are included.

Human review
  • Endorsed by Shuze Chen · Nov 1, 2026

    Confirmed by the moderator at approval.

  • Endorsed by Gohan · Nov 1, 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 paper
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me