Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Observation 3: nonzero volume of PPT key-distillable states in 4⊗4

Open
QAlgorithms.Papers.Independent.Intakenext100.P37.pptKey_nonzeroVolume_fourByFour

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

prove2quantum

Let ρH\rho_HρH​ denote the physical 4⊗44\otimes44⊗4 Hadamard resource and let ∥⋅∥2\|\cdot\|_2∥⋅∥2​ denote the Hilbert–Schmidt norm. There exist q∈(0,1)q\in(0,1)q∈(0,1) and ε>0\varepsilon>0ε>0 such that every Hermitian trace-one matrix σ\sigmaσ satisfying

∥σ−(qρH+(1−q)I16/16)∥2<ε\left\|\sigma-\left(q\rho_H+(1-q)I_{16}/16\right)\right\|_2<\varepsilon∥σ−(qρH​+(1−q)I16​/16)∥2​<ε

is a density matrix, is PPT across Alice and Bob, and has KD(σ)>0K_D(\sigma)>0KD​(σ)>0. This full-dimensional open ball in the real affine space of Hermitian trace-one matrices witnesses nonzero volume of PPT key-distillable states. The noisy center, with signal weight sufficiently close to one, corrects the printed proof's center and direction of noise. The conclusion concerns all PPT key states, not the low-parameter exact family ρU\rho_UρU​.

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, Observation 3: a full-dimensional affine ball of PPT key states.
Correction: its center is q rho_H+(1-q)I/16, with q<1 close to ONE, not rho_H.
The set is all PPT key states; the exact low-parameter rho_U family is not full-volume.
The affine ball explicitly witnesses nonzero volume. -/
theorem pptKey_nonzeroVolume_fourByFour :
    ∃ q : ℝ, 0 < q ∧ q < 1 ∧ ∃ eps : ℝ, 0 < eps ∧
      ∀ sigma : Op (Fin 4 × Fin 4), sigma.IsHermitian → sigma.trace = 1 →
        squaredDistance sigma
          ((q : ℂ) • physicalFin rhoHadamard + (((1-q)/16 : ℝ) : ℂ) • 1) < eps^2 →
        IsPPTWithKey sigma := 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, Observation 3: nonzero volume of PPT key-distillable states in 4⊗4
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}\begin{pmatrix}1&1\\1&-1\end{pmatrix}H=2−1/2(11​1−1​), W(i,j),(k,l)=Hij1{i=l, j=k}W_{(i,j),(k,l)}=H_{ij}\mathbf1_{\{i=l,\ j=k\}}W(i,j),(k,l)​=Hij​1{i=l, j=k}​, and V(i,j),(k,l)=W(i,l),(k,j)V_{(i,j),(k,l)}=W_{(i,l),(k,j)}V(i,j),(k,l)​=W(i,l),(k,j)​, with indices in {0,1}\{0,1\}{0,1}. For a shield matrix XXX, let X(X)\mathcal X(X)X(X) have key blocks 12XX†,12X,12X†,12X†X\frac12\sqrt{XX^\dagger},\frac12X,\frac12X^\dagger,\frac12\sqrt{X^\dagger X}21​XX†​,21​X,21​X†,21​X†X​ at positions (00,00),(00,11),(11,00),(11,11)(00,00),(00,11),(11,00),(11,11)(00,00),(00,11),(11,00),(11,11), respectively, and zero blocks elsewhere, and define

R=21+2X ⁣(W22)+11+2(F⊗I)X ⁣(V2)(F⊗I)†,F∣i,j⟩=∣1−i,j⟩.R=\frac{\sqrt2}{1+\sqrt2}\mathcal X\!\left(\frac W{2\sqrt2}\right) +\frac1{1+\sqrt2}(F\otimes I)\mathcal X\!\left(\frac V2\right)(F\otimes I)^\dagger, \quad F|i,j\rangle=|1-i,j\rangle.R=1+2​2​​X(22​W​)+1+2​1​(F⊗I)X(2V​)(F⊗I)†,F∣i,j⟩=∣1−i,j⟩.

Using the fixed bijection ℓ:{0,1}×{0,1}→{0,1,2,3}\ell:\{0,1\}\times\{0,1\}\to\{0,1,2,3\}ℓ:{0,1}×{0,1}→{0,1,2,3} supplied by the finite-type indexing, define its physical regrouping RphysR_{\mathrm{phys}}Rphys​ by

(Rphys)(ℓ(i,s),ℓ(j,t)),(ℓ(i′,s′),ℓ(j′,t′))=R((i,j),(s,t)),((i′,j′),(s′,t′)).(R_{\mathrm{phys}})_{(\ell(i,s),\ell(j,t)),(\ell(i',s'),\ell(j',t'))} =R_{((i,j),(s,t)),((i',j'),(s',t'))}.(Rphys​)(ℓ(i,s),ℓ(j,t)),(ℓ(i′,s′),ℓ(j′,t′))​=R((i,j),(s,t)),((i′,j′),(s′,t′))​.

There exist real numbers 0<q<10<q<10<q<1 and ϵ>0\epsilon>0ϵ>0 such that every Hermitian matrix σ\sigmaσ on C4⊗C4\mathbb C^4\otimes\mathbb C^4C4⊗C4 with complex trace exactly one and

∑x,y∈{0,1,2,3}2∣σxy−(qRphys+1−q16I)xy∣2<ϵ2\sum_{x,y\in\{0,1,2,3\}^2} \left|\sigma_{xy}-\left(qR_{\mathrm{phys}}+\frac{1-q}{16}I\right)_{xy}\right|^2 <\epsilon^2x,y∈{0,1,2,3}2∑​​σxy​−(qRphys​+161−q​I)xy​​2<ϵ2

is positive semidefinite, has positive semidefinite partial transpose (σΓ)(i,j),(k,l)=σ(i,l),(k,j)(\sigma^\Gamma)_{(i,j),(k,l)}=\sigma_{(i,l),(k,j)}(σΓ)(i,j),(k,l)​=σ(i,l),(k,j)​, and has strictly positive distillable key in the following precise sense. This key quantity is the supremum in [0,∞][0,\infty][0,∞] of the nonnegative real rates rrr for which, for every error tolerance α>0\alpha>0α>0 and rate tolerance δ>0\delta>0δ>0, all sufficiently large positive integers nnn admit positive integers d,s,td,s,td,s,t, a positive semidefinite trace-one shield matrix τ\tauτ on Cs⊗Ct\mathbb C^s\otimes\mathbb C^tCs⊗Ct, shield unitaries U0,…,Ud−1U_0,\ldots,U_{d-1}U0​,…,Ud−1​, and a finite local-operations-and-classical-communication map taking σ⊗n\sigma^{\otimes n}σ⊗n to within trace norm α\alphaα of the matrix whose key blocks are d−1UiτUj†d^{-1}U_i\tau U_j^\daggerd−1Ui​τUj†​ at (ii,jj)(ii,jj)(ii,jj) and zero elsewhere, regrouped into local dimensions ds,dtds,dtds,dt, with r−δ≤log⁡2(d)/nr-\delta\le\log_2(d)/nr−δ≤log2​(d)/n. Here finite local operations and classical communication means maps generated recursively by identity maps and finite local Kraus measurements satisfying ∑jKj†Kj=I\sum_jK_j^\dagger K_j=I∑j​Kj†​Kj​=I, followed by an outcome-dependent map of the same kind, with the outcome branches summed; the trace norm is Re⁡tr⁡X†X\operatorname{Re}\operatorname{tr}\sqrt{X^\dagger X}RetrX†X​. Positive semidefiniteness of σ\sigmaσ is a conclusion, not an additional hypothesis.

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