Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Unnumbered key lower bound for a ccq state, Eq.17

Open
QAlgorithms.Papers.Independent.Intakenext100.P37.ccq_entropy_key_lower_bound

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

prove2quantum

Let ρABE\rho_{ABE}ρABE​ be a density matrix on three positive finite-dimensional registers, classical in the specified computational bases of AAA and BBB. Eve's extension is this particular EEE, and SSS denotes von Neumann entropy in bits. Then the operational forward extraction capacity of this fixed ccq source satisfies

K→(ρABE)≥I(A:B)ρAB−S(ρE).K_{\to}(\rho_{ABE})\ge I(A:B)_{\rho_{AB}}-S(\rho_E).K→​(ρABE​)≥I(A:B)ρAB​​−S(ρE​).

Here ρAB\rho_{AB}ρAB​ and ρE\rho_EρE​ are the actual partial traces of ρABE\rho_{ABE}ρABE​, and I(A:B)=S(ρA)+S(ρB)−S(ρAB)I(A:B)=S(\rho_A)+S(\rho_B)-S(\rho_{AB})I(A:B)=S(ρA​)+S(ρB​)−S(ρAB​). The accepted capacity evaluates finite local measurements and forward authenticated public discussion on independent copies, includes the transcript with Eve, and lets the correctness and secrecy errors tend to zero. The bound remains valid when its right side is negative. It specializes Eq. (3) to the ccq setting; it is not the bipartite key capacity of the separable classical marginal.

Preamble
import Definitions.Def_QAlgorithms_Papers_Independent_Intakenext100_P37
Formal statement
noncomputable section

open scoped Matrix BigOperators ComplexConjugate ComplexOrder ENNReal

namespace QAlgorithms.Papers.Independent.Intakenext100.P37

attribute [local instance] Classical.propDecidable Classical.decEq

open QAlgorithms.Papers.Independent.Information100.P21 (Op)

open QAlgorithms.Papers.Independent.Dependency50.P24
  (Key IsPrivate xForm twist twistingMatrix associatedCCQ transposeSecond transposeBob partyCut)

/-- PDF p.3, Eq.(17): one-way extraction from a FIXED ccq source and its actual
Eve marginal. It is not bipartite key distillation of the separable AB marginal.
Negative right sides remain legitimate lower bounds. -/
theorem ccq_entropy_key_lower_bound {a b e : ℕ} (ha : 0 < a) (hb : 0 < b)
    (he : 0 < e) (rho : Op (Fin a × (Fin b × Fin e)))
    (hrho : IsDensityMatrix rho) (hccq : IsCCQ rho) :
    Frontier30.P12.quantumMutualInfo (Dependency50.P21.marginalAB rho) -
      vnEntropy (traceLeft (traceLeft rho)) ≤ Frontier30.P12.quantumKeyCapacity rho := by sorry

end QAlgorithms.Papers.Independent.Intakenext100.P37

end
Source
Low dimensional bound entanglement with one-way distillable cryptographic key, arXiv:quant-ph/0506203v1, PDF p. 3, Unnumbered key lower bound for a ccq state, Eq.17
Read-back

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

For every three positive integers a,b,ea,b,ea,b,e, let ρ\rhoρ be a complex matrix on Ca⊗(Cb⊗Ce)\mathbb C^a\otimes(\mathbb C^b\otimes\mathbb C^e)Ca⊗(Cb⊗Ce) that is positive semidefinite with trace one and satisfies

ρ(i,(j,u)),(i′,(j′,u′))=0whenever i≠i′ or j≠j′.\rho_{(i,(j,u)),(i',(j',u'))}=0 \quad\text{whenever }i\ne i'\text{ or }j\ne j'.ρ(i,(j,u)),(i′,(j′,u′))​=0whenever i=i′ or j=j′.

Let ρAB\rho_{AB}ρAB​ be obtained by tracing out the eee-dimensional register, and let ρE\rho_EρE​ be obtained by tracing out the first two registers. Then

S(Tr⁡BρAB)+S(Tr⁡AρAB)−S(ρAB)−S(ρE)≤K(ρ),S(\operatorname{Tr}_B\rho_{AB})+S(\operatorname{Tr}_A\rho_{AB}) -S(\rho_{AB})-S(\rho_E)\le K(\rho),S(TrB​ρAB​)+S(TrA​ρAB​)−S(ρAB​)−S(ρE​)≤K(ρ),

where S(X)=−Re⁡tr⁡[ x↦xlog⁡2x ](X)S(X)=-\operatorname{Re}\operatorname{tr}[\,x\mapsto x\log_2x\,](X)S(X)=−Retr[x↦xlog2​x](X), with matrix functional calculus and the total logarithm convention at zero. The quantity K(ρ)K(\rho)K(ρ) is the real supremum of rates rrr admitting the following protocol sequence. At each natural copy number vvv, including zero, choose positive integers lv,mvl_v,m_vlv​,mv​, a POVM {Qt,k}t<lv,k<mv\{Q_{t,k}\}_{t<l_v,k<m_v}{Qt,k​}t<lv​,k<mv​​ on AvA^vAv, and for every ttt a POVM {Dt,j}j<mv\{D_{t,j}\}_{j<m_v}{Dt,j​}j<mv​​ on BvB^vBv; POVM means positive semidefinite effects summing to the identity. With ρ⊗v\rho^{\otimes v}ρ⊗v grouped into registers Av,Bv,EvA^v,B^v,E^vAv,Bv,Ev, put

Tt,k=Tr⁡Av ⁣[ρ⊗v(Qt,k⊗I)],Jkj=∑tRe⁡tr⁡ ⁣[Dt,jTr⁡EvTt,k],T_{t,k}=\operatorname{Tr}_{A^v}\!\left[\rho^{\otimes v}(Q_{t,k}\otimes I)\right],\qquad J_{kj}=\sum_t\operatorname{Re}\operatorname{tr}\!\left[D_{t,j}\operatorname{Tr}_{E^v}T_{t,k}\right],Tt,k​=TrAv​[ρ⊗v(Qt,k​⊗I)],Jkj​=t∑​Retr[Dt,j​TrEv​Tt,k​],

and define sks_ksk​ on the transcript register and EvE^vEv by diagonal transcript blocks (sk)t,t=Tr⁡BvTt,k(s_k)_{t,t}=\operatorname{Tr}_{B^v}T_{t,k}(sk​)t,t​=TrBv​Tt,k​ and zero off-diagonal blocks. There must exist a real F≥0F\ge0F≥0 and nonnegative real errors εv→0\varepsilon_v\to0εv​→0 such that, for every vvv,

lv≤2vF,∑k≠jJkj≤εv,∑k∣Re⁡tr⁡sk−1mv∣≤εv,l_v\le2^{vF},\qquad \sum_{k\ne j}J_{kj}\le\varepsilon_v,\qquad \sum_k\left|\operatorname{Re}\operatorname{tr}s_k-\frac1{m_v}\right|\le\varepsilon_v,lv​≤2vF,k=j∑​Jkj​≤εv​,k∑​​Retrsk​−mv​1​​≤εv​,

and there exist density matrices ηk\eta_kηk​ and a single density matrix ω\omegaω, on transcript together with EvE^vEv, satisfying (Re⁡tr⁡sk)ηk=sk(\operatorname{Re}\operatorname{tr}s_k)\eta_k=s_k(Retrsk​)ηk​=sk​ and ∥ηk−ω∥1≤εv\|\eta_k-\omega\|_1\le\varepsilon_v∥ηk​−ω∥1​≤εv​ for every kkk; also log⁡2(mv)/v→r\log_2(m_v)/v\to rlog2​(mv​)/v→r. Here ∥X∥1=Re⁡tr⁡X†X\|X\|_1=\operatorname{Re}\operatorname{tr}\sqrt{X^\dagger X}∥X∥1​=RetrX†X​, an empty tensor product has every matrix entry equal to one, and division by zero at copy number zero is interpreted as zero. The definition of the supremum does not separately require r≥0r\ge0r≥0.

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