Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Unnumbered experimentally estimable lower bound, Eq.18

Open
QAlgorithms.Papers.Independent.Intakenext100.P37.twirledEntropy_key_lower_bound

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

prove2quantum

Let ∣ψ⟩ABE|\psi\rangle_{ABE}∣ψ⟩ABE​ be a unit vector before measurement, where A,BA,BA,B are qubits and EEE is any positive finite-dimensional register. Let σAB\sigma_{AB}σAB​ be its reduced density matrix, let σABEccq\sigma^{\rm ccq}_{ABE}σABEccq​ be its computational measurement on A,BA,BA,B, and let T\mathcal TT be pinching in the four standard Bell projectors. Write IZ(σ)I_Z(\sigma)IZ​(σ) for the mutual information of the computational outcomes of the untwirled σ\sigmaσ. Then

K→(σABEccq)≥IZ(σAB)−S(T(σAB)).K_{\to}(\sigma^{\rm ccq}_{ABE})\ge I_Z(\sigma_{AB})-S(\mathcal T(\sigma_{AB})).K→​(σABEccq​)≥IZ​(σAB​)−S(T(σAB​)).

For any physical density matrix ρABA′B′\rho_{ABA'B'}ρABA′B′​ with positive finite shields, and any computational-key-controlled joint-shield unitary UτU_\tauUτ​, put σ=Tr⁡A′B′(UτρUτ†)\sigma=\operatorname{Tr}_{A'B'}(U_\tau\rho U_\tau^\dagger)σ=TrA′B′​(Uτ​ρUτ†​) and L=IZ(σ)−S(T(σ))L=I_Z(\sigma)-S(\mathcal T(\sigma))L=IZ​(σ)−S(T(σ)). Measuring the original key qubits and using one forward protocol sequence, chosen before every purifying Eve, achieves max⁡(0,L)\max(0,L)max(0,L), and KD(ρ)≥LK_D(\rho)\ge LKD​(ρ)≥L. This transfer uses a pessimistic Eve extension in the analysis. No nonlocal twisting is performed by the honest parties, and the original computational law is not equated to that of the Bell-pinched state.

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 pp.3--4, Eq.(18): measured, untwirled mutual information minus the
Bell-pinched entropy. Purity is required BEFORE measurement. The second clause
transfers the estimate to the physical premeasurement resource via privacy
squeezing; the controlled joint-shield unitary is never implemented as LOCC. -/
theorem twirledEntropy_key_lower_bound :
    (∀ e : ℕ, 0 < e → ∀ psi : EuclideanSpace ℂ (Fin 2 × (Fin 2 × Fin e)),
      ‖psi‖ = 1 →
      twirledExpression (Dependency50.P21.marginalAB (pureDensity psi)) ≤
        Frontier30.P12.quantumKeyCapacity (dephaseAB (pureDensity psi))) ∧
    (∀ a b : ℕ, 0 < a → 0 < b → ∀ rho : Op (Key 2 × (Fin a × Fin b)), IsDensityMatrix rho →
      ∀ U : Key 2 → Matrix.unitaryGroup (Fin a × Fin b) ℂ,
        HasMeasuredOneWayRate rho (max 0 (twirledExpression (traceRight (twist U rho)))) ∧
        ENNReal.ofReal (twirledExpression (traceRight (twist U rho))) ≤
          Gap48.P42.distillableKey (physicalFin 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 experimentally estimable lower bound, Eq.18
Read-back

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

Write Πv=vv†\Pi_v=vv^\daggerΠv​=vv†, Φ±=(∣00⟩±∣11⟩)/2\Phi_\pm=(|00\rangle\pm|11\rangle)/\sqrt2Φ±​=(∣00⟩±∣11⟩)/2​, Ψ±=(∣01⟩±∣10⟩)/2\Psi_\pm=(|01\rangle\pm|10\rangle)/\sqrt2Ψ±​=(∣01⟩±∣10⟩)/2​, and define

B(σ)=∑v∈{Φ+,Φ−,Ψ+,Ψ−}ΠvσΠv,T(σ)=∑i,j=01pijlog⁡2pij(∑lpil)(∑kpkj)−S(B(σ)),pij=Re⁡σ(i,j),(i,j).\mathcal B(\sigma)=\sum_{v\in\{\Phi_+,\Phi_-,\Psi_+,\Psi_-\}}\Pi_v\sigma\Pi_v,\qquad T(\sigma)=\sum_{i,j=0}^1p_{ij}\log_2\frac{p_{ij}}{(\sum_l p_{il})(\sum_kp_{kj})}-S(\mathcal B(\sigma)), \quad p_{ij}=\operatorname{Re}\sigma_{(i,j),(i,j)}.B(σ)=v∈{Φ+​,Φ−​,Ψ+​,Ψ−​}∑​Πv​σΠv​,T(σ)=i,j=0∑1​pij​log2​(∑l​pil​)(∑k​pkj​)pij​​−S(B(σ)),pij​=Reσ(i,j),(i,j)​.

Here 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); logarithms and division are total, with log⁡0=0\log0=0log0=0 and division by zero equal to zero. First, for every positive integer eee and every unit vector ψ∈C2⊗(C2⊗Ce)\psi\in\mathbb C^2\otimes(\mathbb C^2\otimes\mathbb C^e)ψ∈C2⊗(C2⊗Ce), T(Tr⁡EΠψ)≤K(ΔABΠψ)T(\operatorname{Tr}_E\Pi_\psi)\le K(\Delta_{AB}\Pi_\psi)T(TrE​Πψ​)≤K(ΔAB​Πψ​), where ΔAB\Delta_{AB}ΔAB​ retains precisely the entries with both classical indices equal between row and column and sets all other entries to zero. Second, for every positive a,ba,ba,b, every density matrix ρ\rhoρ on a two-bit key and shield Ca⊗Cb\mathbb C^a\otimes\mathbb C^bCa⊗Cb, and every family of shield unitaries UkU_kUk​ indexed by the four key values kkk, put W=∑k∣k⟩⟨k∣⊗UkW=\sum_k|k\rangle\langle k|\otimes U_kW=∑k​∣k⟩⟨k∣⊗Uk​, ρ~=WρW†\widetilde\rho=W\rho W^\daggerρ​=WρW†, and σ=Tr⁡shieldρ~\sigma=\operatorname{Tr}_{\mathrm{shield}}\widetilde\rhoσ=Trshield​ρ​. There exists one classical-source protocol sequence attaining rate max⁡{0,T(σ)}\max\{0,T(\sigma)\}max{0,T(σ)} for every positive-dimensional unit-vector purification φ\varphiφ of ρ\rhoρ, and max⁡{T(σ),0}≤KD(ρphys)\max\{T(\sigma),0\}\le K_D(\rho_{\mathrm{phys}})max{T(σ),0}≤KD​(ρphys​) in [0,∞][0,\infty][0,∞], where ρphys\rho_{\mathrm{phys}}ρphys​ regroups Alice's key and shield and Bob's key and shield into dimensions 2a,2b2a,2b2a,2b using the fixed finite-type bijections. The operational meanings are the following: K(η)K(\eta)K(η) is the real supremum of rates attained by quantum-source protocols which, at every natural copy number vvv, including zero, use a POVM Qt,kQ_{t,k}Qt,k​ on Alice's vvv registers and transcript-dependent POVMs Dt,jD_{t,j}Dt,j​ on Bob's registers, with positive transcript and key sizes lv,mvl_v,m_vlv​,mv​; their unnormalized branches are Tt,k=Tr⁡A[η⊗v(Qt,k⊗I)]T_{t,k}=\operatorname{Tr}_A[\eta^{\otimes v}(Q_{t,k}\otimes I)]Tt,k​=TrA​[η⊗v(Qt,k​⊗I)], their joint probabilities are Jkj=∑tRe⁡tr⁡[Dt,jTr⁡ETt,k]J_{kj}=\sum_t\operatorname{Re}\operatorname{tr}[D_{t,j}\operatorname{Tr}_E T_{t,k}]Jkj​=∑t​Retr[Dt,j​TrE​Tt,k​], and their key-conditioned transcript–Eve blocks sks_ksk​ have diagonal transcript blocks Tr⁡BTt,k\operatorname{Tr}_B T_{t,k}TrB​Tt,k​. Attainment requires nonnegative errors εv→0\varepsilon_v\to0εv​→0, one finite F≥0F\ge0F≥0, lv≤2vFl_v\le2^{vF}lv​≤2vF, ∑k≠jJkj≤εv\sum_{k\ne j}J_{kj}\le\varepsilon_v∑k=j​Jkj​≤εv​, ∑k∣Re⁡tr⁡sk−1/mv∣≤εv\sum_k|\operatorname{Re}\operatorname{tr}s_k-1/m_v|\le\varepsilon_v∑k​∣Retrsk​−1/mv​∣≤εv​, density matrices ηk,ω\eta_k,\omegaηk​,ω with (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​, and log⁡2(mv)/v→r\log_2(m_v)/v\to rlog2​(mv​)/v→r. For the classical-source assertion, the source associated with φ\varphiφ is obtained by deleting off-diagonal key blocks of Πφ\Pi_\varphiΠφ​ and tracing out the shield: let its Alice-iii block on Bob and Eve be BiB_iBi​, set pi=Re⁡tr⁡Bip_i=\operatorname{Re}\operatorname{tr}B_ipi​=RetrBi​, and use Zi=Bi/piZ_i=B_i/p_iZi​=Bi​/pi​ if pi≠0p_i\ne0pi​=0, or the maximally mixed Bob–Eve matrix if pi=0p_i=0pi​=0. A classical-source protocol replaces Qt,kQ_{t,k}Qt,k​ by a stochastic encoder qv(t,k∣x)q_v(t,k\mid x)qv​(t,k∣x) for words x∈{0,1}vx\in\{0,1\}^vx∈{0,1}v; then

Jkj=∑x,t(∏hpxh)qv(t,k∣x)Re⁡tr⁡ ⁣[Dt,j⨂hTr⁡EZxh],(sk)t,t=∑x(∏hpxh)qv(t,k∣x)⨂hTr⁡BZxh,J_{kj}=\sum_{x,t}\Bigl(\prod_h p_{x_h}\Bigr)q_v(t,k\mid x) \operatorname{Re}\operatorname{tr}\!\left[D_{t,j}\bigotimes_h\operatorname{Tr}_E Z_{x_h}\right],\qquad (s_k)_{t,t}=\sum_x\Bigl(\prod_h p_{x_h}\Bigr)q_v(t,k\mid x) \bigotimes_h\operatorname{Tr}_B Z_{x_h},Jkj​=x,t∑​(h∏​pxh​​)qv​(t,k∣x)Retr[Dt,j​h⨂​TrE​Zxh​​],(sk​)t,t​=x∑​(h∏​pxh​​)qv​(t,k∣x)h⨂​TrB​Zxh​​,

and all the same attainment conditions apply; the protocol sequence must be independent of the purification, though its error sequence and FFF may depend on that purification. Finally, KDK_DKD​ is the supremum in [0,∞][0,\infty][0,∞] of nonnegative rates rrr such that, for every α,δ>0\alpha,\delta>0α,δ>0, every sufficiently large positive vvv allows a finite local-operations-and-classical-communication map from ρphys⊗v\rho_{\mathrm{phys}}^{\otimes v}ρphys⊗v​ to within trace norm α\alphaα of a private matrix with positive key size ddd, positive shield dimensions, density shield τ\tauτ, and key blocks d−1ViτVj†d^{-1}V_i\tau V_j^\daggerd−1Vi​τVj†​ at (ii,jj)(ii,jj)(ii,jj), zero elsewhere, satisfying r−δ≤log⁡2(d)/vr-\delta\le\log_2(d)/vr−δ≤log2​(d)/v. These finite communication maps are generated recursively by identities and finite complete local Kraus measurements followed by outcome-dependent maps and summed branches; all POVMs consist of positive semidefinite effects summing to identity, and all density matrices are positive semidefinite with trace one.

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