Naive multiplexing: simultaneous source count
ProvedQAlgorithms.Papers.Independent.Intakenext100.P89.naive_source_countLet be the fusion depth and let be positive integers. In the unboosted naive stack, each leaf GHZ state is selected from independent attempts, each using six single-photon sources; each fusion has attempts, each needing two daughter stacks. There are complete top-level copies. The number of simultaneously fired sources is
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.
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 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
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
For every natural number and positive natural numbers , let and . The number of ordered pairs of natural numbers with and is
The index may be zero; in that case the final power is .
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.