Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Naive multiplexing: simultaneous source count

Proved
QAlgorithms.Papers.Independent.Intakenext100.P89.naive_source_count

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

prove2quantum

Let k∈Nk\in\mathbb Nk∈N be the fusion depth and let nGHZ,nB,nmeasn_{\rm GHZ},n_B,n_{\rm meas}nGHZ​,nB​,nmeas​ be positive integers. In the unboosted naive stack, each leaf GHZ state is selected from nGHZn_{\rm GHZ}nGHZ​ independent attempts, each using six single-photon sources; each fusion has nBn_BnB​ attempts, each needing two daughter stacks. There are nmeasn_{\rm meas}nmeas​ complete top-level copies. The number of simultaneously fired sources is

Ns=6nGHZnmeas(2nB)k.N_s=6n_{\rm GHZ}n_{\rm meas}(2n_B)^k.Ns​=6nGHZ​nmeas​(2nB​)k.

The formal source set labels each of these sources explicitly. This count is for the specified baseline and does not include the ancillary photons of the improved boosted protocol.

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 p.7, III.A.1: simultaneous sources in the unboosted naive multiplexing stack.
Additional boosted-fusion ancillas are not included in this count. -/
theorem naive_source_count (k nGHZ nB nMeas : ℕ)
    (hGHZ : 0 < nGHZ) (hB : 0 < nB) (hMeas : 0 < nMeas) :
    Fintype.card (NaiveSources k nGHZ nB nMeas) =
      6 * nGHZ * nMeas * (2 * nB) ^ k := 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: naive multiplexing source count
Read-back

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

For every natural number kkk and positive natural numbers nGHZ,nB,nMeasn_{\mathrm{GHZ}},n_B,n_{\mathrm{Meas}}nGHZ​,nB​,nMeas​, let L(0)=6nGHZL(0)=6n_{\mathrm{GHZ}}L(0)=6nGHZ​ and L(j+1)=(2nB)L(j)L(j+1)=(2n_B)L(j)L(j+1)=(2nB​)L(j). The number of ordered pairs (u,v)(u,v)(u,v) of natural numbers with u<nMeasu<n_{\mathrm{Meas}}u<nMeas​ and v<L(k)v<L(k)v<L(k) is

6nGHZnMeas(2nB)k.6n_{\mathrm{GHZ}}n_{\mathrm{Meas}}(2n_B)^k.6nGHZ​nMeas​(2nB​)k.

The index kkk may be zero; in that case the final power is 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