Prove2Me
Navigate
DiscoverCollectionsFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

EPR geometric loss probabilities and sector overlaps

Open
QAlgorithms.Papers.Independent.Intakethird100.P54.epr_loss_coefficients

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

prove2quantum

Let M≥1M\ge1M≥1 be the finite number of signal modes and J≥0J\ge0J≥0 the finite number of retained idler modes, on the full optical Fock spaces. The two channels have equal priors, independent vacuum environments, reflectances 0≤R0≤R1≤10\le R_0\le R_1\le10≤R0​≤R1​≤1, field magnitudes rb=Rbr_b=\sqrt{R_b}rb​=Rb​​ and tb=1−Rbt_b=\sqrt{1-R_b}tb​=1−Rb​​, and distinct complex reflection coefficients rbeiθbr_b e^{i\theta_b}rb​eiθb​. Every signal mode sees the same channel; idlers are retained losslessly and environment outputs are inaccessible. Write F\mathcal FF for squared Uhlmann fidelity, PeP_ePe​ for minimum average error over all joint binary receivers, Qs=Tr⁡(ρ0sρ11−s)Q_s=\operatorname{Tr}(\rho_0^s\rho_1^{1-s})Qs​=Tr(ρ0s​ρ11−s​), and Q=min⁡0≤s≤1QsQ=\min_{0\le s\le1}Q_sQ=min0≤s≤1​Qs​, with zero powers interpreted as support projections. Here the common phase is removed, so θ0=θ1=0\theta_0=\theta_1=0θ0​=θ1​=0 and R0<R1R_0<R_1R0​<R1​. Put μ=r0r1+t0t1\mu=r_0r_1+t_0t_1μ=r0​r1​+t0​t1​.

For one signal-idler pair and per-pair signal energy N≥0N\ge0N≥0, the normalized NDS state is

∣ψN⟩=1N+1∑n=0∞(NN+1)n∣n⟩I∣n⟩S.|\psi_N\rangle=\sqrt{\frac1{N+1}}\sum_{n=0}^\infty\left(\sqrt{\frac N{N+1}}\right)^n|n\rangle_I|n\rangle_S.∣ψN​⟩=N+11​​n=0∑∞​(N+1N​​)n∣n⟩I​∣n⟩S​.

Its mean signal energy is NNN. The actual loss probability and overlap, with convergent defining series, satisfy

pk(b)=(TbN)k(TbN+1)k+1,Ik=(t0t1N)k[(1−r0r1)N+1]k+1,Tb=1−Rb.p_k^{(b)}=\frac{(T_bN)^k}{(T_bN+1)^{k+1}},\qquad I_k=\frac{(t_0t_1N)^k}{[(1-r_0r_1)N+1]^{k+1}},\quad T_b=1-R_b.pk(b)​=(Tb​N+1)k+1(Tb​N)k​,Ik​=[(1−r0​r1​)N+1]k+1(t0​t1​N)k​,Tb​=1−Rb​.

The integer powers give p0(b)=I0=1p_0^{(b)}=I_0=1p0(b)​=I0​=1 at N=0N=0N=0 and all positive-loss sectors vanish. This is the sector data for the EPR fidelity and Chernoff formulas.

Preamble
import Definitions.Def_QAlgorithms_Papers_Independent_Intakethird100_P54
Formal statement
noncomputable section

open scoped BigOperators ComplexConjugate

open MeasureTheory Filter

namespace QAlgorithms.Papers.Independent.Intakethird100.P54

open QAlgorithms.RealRegisters (Hilbert)

open QAlgorithms.Papers.Independent.Claimed50.P47 (Occupation)

open QAlgorithms.Papers.Independent.Dependency50.P39 (coherentCoefficient)

attribute [local instance] Classical.propDecidable

attribute [local instance] Classical.decEq

/-- EPR geometric loss probabilities and loss-sector overlap, PDF p.9, (73)–(75).
N is per-pair signal energy, not total energy of a multipair probe. -/
theorem epr_loss_coefficients (c : Channels) (hc : ValidSplitters c) (hr : Reading c)
    (N : ℝ) (hN : 0 ≤ N) :
    Memℓp (tmsvCoefficients 1 N) 2 ∧ ‖tmsvProbe 1 N‖=1 ∧
    HasSignalEnergy (tmsvProbe 1 N) N ∧ IsNDS (tmsvProbe 1 N) ∧
    (∀ b k, lossProbability c (tmsvProbe 1 N) b (fun _ => k)=
      (((1-(c b).reflectance)*N)^k / ((1-(c b).reflectance)*N+1)^(k+1))) ∧
    (∀ k, Summable (lossOverlapTerm c (tmsvProbe 1 N) (fun _ => k)) ∧
      lossOverlap c (tmsvProbe 1 N) (fun _ => k)=
        (((c false).t*(c true).t*N)^k / ((1-(c false).r*(c true).r)*N+1)^(k+1) : ℝ)) := by sorry

end QAlgorithms.Papers.Independent.Intakethird100.P54

end
Source
Discriminating quantum-optical beam-splitter channels with number-diagonal signal states: Applications to quantum reading and target detection, arXiv:1105.4063v3, PDF p. 9, epr-loss-coefficients
Read-back

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

Let ccc consist of splitters indexed by b=0,1b=0,1b=0,1, with reflectances Rb∈[0,1]R_b\in[0,1]Rb​∈[0,1] and phases ϕb∈R\phi_b\in\mathbb Rϕb​∈R, satisfying R0≤R1R_0\le R_1R0​≤R1​, R0eiϕ0≠R1eiϕ1\sqrt{R_0}e^{i\phi_0}\ne\sqrt{R_1}e^{i\phi_1}R0​​eiϕ0​=R1​​eiϕ1​, and ϕ0=ϕ1=0\phi_0=\phi_1=0ϕ0​=ϕ1​=0, and let N∈RN\in\mathbb RN∈R satisfy N≥0N\ge0N≥0. Write rb=Rbr_b=\sqrt{R_b}rb​=Rb​​ and tb=1−Rbt_b=\sqrt{1-R_b}tb​=1−Rb​​, and identify each one-mode occupation function with its unique natural-number value. Define f:N×N→Cf:\mathbb N\times\mathbb N\to\mathbb Cf:N×N→C by

f(i,n)={1N+1(NN+1)n,i=n,0,i≠n,f(i,n)= \begin{cases} \displaystyle\sqrt{\frac1{N+1}} \left(\sqrt{\frac N{N+1}}\right)^n,&i=n,\\ 0,&i\ne n, \end{cases}f(i,n)=⎩⎨⎧​N+11​​(N+1N​​)n,0,​i=n,i=n,​

and let ψ∈ℓ2(N×N;C)\psi\in\ell^2(\mathbb N\times\mathbb N;\mathbb C)ψ∈ℓ2(N×N;C) be this coefficient function if it is square summable, and the zero vector otherwise. For n,k∈Nn,k\in\mathbb Nn,k∈N, define ab(n,k)=(nk) rbn−ktbka_b(n,k)=\sqrt{\binom nk}\,r_b^{n-k}t_b^kab​(n,k)=(kn​)​rbn−k​tbk​ if k≤nk\le nk≤n, and 000 otherwise. Let sb,ks_{b,k}sb,k​ be the coefficient function (i,q)↦ψ(i,q+k)ab(q+k,k)(i,q)\mapsto\psi(i,q+k)a_b(q+k,k)(i,q)↦ψ(i,q+k)ab​(q+k,k) as an ℓ2\ell^2ℓ2 vector if square summable, and 000 otherwise, and put pn=∑i∣ψ(i,n)∣2p_n=\sum_i|\psi(i,n)|^2pn​=∑i​∣ψ(i,n)∣2. The assertion is that fff is square summable, ∥ψ∥=1\|\psi\|=1∥ψ∥=1, n↦npnn\mapsto np_nn↦npn​ is summable with ∑nnpn=N\sum_nnp_n=N∑n​npn​=N, and

∑iψ(i,n)ψ(i,q)‾=0for all n≠q.\sum_i\psi(i,n)\overline{\psi(i,q)}=0 \quad\text{for all }n\ne q.i∑​ψ(i,n)ψ(i,q)​=0for all n=q.

Furthermore, every b∈{0,1}b\in\{0,1\}b∈{0,1} and k∈Nk\in\mathbb Nk∈N satisfy

∥sb,k∥2=((1−Rb)N)k((1−Rb)N+1)k+1,\|s_{b,k}\|^2 =\frac{\bigl((1-R_b)N\bigr)^k} {\bigl((1-R_b)N+1\bigr)^{k+1}},∥sb,k​∥2=((1−Rb​)N+1)k+1((1−Rb​)N)k​,

and for every k∈Nk\in\mathbb Nk∈N, the complex-valued family n↦pna0(n,k)‾a1(n,k)n\mapsto p_n\overline{a_0(n,k)}a_1(n,k)n↦pn​a0​(n,k)​a1​(n,k) is summable and

⟨s0,k,s1,k⟩=(t0t1N)k((1−r0r1)N+1)k+1,\langle s_{0,k},s_{1,k}\rangle =\frac{(t_0t_1N)^k} {\bigl((1-r_0r_1)N+1\bigr)^{k+1}},⟨s0,k​,s1,k​⟩=((1−r0​r1​)N+1)k+1(t0​t1​N)k​,

where the real number on the right is regarded as a complex number. The statement includes N=0N=0N=0, k=0k=0k=0, and reflectance endpoints; zeroth powers, including 000^000, equal 111, and all the displayed denominators are positive under the hypotheses. Infinite sums use the total-sum convention, giving 000 for a nonsummable family, although summability is explicitly asserted for the moment and overlap families above.

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