Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Balanced binary fusion: photon count and inverse size budget

Proved
QAlgorithms.Papers.Independent.Intakenext100.P89.balanced_cluster_size

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

prove2quantum

Consider the idealized balanced construction in which every leaf is a three-photon GHZ state and every successful Type-II fusion joins equal-size daughter clusters, consuming one photon from each daughter. Let NkN_kNk​ be the photon-count budget after k∈Nk\in\mathbb Nk∈N fusion levels, so N0=3N_0=3N0​=3 and Nk+1=2Nk−2N_{k+1}=2N_k-2Nk+1​=2Nk​−2. Then

Nk=2k+2.N_k=2^k+2.Nk​=2k+2.

For every integral target N≥3N\ge3N≥3, the exact inverse budget relation is

N≤Nk⟺⌈log⁡2(N−2)⌉≤k.N\le N_k\quad\Longleftrightarrow\quad\lceil\log_2(N-2)\rceil\le k.N≤Nk​⟺⌈log2​(N−2)⌉≤k.

Thus the least depth whose budget reaches the target is ⌈log⁡2(N−2)⌉\lceil\log_2(N-2)\rceil⌈log2​(N−2)⌉, encoded by Lean's Nat.clog 2 (N - 2). This is the equal-daughter size-budget convention of the paragraph. It does not assert an optimal preparation schedule for every graph shape or the exact production of an arbitrary target graph.

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: size in the idealized equal-daughter balanced construction and its
inverse size budget. For a target N >= 3, ceil(log_2(N-2)) is the least depth whose
photon-count budget reaches N. This is not an optimality claim about arbitrary graph
shapes or optical construction schedules. -/
theorem balanced_cluster_size (k : ℕ) :
    balancedSize k = 2 ^ k + 2 ∧
    (∀ N : ℕ, 3 ≤ N → (N ≤ balancedSize k ↔ Nat.clog 2 (N - 2) ≤ 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: size and fusion-depth relation for the balanced construction
Read-back

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

For every natural number kkk, define B0=3B_0=3B0​=3 and Bj+1=2Bj−2B_{j+1}=2B_j-2Bj+1​=2Bj​−2, with subtraction taken in the natural numbers. Then Bk=2k+2B_k=2^k+2Bk​=2k+2, and for every natural number N≥3N\ge 3N≥3,

N≤Bk⟺⌈log⁡2(N−2)⌉≤k,N\le B_k \quad\Longleftrightarrow\quad \left\lceil\log_2(N-2)\right\rceil\le k,N≤Bk​⟺⌈log2​(N−2)⌉≤k,

where the ceiling logarithm is the least natural number eee such that N−2≤2eN-2\le 2^eN−2≤2e. This includes k=0k=0k=0, for which B0=3B_0=3B0​=3, and N=3N=3N=3, for which the ceiling logarithm is 000.

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