BB84 purification trajectories preserve the two Claim 10 inequalities
OpenQAlgorithms.Papers.Independent.Intakenext100.P80.bb84_trajectory_invariantsLet and . Start with independent Pauli noise . Fix any finite word of B and P steps whose first step is B; its suffix may be empty. For each prefix, compute the conditional Pauli error rates by performing those steps, and write and for the resulting bit-error probability and error difference. Index prefixes by , with denoting the initial distribution. Then
where is the length of the fixed word. Thus the first inequality begins after the initial B step, while the second also holds before purification.
These are invariants of the computed BB84 trajectories used in the worst-channel argument; they impose no invariant hypotheses on arbitrary error triples.
import Definitions.Def_QAlgorithms_Papers_Independent_Intakenext100_P80
noncomputable section
namespace QAlgorithms.Papers.Independent.Intakenext100.P80
open scoped ComplexConjugate
/-- Claim 10, PDF p.23, inheriting Theorem 9's setup on p.22.
The strict inequality holds initially and at every prefix. Delta need only
be nonnegative after the mandatory first B. The suffix is any fixed finite
B/P word, including the empty word; trajectories are computed, not supplied
as arbitrary triples satisfying invariant hypotheses. -/
theorem bb84_trajectory_invariants (p a : ℝ)
(hp : 0 ≤ p) (hpUpper : p < 1 / 4) (ha : 0 ≤ a) (haUpper : a ≤ p)
(suffix : List PurificationStep) :
0 < 1 - 2 * bitError (bb84Rates p a) - 2 * pauliErrorDifference (bb84Rates p a) ∧
∀ k : ℕ, k ≤ suffix.length →
let q := runSteps (.B :: suffix.take k) (bb84Rates p a)
0 ≤ pauliErrorDifference q ∧ 0 < 1 - 2 * bitError q - 2 * pauliErrorDifference q := by sorry
end QAlgorithms.Papers.Independent.Intakenext100.P80
end
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
For every pair of real numbers satisfying and , and every finite list whose entries are or , the assertions below hold for the initial triple and the transformations defined as follows. Identify Booleans with , write for exclusive-or, and set and . For each current real triple , put , , , , and define
where division by zero is defined to give zero. The first assertion is
The second assertion is that for every natural number with , if is obtained from by first applying and then applying, in order, the transformations specified by the first entries of , then
The case concerns the triple after the initial transformation alone; when is empty, this is the only permitted . The parameter case , which forces , is included.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.