§5.2: small Holevo information bounds the hybrid privacy defect
OpenQAlgorithms.Papers.Independent.Support50.P27.holevo_privacy_boundFix normalized finite conditional QKD output data, with public length probabilities . For every length let be the uniform diagonal ensemble and its mean. Every conditional Eve state is a normalized density matrix, with arbitrary normalized representatives on null events. Define the hybrid states by retaining the same equal uniform keys and using respectively and . Let
If and , then
This controls the composable privacy defect without a length-dependent exponential factor. The trace norm is the full sum of singular values; the privacy defect has its separate factor one half.
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.13--14, Section 5.2, Eq.(18) and the displayed bound after Eq.(19):
small weighted Holevo information bounds the FULL hybrid trace norm by
sqrt(2 ln(2) mu2). The Eq.(15) privacy defect is one half of this norm.
The accepted entropy has the standard minus sign; Appendix p.18 omits it.
Printed/used/why: Tr(rho log rho) / -Tr(rho log_2 rho) / required by Eq.(19)
and the nonnegative Holevo quantity of Section 5.2. No corrected theorem
constant is substituted. This sign clarification needs independent moderation. -/
theorem holevo_privacy_bound {L : ℕ} {E : Type} [Fintype E] [Nonempty E]
(D : KeyData L E) (mu2 : ℝ) (hmu2 : 0 ≤ mu2)
(hprivacy : diagonalHolevo D ≤ mu2) :
traceNorm (firstHybrid D - secondHybrid D) ≤
Real.sqrt (2 * Real.log 2 * diagonalHolevo D) ∧
Real.sqrt (2 * Real.log 2 * diagonalHolevo D) ≤
Real.sqrt (2 * Real.log 2 * mu2) ∧
composablePrivacy D ≤ Real.sqrt (2 * Real.log 2 * mu2) / 2 := 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 , and data comprising nonnegative weights summing to , probability laws on , and positive semidefinite, trace-one matrices on , put , , and
where is applied by continuous functional calculus and . Define block diagonal matrices , indexed by , whose blocks at are respectively and when , and otherwise. For every real satisfying , the statement asserts
Here , using continuous functional calculus. Length , zero weights, and are included; the uniform diagonal ensembles include all diagonal states regardless of their probabilities under .
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.