Supplementary Note 1: complete BB84 break at zero bit error with enough loss
OpenQAlgorithms.Papers.Independent.Intakenext100.P87.photon_number_splittingConsider identically polarized BB84 pulses with photon-number probabilities , , independent of the bit and basis. Bob has a basis-independent signal-click response . Define . If the honest signal rate satisfies , a polarization-independent thinning probability exists for the following attack: block pulses with fewer than two photons, retain one photon from each forwarded pulse, and send the rest through a superior channel. After the basis announcement, matched-basis measurement gives
Thus the signal rate is matched, sifted bit errors are zero, and Eve learns every signal bit. Extraction is explicitly a split of pre-existing tensor factors. Arbitrary countable number distributions, including Poisson pulses, are covered; no photon cutoff or cloning map is assumed.
import Definitions.Def_QAlgorithms_Papers_Independent_Intakenext100_P87
noncomputable section
namespace QAlgorithms.Papers.Independent.Intakenext100.P87
open scoped Matrix ComplexConjugate
open QAlgorithms.Measurements
/-- PDF pp.14,19, Supplementary Note 1: whenever multiphoton-only forwarding can
match the honest signal rate q, one polarization-independent thinning attack matches
that rate, causes zero sifted bit errors, and lets Eve recover every sifted bit.
The pulse statistics are arbitrary normalized nonnegative sequences, including Poisson.
The exact extraction factorization explicitly uses pre-existing photons. -/
theorem photon_number_splitting (p d : ℕ → ℝ) (hp : ∀ n, 0 ≤ p n)
(hnorm : HasSum p 1) (hd : ∀ n, 0 ≤ d n ∧ d n ≤ 1)
(q : ℝ) (hq : 0 ≤ q) (hfeasible : q ≤ pnsForwardRate p d) :
(∃ t : ℝ, 0 ≤ t ∧ t ≤ 1 ∧ t * pnsForwardRate p d = q ∧
∀ basis bit bob eve : Bool,
pnsKeyLaw p d t basis bit bob eve = if bob = bit ∧ eve = bit then q else 0) ∧
(∀ (n : ℕ) (basis bit : Bool),
extractedPulse n basis bit = tensorVec (bb84SignalKet basis bit) (photonPulse n basis bit)) ∧
(∀ mu : ℝ, 0 ≤ mu → (∀ n, 0 ≤ poissonMass mu n) ∧ HasSum (poissonMass mu) 1) := by sorry
end QAlgorithms.Papers.Independent.Intakenext100.P87
end
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
For every pair of real-valued sequences satisfying for every , in the sense of convergence of the series, and for every , and every real satisfying
the following three assertions hold jointly. First, there exists a real with and such that, for all Booleans ,
where is if and , if and , and, if , is when and otherwise. This includes , in which case the hypotheses force . Second, for every natural and Booleans , the vector whose -amplitude is the length- pulse amplitude on the string followed by equals the tensor product of the single-bit vector and the length- vector with amplitudes ; this includes , with empty product . Third, for every real , all numbers , for , are nonnegative and their series converges to ; at , the zeroth term is and every positive-index term is .
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.