Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Unnumbered numerical upper bound for rho_H

Open
QAlgorithms.Papers.Independent.Intakenext100.P37.hadamard_relativeEntropy_upper_bound

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

prove2quantum

For the explicit physical 4⊗44\otimes44⊗4 state ρH\rho_HρH​, let ErE_rEr​ be the infimum of the base-two Umegaki relative entropy over normalized separable density matrices across AA′:BB′AA':BB'AA′:BB′. The reported numerical upper bound is

Er(ρH)≤1161000.E_r(\rho_H)\le\frac{116}{1000}.Er​(ρH​)≤1000116​.

Relative entropy is support-aware and extended-valued. This is an upper threshold, not an exact value or an equality with the one-way lower bound. The paper does not provide the separable witness or a certified numerical error bound, so the reported precision remains for independent moderation.

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, numerical upper-bound paragraph: the reported upper threshold
0.116 in bits. No particular separable witness or exact optimum is invented;
the absence of a numerical certificate remains an explicit moderation item. -/
theorem hadamard_relativeEntropy_upper_bound :
    Information100.P54.relativeEntanglement (partyCut rhoHadamard) ≤
      ENNReal.ofReal (116/1000 : ℝ) := 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 numerical upper bound for rho_H
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}. 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 (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 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, \qquad 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⟩.

Regard this matrix as bipartite by grouping Alice's key and shield coordinates together and Bob's key and shield coordinates together: R^((i,s),(j,t)),((i′,s′),(j′,t′))=R((i,j),(s,t)),((i′,j′),(s′,t′))\widehat R_{((i,s),(j,t)),((i',s'),(j',t'))}=R_{((i,j),(s,t)),((i',j'),(s',t'))}R((i,s),(j,t)),((i′,s′),(j′,t′))​=R((i,j),(s,t)),((i′,j′),(s′,t′))​. The infimum, over all separable density matrices ω\omegaω on this bipartite space, of D2(R^∥ω)D_2(\widehat R\|\omega)D2​(R∥ω) is at most 116/1000116/1000116/1000, as an inequality in [0,∞][0,\infty][0,∞]. Here a separable density matrix is a finite sum ω=∑j=0k−1wjAj⊗Bj\omega=\sum_{j=0}^{k-1}w_jA_j\otimes B_jω=∑j=0k−1​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 with trace one; the natural number kkk is existentially quantified, and k=0k=0k=0 cannot satisfy the weight normalization. For density matrices ξ,ω\xi,\omegaξ,ω,

D2(ξ∥ω)={max⁡ ⁣{Re⁡tr⁡(f(ξ)−ξ g(ω)),0}log⁡2,ker⁡ω⊆ker⁡ξ,+∞,otherwise,f(x)=xlog⁡x,g(x)=log⁡x,D_2(\xi\|\omega)= \begin{cases} \dfrac{\max\!\left\{\operatorname{Re}\operatorname{tr}\bigl(f(\xi)-\xi\,g(\omega)\bigr),0\right\}}{\log2}, &\ker\omega\subseteq\ker\xi,\\[4pt] +\infty,&\text{otherwise}, \end{cases} \quad f(x)=x\log x,\quad g(x)=\log x,D2​(ξ∥ω)=⎩⎨⎧​log2max{Retr(f(ξ)−ξg(ω)),0}​,+∞,​kerω⊆kerξ,otherwise,​f(x)=xlogx,g(x)=logx,

where the matrix functions use real continuous functional calculus and the total real logarithm has log⁡0=0\log0=0log0=0; if either matrix is not a density matrix, the defined divergence is +∞+\infty+∞.

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