Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Naive multiplexing: heralding recursion and corrected final success

Proved
QAlgorithms.Papers.Independent.Intakenext100.P89.naive_heralding_success

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

prove2quantum

Assume only independent photon loss. The source, detector and chip-to-fiber efficiencies ηs,ηd,ηc\eta_s,\eta_d,\eta_cηs​,ηd​,ηc​ lie in (0,1](0,1](0,1]; fiber attenuation α\alphaα is positive, chip attenuation β\betaβ is nonnegative, feedforward delays τs,τf\tau_s,\tau_fτs​,τf​ are nonnegative and propagation speeds cch,cfc_{\rm ch},c_fcch​,cf​ are positive, 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), and a=e−βτsccha=e^{-\beta\tau_s c_{\rm ch}}a=e−βτs​cch​. Let k≥0k\ge0k≥0 and let the numbers of major nodes nnn, channels per direction mmm, and multiplexing counts g=nGHZ,b=nB,t=nmeasg=n_{\rm GHZ},b=n_B,t=n_{\rm meas}g=nGHZ​,b=nB​,t=nmeas​ be positive integers. Define G=[v(2−v)]3/32G=[v(2-v)]^3/32G=[v(2−v)]3/32, Ql=(hal)2/2Q_l=(ha^l)^2/2Ql​=(hal)2/2, and P′=(hak+1)4m+1P'=(ha^{k+1})^{4m+1}P′=(hak+1)4m+1. In the actual independent-attempt naive experiment, let PlP_lPl​ denote the probability of heralding a level-lll cluster, Pc1P_{c1}Pc1​ that of a final measured cluster at one major node, and PcnP_{cn}Pcn​ that of final clusters at all nnn nodes. Then

P0=1−(1−G)g,Pl+1=1−(1−Pl2Ql+1)b(l≥0),Pc1=1−(1−PkP′)t,Pcn=Pc1 n.\begin{aligned}P_0&=1-(1-G)^g,\\P_{l+1}&=1-(1-P_l^2Q_{l+1})^b\quad(l\ge0),\\P_{c1}&=1-(1-P_kP')^t,\\P_{cn}&=P_{c1}^{\,n}.\end{aligned}P0​Pl+1​Pc1​Pcn​​=1−(1−G)g,=1−(1−Pl2​Ql+1​)b(l≥0),=1−(1−Pk​P′)t,=Pc1n​.​

These probabilities are finite event sums, with independent copies selected at each multiplexing stage. They retain the probability of constructing both daughters, rather than only the final conditional fusion success.

Source correction. Page 8 prints Pc1=1−(QkP′)tP_{c1}=1-(Q_kP')^tPc1​=1−(Qk​P′)t. The corrected formula above follows the stated complete-attempt construction and has the proper zero- and unit-success endpoints. Independent moderation of this correction is pending.

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.7--8, III.A.1: recursive, final and network preparation probabilities.
CORRECTION: p.8 prints Pc1 = 1-(Qk P')^nmeas. The actual experiment requires
Pc1 = 1-(1-Pk P')^nmeas: Qk is only conditional fusion success and the printed formula
reverses the zero/one success endpoints. Independent moderation is required. -/
theorem naive_heralding_success (d : Devices) (k m n nGHZ nB nMeas : ℕ)
    (hm : 0 < m) (hn : 0 < n) (hGHZ : 0 < nGHZ) (hB : 0 < nB)
    (hMeas : 0 < nMeas) :
    naiveClusterLaw d nGHZ nB 0 true = 1 - (1 - ghzSuccess d) ^ nGHZ ∧
    (∀ l : ℕ, naiveClusterLaw d nGHZ nB (l + 1) true =
      1 - (1 - (naiveClusterLaw d nGHZ nB l true) ^ 2 *
        naiveFusionSuccess d (l + 1)) ^ nB) ∧
    naiveFinalLaw d k m nGHZ nB nMeas true =
      1 - (1 - naiveClusterLaw d nGHZ nB k true *
        finalMeasurementSuccess d k m) ^ nMeas ∧
    allLaw n (naiveFinalLaw d k m nGHZ nB nMeas) true =
      (naiveFinalLaw d k m nGHZ nB nMeas true) ^ n := 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. 7, III.A.1: recursive naive heralding success, with documented correction
Read-back

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

For a device record ddd with real fields ηS,ηD,ηC,α,β,τS,τF,cChip,cFiber\eta_S,\eta_D,\eta_C,\alpha,\beta,\tau_S,\tau_F,c_{\mathrm{Chip}},c_{\mathrm{Fiber}}ηS​,ηD​,ηC​,α,β,τS​,τF​,cChip​,cFiber​ satisfying 0<ηS,ηD,ηC≤10<\eta_S,\eta_D,\eta_C\le10<ηS​,ηD​,ηC​≤1, α>0\alpha>0α>0, β,τS,τF≥0\beta,\tau_S,\tau_F\ge0β,τS​,τF​≥0, and cChip,cFiber>0c_{\mathrm{Chip}},c_{\mathrm{Fiber}}>0cChip​,cFiber​>0, every natural number kkk, and positive natural numbers m,n,nGHZ,nB,nMeasm,n,n_{\mathrm{GHZ}},n_B,n_{\mathrm{Meas}}m,n,nGHZ​,nB​,nMeas​, put u=ηSηDu=\eta_S\eta_Du=ηS​ηD​, h=u/(2−u)h=u/(2-u)h=u/(2−u), c=e−βτScChipc=e^{-\beta\tau_Sc_{\mathrm{Chip}}}c=e−βτS​cChip​, g=(u(2−u))3/32g=(u(2-u))^3/32g=(u(2−u))3/32, fj=(hcj)2/2f_j=(hc^j)^2/2fj​=(hcj)2/2, and v=(hck+1)4m+1v=(hc^{k+1})^{4m+1}v=(hck+1)4m+1. Define Bp(true)=pB_p(\mathrm{true})=pBp​(true)=p, Bp(false)=1−pB_p(\mathrm{false})=1-pBp​(false)=1−p; let D(w,w′)(b)D(w,w')(b)D(w,w′)(b) sum w(a)w′(e)w(a)w'(e)w(a)w′(e) over Boolean pairs whose conjunction is bbb; and let At(w)(b)A_t(w)(b)At​(w)(b) sum ∏iw(zi)\prod_i w(z_i)∏i​w(zi​) over Boolean ttt-tuples for which “some entry is true” holds exactly when b=trueb=\mathrm{true}b=true. Set C0=AnGHZ(Bg)C_0=A_{n_{\mathrm{GHZ}}}(B_g)C0​=AnGHZ​​(Bg​), Cl+1=AnB(D(D(Cl,Cl),Bfl+1))C_{l+1}=A_{n_B}(D(D(C_l,C_l),B_{f_{l+1}}))Cl+1​=AnB​​(D(D(Cl​,Cl​),Bfl+1​​)), and F=AnMeas(D(Ck,Bv))F=A_{n_{\mathrm{Meas}}}(D(C_k,B_v))F=AnMeas​​(D(Ck​,Bv​)). All four assertions hold:

C0(true)=1−(1−g)nGHZ,Cl+1(true)=1−(1−Cl(true)2fl+1)nBfor every l∈N,F(true)=1−(1−Ck(true)v)nMeas,∑z∈{false,true}n∀i, zi=true∏i=0n−1F(zi)=F(true)n.\begin{aligned} C_0(\mathrm{true})&=1-(1-g)^{n_{\mathrm{GHZ}}},\\ C_{l+1}(\mathrm{true})&= 1-\left(1-C_l(\mathrm{true})^2f_{l+1}\right)^{n_B} &&\text{for every }l\in\mathbb N,\\ F(\mathrm{true})&= 1-\left(1-C_k(\mathrm{true})v\right)^{n_{\mathrm{Meas}}},\\ \sum_{\substack{z\in\{\mathrm{false},\mathrm{true}\}^{n}\\ \forall i,\ z_i=\mathrm{true}}}\prod_{i=0}^{n-1}F(z_i) &=F(\mathrm{true})^n. \end{aligned}C0​(true)Cl+1​(true)F(true)z∈{false,true}n∀i, zi​=true​∑​i=0∏n−1​F(zi​)​=1−(1−g)nGHZ​,=1−(1−Cl​(true)2fl+1​)nB​=1−(1−Ck​(true)v)nMeas​,=F(true)n.​for every l∈N,

The indices kkk and lll may be zero; the other five natural-number parameters are required to be positive.

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