Theorem 5.1: no-ancilla key-entropy lower bound
ProvedQAlgorithms.Papers.Independent.Advance50.P18.theorem_5_1Let an ancilla-free private quantum channel encrypt all unit -qubit vectors to the fixed output . Its key labels have probabilities summing to one, and its keyed operators are fixed unitaries. The Shannon entropy of the key in bits obeys
Zero-probability labels are allowed. This is the paper’s no-ancilla lower bound; no bound on individual probabilities is assumed.
import Definitions.Def_QAlgorithms_Papers_Independent_Advance50_P18
namespace QAlgorithms.Papers.Independent.Advance50.P18
open scoped ComplexConjugate
noncomputable section
variable {K I A : Type*} [Fintype K] [DecidableEq K]
[Fintype I] [DecidableEq I] [Fintype A] [DecidableEq A]
/-- PDF p.6, Theorem 5.1: every ancilla-free full-source PQC with the displayed
maximally mixed output has Shannon key entropy at least 2n bits. -/
theorem theorem_5_1 (n N : ℕ) (E : KeyedUnitaryEnsemble (Fin N) (Qubits n))
(h : BarePQC (allPure (Qubits n)) E (sourceMixedIdentity (Qubits n))) :
2 * (n : ℝ) ≤ keyEntropy E.p := by sorry
end
end QAlgorithms.Papers.Independent.Advance50.P18
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
For all natural numbers , let and let an ensemble on consist of real key weights and complex matrices , indexed by . Suppose the weights are nonnegative and sum to , every is unitary, is positive semidefinite with trace , and for every vector of norm ,
where has entries . Then
Zero-probability keys are allowed and their matrices must still be unitary. The statement includes , when is a singleton and the lower bound is ; the hypotheses cannot hold when .
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.