§4.2: ideal KD has perfect equality, uniformity and privacy
ProvedQAlgorithms.Papers.Independent.Support50.P27.idealKD_perfectLet be a public random key length with finite support, chosen with any distribution by the adversarial interface. Conditional on , let be Eve's normalized residual state. Ideal key distribution samples a fresh uniform -bit string , gives the same string to Alice and Bob, and leaves Eve's state equal to , independently of . The value denotes abort and gives the unique empty key. If , then the equality-and-uniformity defect and conditional accessible information both vanish:
Because , the second expression is exactly the privacy requirement for in Eq. (5), optimized over measurements. Independence is conditional on the announced length, which Eve may know or control. This gives the perfect reference resource against which QKD output is compared.
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 p.10, Section 4.2: ideal KD has zero equality/uniformity defect and
zero accessible information about its identical keys, conditional on length.
The pair of keys determines the same random variable as K in Eq.(5).
Devil may choose the length law and cause abort; unconditional independence
of Eve and the publicly announced length is not asserted. -/
theorem idealKD_perfect {L : ℕ} {E : Type} [Fintype E] [Nonempty E]
(D : KeyData L E) :
equalityUniformityDefect D.lengthProb (idealBranch D) = 0 ∧
(∑ m, D.lengthProb m * accessibleInformation (idealBranch D m)) = 0 := 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 , define and when , and otherwise. The ideal branch at length assigns probability and the same state to every pair. The statement asserts both
Here is the real supremum over all finite families with at least one outcome and , of , where , , and with zero summands interpreted as . Length , zero length weights, and zero branch probabilities are allowed.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.