Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Quantum whole-key reduction

Open
QAlgorithms.Papers.Independent.Intakenext100.P77.quantum_whole_string_bound

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

prove2quantum

Let m≥1m\ge1m≥1, let XXX have a normalized finite distribution, and let A1(X),…,Am(X)A_1(X),\ldots,A_m(X)A1​(X),…,Am​(X) be jointly independent finite random variables. Let ρx\rho_xρx​ be a normalized finite-dimensional density matrix for every xxx. For any finite POVM MMM, let EME^MEM denote its classical outcome. Define

SDi,a=sup⁡NI(Ai;EN∣A≠i=a)SD_{i,a}=\sup_N I(A_i;E^N\mid A_{\ne i}=a)SDi,a​=Nsup​I(Ai​;EN∣A=i​=a)

for positive-probability disclosures aaa, optimizing separately over all finite POVMs NNN. Then

I(A1,…,Am;EM)≤mmax⁡i, a:Pr⁡[A≠i=a]>0SDi,a.I(A_1,\ldots,A_m;E^M)\le m\max_{i,\,a:\Pr[A_{\ne i}=a]>0}SD_{i,a}.I(A1​,…,Am​;EM)≤mi,a:Pr[A=i​=a]>0max​SDi,a​.

Normalized ensembles make each supremum nonempty and bounded by the corresponding entropy. No optimal measurement must attain its supremum; the statement applies to every whole-key measurement.

Preamble
import Definitions.Def_QAlgorithms_Papers_Independent_Intakenext100_P77
Formal statement
noncomputable section

namespace QAlgorithms.Papers.Independent.Intakenext100.P77

open scoped BigOperators ComplexConjugate ComplexOrder

open QAlgorithms

-- The repair instruction authorizes imports of pinned accepted definitions.
-- These are definitions only; no imported paper theorem is used here.

open QAlgorithms.Papers.Independent.Dependency50.P47 (Law)

open QAlgorithms.Papers.Independent.Information100.P04 (Measurement)

open QAlgorithms.Papers.Independent.Information100.P27 (shannon)

open QAlgorithms.Papers.Independent.Information100.P39 (pushLaw)

open QAlgorithms.Papers.Independent.Support50.P16 (trivialMeasurement)

attribute [local instance] Classical.propDecidable Classical.decEq

/-- Appendix H.2, PDF p.25, Eq.(33): any whole-key POVM is bounded by the
maximum separately optimized conditional information. No optimal POVM need
attain any accessible-information supremum. -/
theorem quantum_whole_string_bound {X Q : Type} [Fintype X] [Fintype Q]
    [DecidableEq Q] {m : ℕ} (hm : 1 ≤ m) {A : Fin m → Type}
    [∀ i, Fintype (A i)] (p : Law X) (rho : X → Matrix Q Q ℂ)
    (hrho : ∀ x, IsDensityMatrix (rho x))
    (key : (i : Fin m) → X → A i) (hind : JointIndependent p.prob key)
    (M : Measurement Q) :
    classicalMutualInfo (measuredWeights p.prob rho M) (fun z i => key i z.1) Prod.snd ≤
      m * quantumDisclosureMaximum p.prob rho key := by sorry

end QAlgorithms.Papers.Independent.Intakenext100.P77

end
Source
A Proof of the Security of Quantum Key Distribution, arXiv:quant-ph/9912053v1, PDF p. 25, Appendix H.2 Eq.(33): quantum whole-key reduction
Read-back

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

Let X,QX,QX,Q be finite types, with decidable equality on QQQ, let m≥1m\ge1m≥1, and let AiA_iAi​ be finite for every i<mi<mi<m. Let p:X→Rp:X\to\mathbb Rp:X→R be nonnegative with total mass one, and let ρx\rho_xρx​ be a positive semidefinite complex matrix indexed by QQQ with tr⁡ρx=1\operatorname{tr}\rho_x=1trρx​=1 for every x∈Xx\in Xx∈X, including labels of zero weight. Let Ki:X→AiK_i:X\to A_iKi​:X→Ai​, and assume that for every tuple a∈∏i<mAia\in\prod_{i<m}A_ia∈∏i<m​Ai​, ∑x: ∀i, Ki(x)=aip(x)=∏i∑x:Ki(x)=aip(x)\sum_{x:\,\forall i,\ K_i(x)=a_i}p(x)=\prod_i\sum_{x:K_i(x)=a_i}p(x)∑x:∀i, Ki​(x)=ai​​p(x)=∏i​∑x:Ki​(x)=ai​​p(x). Choose any measurement with a positive number kkk of effects MyM_yMy​, each positive semidefinite and satisfying ∑y<kMy=I\sum_{y<k}M_y=I∑y<k​My​=I, and set r(x,y)=p(x)Re⁡tr⁡(Myρx)r(x,y)=p(x)\operatorname{Re}\operatorname{tr}(M_y\rho_x)r(x,y)=p(x)Retr(My​ρx​). For any finite weights qqq, define mutual information by the sum of the marginal Shannon entropies minus the joint Shannon entropy, with H(q)=−∑qlog⁡2qH(q)=-\sum q\log_2qH(q)=−∑qlog2​q and 0log⁡20=00\log_2 0=00log2​0=0. For K−i=(Kj)j≠iK_{-i}=(K_j)_{j\ne i}K−i​=(Kj​)j=i​ and each value aaa with pK−i(a)=∑x:K−i(x)=ap(x)>0p_{K_{-i}}(a)=\sum_{x:K_{-i}(x)=a}p(x)>0pK−i​​(a)=∑x:K−i​(x)=a​p(x)>0, define pi,a(x)=p(x)/pK−i(a)p^{i,a}(x)=p(x)/p_{K_{-i}}(a)pi,a(x)=p(x)/pK−i​​(a) on that fibre and zero elsewhere, and define

Ai,a=sup⁡ℓ≥1, Nz⪰0∑z<ℓNz=II pi,a(x)Re⁡tr⁡(Nzρx)(Ki(x);z).A_{i,a}=\sup_{\substack{\ell\ge1,\ N_z\succeq0\\\sum_{z<\ell}N_z=I}} I_{\,p^{i,a}(x)\operatorname{Re}\operatorname{tr}(N_z\rho_x)}(K_i(x);z).Ai,a​=ℓ≥1, Nz​⪰0∑z<ℓ​Nz​=I​sup​Ipi,a(x)Retr(Nz​ρx​)​(Ki​(x);z).

Then

Ir((Ki(x))i<m;y)≤mmax⁡i<m, apK−i(a)>0Ai,a.I_r((K_i(x))_{i<m};y) \le m\max_{\substack{i<m,\ a\\p_{K_{-i}}(a)>0}}A_{i,a}.Ir​((Ki​(x))i<m​;y)≤mi<m, apK−i​​(a)>0​max​Ai,a​.

Thus each conditional accessible information permits its own finite measurement. The outer maximum is defined as zero if its collection is empty; under the stated assumptions that collection is nonempty.

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

    Confirmed by the moderator at approval.

  • Endorsed by Gohan · Oct 31, 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