Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Banked construction: three conditional binomial laws

Open
QAlgorithms.Papers.Independent.Intakenext100.P89.banked_transition_laws

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

prove2quantum

Use the independent-loss device model with ηs,ηd,ηc∈(0,1]\eta_s,\eta_d,\eta_c\in(0,1]ηs​,ηd​,ηc​∈(0,1], α>0\alpha>0α>0, β,τs,τf≥0\beta,\tau_s,\tau_f\ge0β,τs​,τf​≥0, and positive propagation speeds in consistent units. Put v=ηsηdv=\eta_s\eta_dv=ηs​ηd​, h=v/(2−v)h=v/(2-v)h=v/(2−v), a=e−βτsccha=e^{-\beta\tau_s c_{\rm ch}}a=e−βτs​cch​, G=[v(2−v)]3/32G=[v(2-v)]^3/32G=[v(2−v)]3/32 and

μl=hal+1,pl=μl2(v22+v44).\mu_l=ha^{l+1},\qquad p_l=\mu_l^2\left(\frac{v^2}{2}+\frac{v^4}{4}\right).μl​=hal+1,pl​=μl2​(2v2​+4v4​).

For any nonnegative integral source count NsN_sNs​, bank sizes y,y1,y2y,y_1,y_2y,y1​,y2​, count xxx, and fusion level l≥1l\ge1l≥1, independent trials give the following count laws:

Pr⁡[XGHZ=x]=B(x,⌊Ns/6⌋,G),Pr⁡[Xearly=x∣y]=B(x,y,ah),Pr⁡[Xl=x∣y1,y2]=B(x,min⁡{y1,y2},pl).\Pr[X_{\rm GHZ}=x]=B(x,\lfloor N_s/6\rfloor,G),\quad \Pr[X_{\rm early}=x\mid y]=B(x,y,ah),\quad \Pr[X_l=x\mid y_1,y_2]=B(x,\min\{y_1,y_2\},p_l).Pr[XGHZ​=x]=B(x,⌊Ns​/6⌋,G),Pr[Xearly​=x∣y]=B(x,y,ah),Pr[Xl​=x∣y1​,y2​]=B(x,min{y1​,y2​},pl​).

Here B(x,N,p)=(Nx)px(1−p)N−xB(x,N,p)=\binom Nx p^x(1-p)^{N-x}B(x,N,p)=(xN​)px(1−p)N−x for 0≤x≤N0\le x\le N0≤x≤N and is zero otherwise. The first experiment attempts one GHZ state per six sources, the second makes the specified early photon measurement on each of yyy GHZ fragments, and the third pairs daughter copies and discards the unmatched excess. These are exact conditional transition laws, without an inferred global allocation or Monte Carlo success guarantee.

Preamble
import Definitions.Def_QAlgorithms_Papers_Independent_Intakenext100_P89
Formal statement
namespace QAlgorithms.Papers.Independent.Intakenext100.P89

open scoped BigOperators ComplexConjugate

-- Accepted probability primitives: symbol true is success; choose n x is zero for x > n.

open QAlgorithms.Papers.Independent.Information100.P54 (binomialMass)

open QAlgorithms.Papers.Independent.Information100.P56 (bernoulli)

noncomputable section

/-- Source pp.8--9, III.A.2: GHZ, early-measurement and conditional fusion count laws.
Given daughter counts, min(y1,y2) trials are performed and unmatched excess discarded.
This does not supply a global Monte Carlo allocation rule or ancilla resource budget. -/
theorem banked_transition_laws (d : Devices) (nSources y y1 y2 l x : ℕ) (hl : 0 < l) :
    countLaw (nSources / 6) (ghzSuccess d) x =
      binomialMass (nSources / 6) (ghzSuccess d) x ∧
    countLaw y (chipSurvival d * etaGHZ d) x =
      binomialMass y (chipSurvival d * etaGHZ d) x ∧
    countLaw (min y1 y2) (bankFusionSuccess d l) x =
      binomialMass (min y1 y2) (bankFusionSuccess d l) x := by sorry

end

end QAlgorithms.Papers.Independent.Intakenext100.P89
Source
Rate-distance tradeoff and resource costs for all-optical quantum repeaters, arXiv:1603.01353v4, PDF p. 8, III.A.2: GHZ, early-measurement and banked-fusion count laws
Read-back

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

Let ddd have real parameters ηS,ηD,ηC∈(0,1]\eta_S,\eta_D,\eta_C\in(0,1]ηS​,ηD​,ηC​∈(0,1], α,cchip,cfiber>0\alpha,c_{\mathrm{chip}},c_{\mathrm{fiber}}>0α,cchip​,cfiber​>0, and β,τS,τF≥0\beta,\tau_S,\tau_F\ge0β,τS​,τF​≥0. For natural numbers nSources,y,y1,y2,l,xn_{\mathrm{Sources}},y,y_1,y_2,l,xnSources​,y,y1​,y2​,l,x with l>0l>0l>0, put a=ηSηDa=\eta_S\eta_Da=ηS​ηD​, c=e−βτScchipc=e^{-\beta\tau_Sc_{\mathrm{chip}}}c=e−βτS​cchip​, h=a/(2−a)h=a/(2-a)h=a/(2−a), g=[a(2−a)]3/32g=[a(2-a)]^3/32g=[a(2−a)]3/32, and fl=(hcl+1)2(a2/2+a4/4)f_l=(hc^{l+1})^2(a^2/2+a^4/4)fl​=(hcl+1)2(a2/2+a4/4). Define

C(m,p,x)=∑z:{0,…,m−1}→{false,true}#{i:zi=true}=x∏i=0m−1{p,zi=true,1−p,zi=false,B(m,p,x)=(mx)px(1−p)m−x,C(m,p,x)= \sum_{\substack{z:\{0,\ldots,m-1\}\to\{\mathrm{false},\mathrm{true}\}\\ \#\{i:z_i=\mathrm{true}\}=x}} \prod_{i=0}^{m-1} \begin{cases}p,&z_i=\mathrm{true},\\1-p,&z_i=\mathrm{false},\end{cases} \qquad B(m,p,x)=\binom mx p^x(1-p)^{m-x},C(m,p,x)=z:{0,…,m−1}→{false,true}#{i:zi​=true}=x​∑​i=0∏m−1​{p,1−p,​zi​=true,zi​=false,​B(m,p,x)=(xm​)px(1−p)m−x,

where m−xm-xm−x is natural-number subtraction, equal to zero when x>mx>mx>m. The theorem asserts all three equalities

C(⌊nSources/6⌋,g,x)=B(⌊nSources/6⌋,g,x),C(y,ch,x)=B(y,ch,x),C(min⁡(y1,y2),fl,x)=B(min⁡(y1,y2),fl,x).C(\lfloor n_{\mathrm{Sources}}/6\rfloor,g,x) =B(\lfloor n_{\mathrm{Sources}}/6\rfloor,g,x),\qquad C(y,ch,x)=B(y,ch,x),\qquad C(\min(y_1,y_2),f_l,x)=B(\min(y_1,y_2),f_l,x).C(⌊nSources​/6⌋,g,x)=B(⌊nSources​/6⌋,g,x),C(y,ch,x)=B(y,ch,x),C(min(y1​,y2​),fl​,x)=B(min(y1​,y2​),fl​,x).

There is no divisibility assumption on nSourcesn_{\mathrm{Sources}}nSources​ and no upper bound on xxx; the other natural parameters may be zero. Empty products equal 111, (mx)=0\binom mx=0(xm​)=0 for x>mx>mx>m, and zeroth powers, including 000^000, equal 111.

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