Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Unnumbered construction, Eqs.9–12: PPT-invariant key-bearing states rho_U

Open
QAlgorithms.Papers.Independent.Intakenext100.P37.unitaryConstruction_ppt_positiveKey

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

prove2quantum

Let d≥1d\ge1d≥1 and let U=(uij)U=(u_{ij})U=(uij​) be any unitary on Cd\mathbb C^dCd. Define WU=∑ijuij∣ij⟩⟨ji∣W_U=\sum_{ij}u_{ij}|ij\rangle\langle ji|WU​=∑ij​uij​∣ij⟩⟨ji∣, let Γ\GammaΓ transpose B′B'B′ only, and put s=∑ij∣uij∣s=\sum_{ij}|u_{ij}|s=∑ij​∣uij​∣, p1=s/(s+d)p_1=s/(s+d)p1​=s/(s+d), and p2=d/(s+d)p_2=d/(s+d)p2​=d/(s+d). Construct ρU\rho_UρU​ by Eq. (9) with X1=WU/sX_1=W_U/sX1​=WU​/s and X2=WUΓ/dX_2=W_U^\Gamma/dX2​=WUΓ​/d, retaining its two distinct positive square roots. Then ρU\rho_UρU​ is a density matrix, invariant under transposition of the physical Bob registers BB′BB'BB′, and

∥WU∥1=s,∥WUΓ∥1=d,p1,p2>0,p1+p2=1,p1p2=sd.\|W_U\|_1=s,\quad\|W_U^\Gamma\|_1=d,\quad p_1,p_2>0,\quad p_1+p_2=1,\quad\frac{p_1}{p_2}=\frac{s}{d}.∥WU​∥1​=s,∥WUΓ​∥1​=d,p1​,p2​>0,p1​+p2​=1,p2​p1​​=ds​.

If UUU has more than ddd nonzero entries, then rU=1−h(p1)>0r_U=1-h(p_1)>0rU​=1−h(p1​)>0, KD(ρU)≥rUK_D(\rho_U)\ge r_UKD​(ρU​)≥rU​, and measuring A,BA,BA,B followed by one sequence of forward public-discussion protocols achieves rUr_UrU​ for every purifying Eve. In this case ρU\rho_UρU​ is nonseparable across AA′:BB′AA':BB'AA′:BB′ and its LOCC Bell-pair yield is zero. This constructs the state from UUU rather than assuming witnesses for the blocks or the weights. Equivalently, when implementing this Eq. (9) matrix through the Alice-key flip of Eq. (1), the second unflipped private bit is the X-form of X2†X_2^\daggerX2†​, because that flip reverses the two odd corner blocks.

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.2, Eqs.(9)--(12): construction from U itself, PPT invariance on BB',
and strictly positive one-way key whenever there are more than d nonzero entries.
Printed root slips after Eq.(11) are corrected: the roots of WW-adjoint and
W-adjoint-W have diagonals |u_ij| and |u_ji|, respectively; observation (ii)
concerns the shield partial transpose of W. These actual roots are computed
by xForm, since direct multiplication determines them uniquely. The odd upper
block is X2 as in Eq.(9), using xForm (X2 adjoint) before the Alice-key flip. -/
theorem unitaryConstruction_ppt_positiveKey {d : ℕ} (hd : 0 < d)
    (U : Matrix.unitaryGroup (Fin d) ℂ) :
    letI : Nonempty (Fin d) := ⟨⟨0,hd⟩⟩
    let V : Op (Fin d) := U
    IsDensityMatrix (rhoUnitary V) ∧ transposeBob (rhoUnitary V) = rhoUnitary V ∧
    traceNorm (weightedSwap V) = entrySum V ∧
    traceNorm (transposeSecond (weightedSwap V)) = d ∧
    0 < weightOne V ∧ 0 < weightTwo V ∧ weightOne V + weightTwo V = 1 ∧
    weightOne V / weightTwo V = entrySum V / d ∧
    (d < nonzeroEntries V →
      0 < 1-binEntropy2 (weightOne V) ∧
      HasMeasuredOneWayRate (rhoUnitary V) (1-binEntropy2 (weightOne V)) ∧
      ENNReal.ofReal (1-binEntropy2 (weightOne V)) ≤
        Gap48.P42.distillableKey (physicalFin (rhoUnitary V)) ∧
      ¬ Entanglement.IsSeparableDensity (partyCut (rhoUnitary V)) ∧
      Gap48.P42.bipartiteDistillable (physicalFin (rhoUnitary V)) = 0) := 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. 2, Unnumbered construction, Eqs.9–12: PPT-invariant key-bearing states rho_U
Read-back

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

For every positive natural number ddd and every unitary complex d×dd\times dd×d matrix UUU, write V=UV=UV=U, let

W(i,j),(k,l)={Vij,i=l, j=k,0,otherwise,s=∑i,j<d∣Vij∣,w1=ss+d,w2=ds+d,W_{(i,j),(k,l)}= \begin{cases}V_{ij},&i=l,\ j=k,\\0,&\text{otherwise},\end{cases} \qquad s=\sum_{i,j<d}|V_{ij}|, \qquad w_1=\frac{s}{s+d},\quad w_2=\frac d{s+d},W(i,j),(k,l)​={Vij​,0,​i=l, j=k,otherwise,​s=i,j<d∑​∣Vij​∣,w1​=s+ds​,w2​=s+dd​,

and 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)​. For any shield matrix ZZZ, define, in key order 00,01,10,1100,01,10,1100,01,10,11,

X(Z)=12(ZZ∗00Z00000000Z∗00Z∗Z),ρV=w1X(W/s)+w2FX(WT2/d)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}, \qquad \rho_V=w_1\mathcal X(W/s)+w_2F\mathcal X(W^{T_2}/d)F^*,X(Z)=21​​ZZ∗​00Z∗​0000​0000​Z00Z∗Z​​​,ρV​=w1​X(W/s)+w2​FX(WT2​/d)F∗,

where FFF flips Alice’s key bit. The declaration asserts that ρV\rho_VρV​ is positive semidefinite with trace one and is invariant under transposition of Bob’s key and shield indices; explicitly, its entries satisfy

(ρV)(r,t,α,β),(r′,t′,α′,β′)=(ρV)(r,t′,α,β′),(r′,t,α′,β).(\rho_V)_{(r,t,\alpha,\beta),(r',t',\alpha',\beta')} =(\rho_V)_{(r,t',\alpha,\beta'),(r',t,\alpha',\beta)}.(ρV​)(r,t,α,β),(r′,t′,α′,β′)​=(ρV​)(r,t′,α,β′),(r′,t,α′,β)​.

It also asserts

∥W∥1=s,∥WT2∥1=d,0<w1,0<w2,w1+w2=1,w1w2=sd,\|W\|_1=s,\qquad \|W^{T_2}\|_1=d,\qquad 0<w_1,\quad0<w_2,\quad w_1+w_2=1,\quad \frac{w_1}{w_2}=\frac sd,∥W∥1​=s,∥WT2​∥1​=d,0<w1​,0<w2​,w1​+w2​=1,w2​w1​​=ds​,

where ∥X∥1=Re⁡tr⁡X∗X\|X\|_1=\operatorname{Re}\operatorname{tr}\sqrt{X^*X}∥X∥1​=RetrX∗X​. If the number of nonzero entries of VVV is strictly greater than ddd, it further asserts, with r=1−h2(w1)r=1-h_2(w_1)r=1−h2​(w1​),

0<r,M(ρV,r),r≤K(ρ^V),ρV is not separable across Alice and Bob,D(ρ^V)=0.0<r,\qquad \mathcal M(\rho_V,r),\qquad r\le\mathcal K(\widehat\rho_V),\qquad \rho_V\text{ is not separable across Alice and Bob},\qquad \mathcal D(\widehat\rho_V)=0.0<r,M(ρV​,r),r≤K(ρ​V​),ρV​ is not separable across Alice and Bob,D(ρ​V​)=0.

Here 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 zero; ρ^V\widehat\rho_Vρ​V​ is ρV\rho_VρV​ across the split (r,α):(t,β)(r,\alpha):(t,\beta)(r,α):(t,β), reindexed onto Fin⁡(2d)×Fin⁡(2d)\operatorname{Fin}(2d)\times\operatorname{Fin}(2d)Fin(2d)×Fin(2d) by the fixed chosen local bijections; and separability means a finite convex combination of tensor products of local positive semidefinite trace-one matrices. The condition M(ρ,r)\mathcal M(\rho,r)M(ρ,r) requires one protocol sequence chosen before any purification and working for every positive integer eee and every unit purification ψ\psiψ of ρ\rhoρ with purifying register Fin⁡(e)\operatorname{Fin}(e)Fin(e). For each purification, measuring the key indices and tracing out the shield gives

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)​;

put pi=Re⁡tr⁡Gip_i=\operatorname{Re}\operatorname{tr}G_ipi​=RetrGi​, and 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 every length n≥0n\ge0n≥0, the protocol has positive transcript and key 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) on binary strings xxx of length nnn, and a decoding POVM {Dn,t,j}j\{D_{n,t,j}\}_j{Dn,t,j​}j​ on Bob’s binary registers for each transcript ttt. Put Bi=tr⁡EWiB_i=\operatorname{tr}_E W_iBi​=trE​Wi​, Ei=tr⁡BWiE_i=\operatorname{tr}_B W_iEi​=trB​Wi​, px=∏ν=1npxνp_x=\prod_{\nu=1}^np_{x_\nu}px​=∏ν=1n​pxν​​, and

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 each purification there must exist εn≥0\varepsilon_n\ge0εn​≥0 tending to zero and a finite F≥0F\ge0F≥0 such that, for every nnn, ℓn≤2nF\ell_n\le2^{nF}ℓn​≤2nF, ∑k≠jJn(k,j)≤εn\sum_{k\ne j}J_n(k,j)\le\varepsilon_n∑k=j​Jn​(k,j)≤εn​, and ∑k∣Re⁡tr⁡Sn,k−Mn−1∣≤εn\sum_k|\operatorname{Re}\operatorname{tr}S_{n,k}-M_n^{-1}|\le\varepsilon_n∑k​∣RetrSn,k​−Mn−1​∣≤εn​; there must also be density matrices ηn,k\eta_{n,k}ηn,k​ and a common density matrix ωn\omega_nωn​ with Sn,k=(Re⁡tr⁡Sn,k)ηn,kS_{n,k}=(\operatorname{Re}\operatorname{tr}S_{n,k})\eta_{n,k}Sn,k​=(RetrSn,k​)ηn,k​ and ∥ηn,k−ωn∥1≤εn\|\eta_{n,k}-\omega_n\|_1\le\varepsilon_n∥ηn,k​−ωn​∥1​≤εn​ for every key, including zero-weight keys, 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 rates s0≥0s_0\ge0s0​≥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, shield density matrix τ\tauτ, and shield unitaries AiA_iAi​, whose only nonzero key blocks are D−1AiτAj∗D^{-1}A_i\tau A_j^*D−1Ai​τAj∗​ between iiiiii and jjjjjj, with s0−δ≤log⁡2D/ns_0-\delta\le\log_2D/ns0​−δ≤log2​D/n. Its finite LOCC maps are generated by identities and complete finite local Kraus instruments, with outcome-dependent continuations and summed branches. The quantity D(Z)\mathcal D(Z)D(Z) is the extended nonnegative supremum of rates s0≥0s_0\ge0s0​≥0 such that, for every ε,δ>0\varepsilon,\delta>0ε,δ>0, all sufficiently large positive nnn admit deterministic finite local Kraus protocols, allowing outcome-dependent continuation and forgetting outcomes by mixing branches of common dimensions, whose output is within trace norm ε\varepsilonε of mmm copies of (∣00⟩+∣11⟩)/2(|00\rangle+|11\rangle)/\sqrt2(∣00⟩+∣11⟩)/2​, with s0−δ≤m/ns_0-\delta\le m/ns0​−δ≤m/n. The case d=1d=1d=1 is included in the unconditional assertions; the further assertions are required only when the strict nonzero-entry-count hypothesis holds.

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