Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Unnumbered extension of Observation 3 to larger local dimensions

Open
QAlgorithms.Papers.Independent.Intakenext100.P37.pptKey_nonzeroVolume_larger

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

prove2quantum

Let m,n≥4m,n\ge4m,n≥4 be the two local Hilbert-space dimensions. Embed the physical Hadamard resource ρH\rho_HρH​ into the first four basis labels at each party, with zero elsewhere, and denote it by ρ^H\widehat\rho_Hρ​H​. 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σ with

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

is a density matrix, is PPT, and has strictly positive distillable key. Thus these states contain a full-dimensional affine ball and have nonzero volume in every such bipartite dimension. Both dimensions must be at least four; a bound on total dimension alone is not asserted.

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, sentence following Observation 3: the same full-dimensional ball
statement for all local dimensions m,n>=4, after local embedding and white noise. -/
theorem pptKey_nonzeroVolume_larger (m n : ℕ) (hm : 4 ≤ m) (hn : 4 ≤ n) :
    ∃ q : ℝ, 0 < q ∧ q < 1 ∧ ∃ eps : ℝ, 0 < eps ∧
      ∀ sigma : Op (Fin m × Fin n), sigma.IsHermitian → sigma.trace = 1 →
        squaredDistance sigma (noisyEmbeddedHadamard m n q) < 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, Unnumbered extension of Observation 3 to larger local dimensions
Read-back

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

For every pair of integers m,n≥4m,n\ge4m,n≥4, construct a fixed matrix RphysR_{\mathrm{phys}}Rphys​ on C4⊗C4\mathbb C^4\otimes\mathbb C^4C4⊗C4 as follows: set 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)​; let X(X)\mathcal X(X)X(X) have the four 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 (00,00),(00,11),(11,00),(11,11)(00,00),(00,11),(11,00),(11,11)(00,00),(00,11),(11,00),(11,11), and zero elsewhere; and put

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⟩.

Regroup the key and shield coordinates locally using the fixed finite-type bijection ℓ:{0,1}2→{0,1,2,3}\ell:\{0,1\}^2\to\{0,1,2,3\}ℓ:{0,1}2→{0,1,2,3}, so that (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′))​, and let Em,nE_{m,n}Em,n​ be its zero extension to Cm⊗Cn\mathbb C^m\otimes\mathbb C^nCm⊗Cn: its entries agree with RphysR_{\mathrm{phys}}Rphys​ when all four local row and column indices are less than four and are zero otherwise. There exist real 0<q<10<q<10<q<1 and ϵ>0\epsilon>0ϵ>0 such that every Hermitian matrix σ\sigmaσ on this larger space with complex trace exactly one and

∑x,y∈{0,…,m−1}×{0,…,n−1}∣σxy−(qEm,n+1−qmnI)xy∣2<ϵ2\sum_{x,y\in\{0,\ldots,m-1\}\times\{0,\ldots,n-1\}} \left|\sigma_{xy}-\left(qE_{m,n}+\frac{1-q}{mn}I\right)_{xy}\right|^2<\epsilon^2x,y∈{0,…,m−1}×{0,…,n−1}∑​​σxy​−(qEm,n​+mn1−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. The latter quantity is the supremum in [0,∞][0,\infty][0,∞] of all nonnegative real rrr such that, for every α,δ>0\alpha,\delta>0α,δ>0, every sufficiently large positive copy number vvv admits positive integers d,s,td,s,td,s,t, a density matrix τ\tauτ on Cs⊗Ct\mathbb C^s\otimes\mathbb C^tCs⊗Ct, unitaries UiU_iUi​ on that shield, and a finite local-operations-and-classical-communication map producing from σ⊗v\sigma^{\otimes v}σ⊗v a matrix within trace norm α\alphaα of the private matrix with key blocks 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)/vr-\delta\le\log_2(d)/vr−δ≤log2​(d)/v. Such maps are generated recursively by identities and finite local Kraus measurements with complete Kraus families, followed by outcome-dependent maps of the same kind and summation over outcomes; density means positive semidefinite with trace one, and ∥X∥1=Re⁡tr⁡X†X\|X\|_1=\operatorname{Re}\operatorname{tr}\sqrt{X^\dagger X}∥X∥1​=RetrX†X​. The witnesses q,ϵq,\epsilonq,ϵ may depend on m,nm,nm,n, and the universal neighborhood condition assumes no positivity of σ\sigmaσ in advance.

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