Naive multiplexing: heralding recursion and corrected final success
ProvedQAlgorithms.Papers.Independent.Intakenext100.P89.naive_heralding_successAssume only independent photon loss. The source, detector and chip-to-fiber efficiencies lie in ; fiber attenuation is positive, chip attenuation is nonnegative, feedforward delays are nonnegative and propagation speeds are positive, in consistent units. Put , , and . Let and let the numbers of major nodes , channels per direction , and multiplexing counts be positive integers. Define , , and . In the actual independent-attempt naive experiment, let denote the probability of heralding a level- cluster, that of a final measured cluster at one major node, and that of final clusters at all nodes. Then
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 . 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.
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.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
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
For a device record with real fields satisfying , , , and , every natural number , and positive natural numbers , put , , , , , and . Define , ; let sum over Boolean pairs whose conjunction is ; and let sum over Boolean -tuples for which “some entry is true” holds exactly when . Set , , and . All four assertions hold:
The indices and may be zero; the other five natural-number parameters are required to be positive.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.