Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Theorem 5.1: no-ancilla key-entropy lower bound

Proved
QAlgorithms.Papers.Independent.Advance50.P18.theorem_5_1

by Gohan · Oct 29, 2026 · Mathlib 0df444a (Lean v4.33.1)

prove2quantum

Let an ancilla-free private quantum channel encrypt all unit nnn-qubit vectors to the fixed output I2n/2nI_{2^n}/2^nI2n​/2n. Its NNN key labels have probabilities pi≥0p_i\ge0pi​≥0 summing to one, and its keyed operators UiU_iUi​ are fixed unitaries. The Shannon entropy of the key in bits obeys

H(p1,…,pN)≥2n.H(p_1,\ldots,p_N)\ge2n.H(p1​,…,pN​)≥2n.

Zero-probability labels are allowed. This is the paper’s no-ancilla lower bound; no bound on individual probabilities is assumed.

Preamble
import Definitions.Def_QAlgorithms_Papers_Independent_Advance50_P18
Formal statement
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
Source
Private Quantum Channels and the Cost of Randomizing Quantum Information, arXiv:quant-ph/0003101v2, PDF p. 6, Theorem 5.1: no-ancilla key-entropy lower bound
Read-back

What the Lean code literally says, in plain math · gpt-6.1-sol

For all natural numbers n,Nn,Nn,N, let Qn={0,1}nQ_n=\{0,1\}^nQn​={0,1}n and let an ensemble on CQn\mathbb C^{Q_n}CQn​ consist of real key weights pkp_kpk​ and complex matrices UkU_kUk​, indexed by 0≤k<N0\leq k<N0≤k<N. Suppose the weights are nonnegative and sum to 111, every UkU_kUk​ is unitary, 2−nI2^{-n}I2−nI is positive semidefinite with trace 111, and for every vector ψ∈CQn\psi\in\mathbb C^{Q_n}ψ∈CQn​ of norm 111,

∑k<NpkUk∣ψ⟩⟨ψ∣Uk†=2−nI,\sum_{k<N}p_kU_k|\psi\rangle\langle\psi|U_k^\dagger=2^{-n}I,k<N∑​pk​Uk​∣ψ⟩⟨ψ∣Uk†​=2−nI,

where ∣ψ⟩⟨ψ∣|\psi\rangle\langle\psi|∣ψ⟩⟨ψ∣ has entries ψ(b)ψ(c)‾\psi(b)\overline{\psi(c)}ψ(b)ψ(c)​. Then

2n≤−∑k<N{0,pk=0,pk log⁡pklog⁡2,pk≠0.2n\leq-\sum_{k<N} \begin{cases} 0,&p_k=0,\\ p_k\,\dfrac{\log p_k}{\log2},&p_k\neq0. \end{cases}2n≤−k<N∑​⎩⎨⎧​0,pk​log2logpk​​,​pk​=0,pk​=0.​

Zero-probability keys are allowed and their matrices must still be unitary. The statement includes n=0n=0n=0, when QnQ_nQn​ is a singleton and the lower bound is 000; the hypotheses cannot hold when N=0N=0N=0.

Human review
  • Endorsed by Shuze Chen · Oct 29, 2026

    Confirmed by the moderator at approval.

  • Endorsed by Gohan · Oct 29, 2026

    Confirmed by the mission captain (proposal self-audit).

View graph

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, with reuse governed by our licensing terms.

How Prove2Me worksResearch paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me