Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Main result: explicit 4 ⊗ 4 PPT bound entanglement with positive one-way key rate (Eq.16)

Open
QAlgorithms.Papers.Independent.Intakenext100.P37.hadamard_boundEntangled_positiveKey

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

prove2quantum

Let H=2−1/2(111−1)H=2^{-1/2}\begin{pmatrix}1&1\\1&-1\end{pmatrix}H=2−1/2(11​1−1​), and let ρH\rho_HρH​ be the state computed from U=HU=HU=H by Eqs. (9)–(11). The key registers A,BA,BA,B and shields A′,B′A',B'A′,B′ are qubits; Alice owns AA′AA'AA′ and Bob owns BB′BB'BB′. Then ρH\rho_HρH​ is a density matrix, is invariant under transposition of BB′BB'BB′, is nonseparable across AA′:BB′AA':BB'AA′:BB′, and has zero asymptotic LOCC Bell-pair yield. Moreover, with binary entropy hhh in bits,

rH=1−h ⁣(21+2)>0,KD(ρH)≥rH.r_H=1-h\!\left(\frac{\sqrt2}{1+\sqrt2}\right)>0,\qquad K_D(\rho_H)\ge r_H.rH​=1−h(1+2​2​​)>0,KD​(ρH​)≥rH​.

Measuring A,BA,BA,B in the computational basis and applying one sequence of forward public-discussion protocols achieves rHr_HrH​ bits per independent input copy. This sequence is selected before any finite-dimensional purifying Eve; its evaluated public transcript is included in the secrecy criterion. Shields remain private and unused. The result supplies the explicit 4⊗44\otimes44⊗4 resource, without claiming a universal lower bound on dimension or equating the rounded printed decimal to the exact rate.

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.1--3, abstract and Eq.(16): explicit 4 tensor 4 PPT bound
entanglement and its exact positive one-way yield. No universal minimal-dimension
claim is made, and the rounded printed decimal is not used as an exact equality. -/
theorem hadamard_boundEntangled_positiveKey :
    IsDensityMatrix rhoHadamard ∧ transposeBob rhoHadamard = rhoHadamard ∧
    ¬ Entanglement.IsSeparableDensity (partyCut rhoHadamard) ∧
    Gap48.P42.bipartiteDistillable (physicalFin rhoHadamard) = 0 ∧
    0 < hadamardRate ∧ HasMeasuredOneWayRate rhoHadamard hadamardRate ∧
    ENNReal.ofReal hadamardRate ≤ Gap48.P42.distillableKey (physicalFin rhoHadamard) := 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. 1, Main result: explicit 4 ⊗ 4 PPT bound entanglement with positive one-way key rate (Eq.16)
Read-back

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

Let H=2−1/2(111−1)H=2^{-1/2}\bigl(\begin{smallmatrix}1&1\\1&-1\end{smallmatrix}\bigr)H=2−1/2(11​1−1​), let W(i,j),(k,l)=HijW_{(i,j),(k,l)}=H_{ij}W(i,j),(k,l)​=Hij​ if i=li=li=l and j=kj=kj=k, and let this entry be zero otherwise. Write Z(i,j),(k,l)T2=Z(i,l),(k,j)Z^{T_2}_{(i,j),(k,l)}=Z_{(i,l),(k,j)}Z(i,j),(k,l)T2​​=Z(i,l),(k,j)​, and, in key order 00,01,10,1100,01,10,1100,01,10,11, set

X(Z)=12(ZZ∗00Z00000000Z∗00Z∗Z),ρH=21+2X ⁣(W22)+11+2FX ⁣(WT22)F∗,\mathcal X(Z)=\frac12 \begin{pmatrix} \sqrt{ZZ^*}&0&0&Z\\ 0&0&0&0\\ 0&0&0&0\\ Z^*&0&0&\sqrt{Z^*Z} \end{pmatrix}, \quad \rho_H=\frac{\sqrt2}{1+\sqrt2}\mathcal X\!\left(\frac W{2\sqrt2}\right) +\frac1{1+\sqrt2}F\mathcal X\!\left(\frac{W^{T_2}}2\right)F^*,X(Z)=21​​ZZ∗​00Z∗​0000​0000​Z00Z∗Z​​​,ρH​=1+2​2​​X(22​W​)+1+2​1​FX(2WT2​​)F∗,

where FFF flips Alice’s key bit. Put rH=1−h2(2/(1+2))r_H=1-h_2(\sqrt2/(1+\sqrt2))rH​=1−h2​(2​/(1+2​)), where h2(x)=[−xlog⁡x−(1−x)log⁡(1−x)]/log⁡2h_2(x)=[-x\log x-(1-x)\log(1-x)]/\log2h2​(x)=[−xlogx−(1−x)log(1−x)]/log2, with zero logarithmic terms interpreted as zero. The declaration asserts that ρH\rho_HρH​ is positive semidefinite with trace one; it is unchanged by transposing Bob’s key and shield indices, namely

(ρH)(r,s,α,β),(r′,s′,α′,β′)=(ρH)(r,s′,α,β′),(r′,s,α′,β);(\rho_H)_{(r,s,\alpha,\beta),(r',s',\alpha',\beta')} =(\rho_H)_{(r,s',\alpha,\beta'),(r',s,\alpha',\beta)};(ρH​)(r,s,α,β),(r′,s′,α′,β′)​=(ρH​)(r,s′,α,β′),(r′,s,α′,β)​;

its matrix across the party split (r,α):(s,β)(r,\alpha):(s,\beta)(r,α):(s,β) cannot be expressed as a finite convex combination ∑jwjAj⊗Bj\sum_jw_jA_j\otimes B_j∑j​wj​Aj​⊗Bj​ with wj≥0w_j\ge0wj​≥0, ∑jwj=1\sum_jw_j=1∑j​wj​=1, and all Aj,BjA_j,B_jAj​,Bj​ positive semidefinite of trace one; its bipartite distillable quantity described below is zero; and

0<rH,M(ρH,rH),rH≤K(ρ^H).0<r_H,\qquad \mathcal M(\rho_H,r_H),\qquad r_H\le\mathcal K(\widehat\rho_H).0<rH​,M(ρH​,rH​),rH​≤K(ρ​H​).

Here ρ^H\widehat\rho_Hρ​H​ is the party-split matrix reindexed onto Fin⁡(4)×Fin⁡(4)\operatorname{Fin}(4)\times\operatorname{Fin}(4)Fin(4)×Fin(4) using the fixed chosen bijections Fin⁡(2)×Fin⁡(2)≃Fin⁡(4)\operatorname{Fin}(2)\times\operatorname{Fin}(2)\simeq\operatorname{Fin}(4)Fin(2)×Fin(2)≃Fin(4), and ∥X∥1=Re⁡tr⁡X∗X\|X\|_1=\operatorname{Re}\operatorname{tr}\sqrt{X^*X}∥X∥1​=RetrX∗X​. The condition M(ρ,r)\mathcal M(\rho,r)M(ρ,r) means that there is one sequence of protocols, chosen before any purification, with the following property for every positive integer eee and every unit vector ψ\psiψ on key, shield, and Fin⁡(e)\operatorname{Fin}(e)Fin(e) whose pure-state matrix has shield-and-key marginal ρ\rhoρ. Measuring both key indices and tracing out the shield gives blocks

Gi((j,u),(j′,v))=1j=j′∑sψ((i,j,s),u)ψ((i,j,s),v)‾;G_i((j,u),(j',v)) =\mathbf1_{j=j'}\sum_s\psi((i,j,s),u)\overline{\psi((i,j,s),v)};Gi​((j,u),(j′,v))=1j=j′​s∑​ψ((i,j,s),u)ψ((i,j,s),v)​;

set pi=Re⁡tr⁡Gip_i=\operatorname{Re}\operatorname{tr}G_ipi​=RetrGi​, and set Wi=Gi/piW_i=G_i/p_iWi​=Gi​/pi​ if pi≠0p_i\ne0pi​=0, otherwise Wi=I/(2e)W_i=I/(2e)Wi​=I/(2e). At each block length n≥0n\ge0n≥0, the protocol has positive transcript and key alphabet sizes ℓn,Mn\ell_n,M_nℓn​,Mn​, a stochastic encoder Qn(t,k∣x)Q_n(t,k\mid x)Qn​(t,k∣x) for binary strings xxx of length nnn, and a POVM {Dn,t,j}j\{D_{n,t,j}\}_j{Dn,t,j​}j​ on Bob’s nnn binary registers for every transcript ttt; a POVM consists of positive semidefinite matrices summing to the identity. With Bi=tr⁡EWiB_i=\operatorname{tr}_E W_iBi​=trE​Wi​, Ei=tr⁡BWiE_i=\operatorname{tr}_B W_iEi​=trB​Wi​, and px=∏ν=1npxνp_x=\prod_{\nu=1}^np_{x_\nu}px​=∏ν=1n​pxν​​, define

Jn(k,j)=∑x,tpxQn(t,k∣x)Re⁡tr⁡ ⁣(Dn,t,j⨂ν=1nBxν),Sn,k=⨁t∑xpxQn(t,k∣x)⨂ν=1nExν.J_n(k,j)=\sum_{x,t}p_xQ_n(t,k\mid x) \operatorname{Re}\operatorname{tr}\!\left(D_{n,t,j}\bigotimes_{\nu=1}^nB_{x_\nu}\right), \qquad S_{n,k}=\bigoplus_t\sum_xp_xQ_n(t,k\mid x)\bigotimes_{\nu=1}^nE_{x_\nu}.Jn​(k,j)=x,t∑​px​Qn​(t,k∣x)Retr(Dn,t,j​ν=1⨂n​Bxν​​),Sn,k​=t⨁​x∑​px​Qn​(t,k∣x)ν=1⨂n​Exν​​.

For this purification there must exist numbers εn≥0\varepsilon_n\ge0εn​≥0 tending to zero and a finite real F≥0F\ge0F≥0 such that, for every nnn, ℓn≤2nF\ell_n\le2^{nF}ℓn​≤2nF,

∑k≠jJn(k,j)≤εn,∑k∣Re⁡tr⁡Sn,k−Mn−1∣≤εn,\sum_{k\ne j}J_n(k,j)\le\varepsilon_n, \qquad \sum_k\left|\operatorname{Re}\operatorname{tr}S_{n,k}-M_n^{-1}\right|\le\varepsilon_n,k=j∑​Jn​(k,j)≤εn​,k∑​​RetrSn,k​−Mn−1​​≤εn​,

and there are density matrices ηn,k\eta_{n,k}ηn,k​ and a single density matrix ωn\omega_nωn​ on transcript and Eve such that

Sn,k=(Re⁡tr⁡Sn,k)ηn,k,∥ηn,k−ωn∥1≤εnfor every k,S_{n,k}=(\operatorname{Re}\operatorname{tr}S_{n,k})\eta_{n,k}, \qquad \|\eta_{n,k}-\omega_n\|_1\le\varepsilon_n \quad\text{for every }k,Sn,k​=(RetrSn,k​)ηn,k​,∥ηn,k​−ωn​∥1​≤εn​for every k,

including keys of zero weight, and log⁡2Mn/n→r\log_2M_n/n\to rlog2​Mn​/n→r. The quantity K(Z)\mathcal K(Z)K(Z) is the extended nonnegative supremum of all r≥0r\ge0r≥0 such that, for every ε,δ>0\varepsilon,\delta>0ε,δ>0, all sufficiently large positive nnn admit a finite LOCC map taking Z⊗nZ^{\otimes n}Z⊗n within trace norm ε\varepsilonε of a private matrix with positive key dimension DDD, positive local shield dimensions, a shield density matrix τ\tauτ, and shield unitaries ViV_iVi​, whose key blocks vanish except between iiiiii and jjjjjj, where they equal D−1ViτVj∗D^{-1}V_i\tau V_j^*D−1Vi​τVj∗​, with r−δ≤log⁡2D/nr-\delta\le\log_2D/nr−δ≤log2​D/n. Such a map is built recursively from identities and complete finite local Kraus instruments, with the continuation allowed to depend on the instrument outcome and the final branches summed. The bipartite distillable quantity asserted to vanish is the extended nonnegative supremum of r≥0r\ge0r≥0 satisfying the analogous “every accuracy, every rate tolerance, every sufficiently large positive block length” condition for deterministic finite LOCC conversion to a density matrix within trace norm ε\varepsilonε of ((∣00⟩+∣11⟩)(⟨00∣+⟨11∣)/2)⊗m((|00\rangle+|11\rangle)(\langle00|+\langle11|)/2)^{\otimes m}((∣00⟩+∣11⟩)(⟨00∣+⟨11∣)/2)⊗m, with r−δ≤m/nr-\delta\le m/nr−δ≤m/n; its finite LOCC protocols allow local Kraus instruments, outcome-dependent continuation, and forgetting outcomes by mixing branches of common dimensions.

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