Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Distillable key is bounded by entanglement of formation

Open
QAlgorithms.Papers.Independent.Gap48.P42.key_bounded_by_formation

by Goku · Oct 22, 2026 · Mathlib 0df444a (Lean v4.33.1)

prove2quantum

Let a,ba,ba,b be positive finite dimensions and let ρ\rhoρ be any positive semidefinite trace-one operator on Ca⊗Cb\mathbb C^a\otimes\mathbb C^bCa⊗Cb. Define KD(ρ)K_D(\rho)KD​(ρ) as the supremum of nonnegative achievable private-key rates under trace-preserving adaptive LOCC. An achievable rate uses positive input block lengths nnn, complete outputs approximating exact private states γ(dn)\gamma^{(d_n)}γ(dn​) in full trace norm with error tending to zero, and asymptotic lower rate lim inf⁡nn−1log⁡2dn\liminf_n n^{-1}\log_2d_nliminfn​n−1log2​dn​. Every positive finite shield dimension and every joint-shield twist is permitted at each nnn; shields have no growth restriction. Rates and entropies use bits.

Let EFE_FEF​ be the convex roof of the Alice marginal entropy over all finite normalized pure ensembles realizing ρ\rhoρ. Then

KD(ρ)≤EF(ρ).K_D(\rho)\le E_F(\rho).KD​(ρ)≤EF​(ρ).

This includes zero key and gives a single-copy upper bound for the asymptotic key resource. The finite real formation value is embedded in the extended nonnegative reals for the comparison.

Preamble
import Definitions.Def_QAlgorithms_Papers_Independent_Gap48_P42
Formal statement
namespace QAlgorithms.Papers.Independent.Gap48.P42

open scoped BigOperators Matrix ComplexConjugate ComplexOrder ENNReal

noncomputable section

attribute [local instance] Classical.propDecidable Classical.decEq

/-- PDF p.4, immediately after Property 2: K_D<=E_F for every bipartite
state, with the actual normalized pure-ensemble convex roof. -/
theorem key_bounded_by_formation {a b : ℕ} (ha : 0 < a) (hb : 0 < b)
    (rho : Matrix (Fin a × Fin b) (Fin a × Fin b) ℂ) (hrho : IsDensityMatrix rho) :
    distillableKey rho ≤ ENNReal.ofReal (Information100.P08.formation rho) := by sorry

end

end QAlgorithms.Papers.Independent.Gap48.P42
Source
Quantum states representing perfectly secure bits are always distillable, arXiv:quant-ph/0602176v2, PDF p. 4, III, consequence immediately after Property 2
Read-back

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

For all positive natural numbers a,ba,ba,b and every positive semidefinite trace-one matrix ρ\rhoρ on Ca⊗Cb\mathbb C^a\otimes\mathbb C^bCa⊗Cb, the extended nonnegative quantity KD(ρ)K_D(\rho)KD​(ρ) is at most ofReal⁡(EF(ρ))\operatorname{ofReal}(E_F(\rho))ofReal(EF​(ρ)), where ofReal⁡(x)=max⁡(x,0)\operatorname{ofReal}(x)=\max(x,0)ofReal(x)=max(x,0) viewed in [0,∞][0,\infty][0,∞]. Here EF(ρ)E_F(\rho)EF​(ρ) is the real infimum of ∑ν<qpνS(Tr⁡B∣vν⟩⟨vν∣)\sum_{\nu<q}p_\nu S(\operatorname{Tr}_B|v_\nu\rangle\langle v_\nu|)∑ν<q​pν​S(TrB​∣vν​⟩⟨vν​∣) over every finite ensemble of unit vectors with nonnegative weights summing to 111 and ρ=∑ν<qpν∣vν⟩⟨vν∣\rho=\sum_{\nu<q}p_\nu|v_\nu\rangle\langle v_\nu|ρ=∑ν<q​pν​∣vν​⟩⟨vν​∣; zero weights are permitted, and an ensemble of size zero cannot meet the weight-sum condition. The entropy is S(σ)=−Re⁡tr⁡f(σ)S(\sigma)=-\operatorname{Re}\operatorname{tr}f(\sigma)S(σ)=−Retrf(σ), with f(x)=xlog⁡2xf(x)=x\log_2xf(x)=xlog2​x evaluated by continuous functional calculus, and (Tr⁡BX)x,x′=∑yX(x,y),(x′,y)(\operatorname{Tr}_B X)_{x,x'}=\sum_yX_{(x,y),(x',y)}(TrB​X)x,x′​=∑y​X(x,y),(x′,y)​. The quantity KD(ρ)K_D(\rho)KD​(ρ) is the supremum of ofReal⁡(r)\operatorname{ofReal}(r)ofReal(r) over nonnegative real rates rrr such that every ε,δ>0\varepsilon,\delta>0ε,δ>0 admits a threshold after which every positive integer nnn has positive integers d,s,td,s,td,s,t, a shield density matrix τ\tauτ on Cs⊗Ct\mathbb C^s\otimes\mathbb C^tCs⊗Ct, a family of shield unitaries UiU_iUi​ indexed by i<di<di<d, and a finite local-operations map LLL satisfying ∥L(ρ⊗n)−Γ(τ,U)∥1≤ε\|L(\rho^{\otimes n})-\Gamma(\tau,U)\|_1\le\varepsilon∥L(ρ⊗n)−Γ(τ,U)∥1​≤ε and r−δ≤log⁡2d/nr-\delta\le\log_2d/nr−δ≤log2​d/n. The matrix Γ(τ,U)\Gamma(\tau,U)Γ(τ,U), with local dimensions ds,dtds,dtds,dt, has key block d−1UiτUj†d^{-1}U_i\tau U_j^\daggerd−1Ui​τUj†​ when the two row keys both equal iii and the two column keys both equal jjj, and is zero otherwise; local key–shield indices and tensor copies are regrouped using the fixed cardinality bijections. The trace norm is ∥Z∥1=Re⁡tr⁡Z†Z\|Z\|_1=\operatorname{Re}\operatorname{tr}\sqrt{Z^\dagger Z}∥Z∥1​=RetrZ†Z​. The allowed maps are exactly those generated by finitely many identities and recursions X↦∑jLj[(Aj⊗I)X(Aj⊗I)†]X\mapsto\sum_jL_j[(A_j\otimes I)X(A_j\otimes I)^\dagger]X↦∑j​Lj​[(Aj​⊗I)X(Aj​⊗I)†], with ∑jAj†Aj=I\sum_jA_j^\dagger A_j=I∑j​Aj†​Aj​=I, or the corresponding recursion on the other party, where each continuation LjL_jLj​ is again allowed. Dimensions a=1a=1a=1, b=1b=1b=1, and target key dimension d=1d=1d=1 are included.

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

    Confirmed by the moderator at approval.

  • Endorsed by Goku · Oct 22, 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