§5.1 Bound 1: first accessible-information bound
OpenQAlgorithms.Papers.Independent.Support50.P27.accessible_bound1Fix a finite dimensional Eve register and any fixed-parameter conditional QKD output data. Let , with and , and let . At each length, all conditional key-pair probabilities are normalized and all conditional Eve operators are density operators. Choose arbitrary normalized representatives on null events. Define
and define the hybrid states
If and , where information is in bits, then the full trace norm satisfies
This is the finite quantitative bound in the source's uniform-ensemble interpretation. Its exponential length overhead must be absorbed by a separate key-rate restriction before drawing asymptotic conclusions. It does not convert the actual-prior privacy premise of Eq. (4) into the displayed premise.
import Definitions.Def_QAlgorithms_Papers_Independent_Support50_P27
noncomputable section
namespace QAlgorithms.Papers.Independent.Support50.P27
open scoped BigOperators Matrix ComplexConjugate ComplexOrder
open QAlgorithms.Papers.Independent.Dependency50.P07
(CQData ensembleMean ensembleInformation accessibleInformation)
open QAlgorithms.Papers.Independent.Dependency50.P24 (Key)
open QAlgorithms.Papers.Independent.Dependency50.P47 (cqMatrix)
attribute [local instance] Classical.decEq Classical.propDecidable
/-- PDF pp.11--12, Section 5.1, Bound 1: full hybrid trace norm bounded by
(2^max(m)+1)^2 sqrt(2 ln 2) sqrt(mu2). The hypothesis concerns the explicitly
uniform F_m of the proof. It supplies NO actual-prior conversion from Eq.(4).
The displayed per-length bound is retained; exponential decay needs a rate
restriction and is not asserted for arbitrary key-length families. -/
theorem accessible_bound1 {L : ℕ} {E : Type} [Fintype E] [Nonempty E]
(D : KeyData L E) (mu2 : ℝ) (hmu2 : 0 ≤ mu2)
(hprivacy : diagonalAccessible D ≤ mu2) :
traceNorm (firstHybrid D - secondHybrid D) ≤
(∑ m, D.lengthProb m * ((2 : ℝ) ^ m.val + 1) ^ 2 *
Real.sqrt (2 * Real.log 2) *
Real.sqrt (accessibleInformation (diagonalEnsemble D m))) ∧
(∑ m, D.lengthProb m * ((2 : ℝ) ^ m.val + 1) ^ 2 *
Real.sqrt (2 * Real.log 2) *
Real.sqrt (accessibleInformation (diagonalEnsemble D m))) ≤
((2 : ℝ) ^ maxKeyLength D + 1) ^ 2 *
Real.sqrt (2 * Real.log 2) * Real.sqrt mu2 := by sorry
end QAlgorithms.Papers.Independent.Support50.P27
end
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
For every natural number , finite nonempty type , data comprising nonnegative weights summing to , probability laws on , and positive semidefinite, trace-one matrices on , put , , and . Let be the real supremum over every finite family with at least one outcome and , of , where , , , and with zero summands interpreted as . On the space indexed by , define block diagonal matrices : their blocks at label are respectively and if , and otherwise; entries between distinct labels are zero. For every real satisfying , the statement asserts
where , with the square root applied by continuous functional calculus. Length , zero weights, and are included; the uniform diagonal ensembles do not use the branch probabilities .
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.