Banked construction: three conditional binomial laws
OpenQAlgorithms.Papers.Independent.Intakenext100.P89.banked_transition_lawsUse the independent-loss device model with , , , and positive propagation speeds in consistent units. Put , , , and
For any nonnegative integral source count , bank sizes , count , and fusion level , independent trials give the following count laws:
Here for 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 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.
import Definitions.Def_QAlgorithms_Papers_Independent_Intakenext100_P89
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
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
Let have real parameters , , and . For natural numbers with , put , , , , and . Define
where is natural-number subtraction, equal to zero when . The theorem asserts all three equalities
There is no divisibility assumption on and no upper bound on ; the other natural parameters may be zero. Empty products equal , for , and zeroth powers, including , equal .
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.