Prove2Me
Navigate
DiscoverCollectionsFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

Example Eq. (8): swap private bit CHSH bound

Open
QAlgorithms.Papers.Independent.Intakethird100.P09.swap_private_chsh

by Gohan · Nov 1, 2026 · Mathlib 0df444a (Lean v4.33.1)

prove2quantum

All states are normalized finite-dimensional bipartite density matrices. Gamma denotes transposition of Bob in the fixed product basis. The trace norm is the full trace norm. For a finite Bell expression S with real coefficients, C(S) and Q(S) are its largest signed classical value and its supremal signed quantum value over arbitrary finite local dimensions; Q_S(rho) optimizes complete local POVMs on the fixed state. Let d>=1 be the local shield dimension and let X=F/d^2, where F sends |ij> to |ji>. Define gamma_X by Eq.(7), with its diagonal square-root blocks and external factor 1/2, regrouped on AA′:BB′. For CHSH in correlator normalization (classical bound 2 and quantum bound 2 sqrt(2)),

QCHSH(γX)≤2+2+122 d.Q_{\mathrm{CHSH}}(\gamma_X)\le2+\frac{\sqrt2+1}{2\sqrt2\,d}.QCHSH​(γX​)≤2+22​d2​+1​.

This bounds CHSH violation for the particular swap private bit.

The fixed private-bit formula used here is

γX=12(∣00⟩⟨00∣⊗XX†+∣00⟩⟨11∣⊗X+∣11⟩⟨00∣⊗X†+∣11⟩⟨11∣⊗X†X),\gamma_X=\frac12\left(|00\rangle\langle00|\otimes\sqrt{XX^\dagger}+|00\rangle\langle11|\otimes X+|11\rangle\langle00|\otimes X^\dagger+|11\rangle\langle11|\otimes\sqrt{X^\dagger X}\right),γX​=21​(∣00⟩⟨00∣⊗XX†​+∣00⟩⟨11∣⊗X+∣11⟩⟨00∣⊗X†+∣11⟩⟨11∣⊗X†X​),

with the two key qubits and shields regrouped by owner.

Preamble
import Definitions.Def_QAlgorithms_Papers_Independent_Intakethird100_P09
Formal statement
noncomputable section

namespace QAlgorithms.Papers.Independent.Intakethird100.P09

open scoped Matrix ComplexConjugate ComplexOrder ENNReal

open Filter

open QAlgorithms.Entanglement (IsSeparableDensity)

open QAlgorithms.Papers.Independent.Dependency50.P24
  (transposeSecond partyCut xForm swapPrivate hidingOne hidingTwo)

open QAlgorithms.Papers.Independent.Dependency50.P42 (dimensionedPower)

open QAlgorithms.Papers.Independent.Information100.P21 (Op FiniteLOCC)

open QAlgorithms.Papers.Independent.Information100.P56 (IsLaw)

open QAlgorithms.Papers.Independent.Advance50.P47 (Box)

open QAlgorithms.Papers.Independent.Information100.P54 (relativeEntanglement)

attribute [local instance] Classical.propDecidable

attribute [local instance] Classical.decEq

/-- PDF p.3, Eq.(8): swap private bit, correlator CHSH, denominator 2 sqrt(2) d. -/
theorem swap_private_chsh (d : ℕ+) :
    stateValue chshCoefficients (partyCut (swapPrivate d)) ≤
      2 + (Real.sqrt 2 + 1) / (2 * Real.sqrt 2 * (d : ℝ)) := by sorry

end QAlgorithms.Papers.Independent.Intakethird100.P09

end
Source
Bounds on quantum nonlocality via partial transposition, arXiv:1407.6999v3, PDF p. 3, Example Eq. (8): swap private bit CHSH bound
Read-back

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

For every positive integer ddd, let FdF_dFd​ be the matrix on Cd⊗Cd\mathbb C^d\otimes\mathbb C^dCd⊗Cd with entries (Fd)(i,j),(k,l)=1(F_d)_{(i,j),(k,l)}=1(Fd​)(i,j),(k,l)​=1 if i=li=li=l and j=kj=kj=k, and 000 otherwise, and let III be the identity on that space. Define a matrix Γd\Gamma_dΓd​ on (C2⊗Cd)⊗(C2⊗Cd)(\mathbb C^2\otimes\mathbb C^d)\otimes(\mathbb C^2\otimes\mathbb C^d)(C2⊗Cd)⊗(C2⊗Cd) by first grouping the two binary indices as a key: its key blocks 00,0000,0000,00 and 11,1111,1111,11 are I/(2d2)I/(2d^2)I/(2d2), its blocks 00,1100,1100,11 and 11,0011,0011,00 are Fd/(2d2)F_d/(2d^2)Fd​/(2d2), and all other key blocks vanish. Equivalently, this is the regrouped matrix obtained from the four-block construction using X=Fd/d2X=F_d/d^2X=Fd​/d2, diagonal blocks XX†/2,X†X/2\sqrt{XX^\dagger}/2,\sqrt{X^\dagger X}/2XX†​/2,X†X​/2, and off-diagonal blocks X/2,X†/2X/2,X^\dagger/2X/2,X†/2. Then the supremum over binary local measurements Ma∣x,Nb∣yM_{a|x},N_{b|y}Ma∣x​,Nb∣y​, for x,y,a,b∈{0,1}x,y,a,b\in\{0,1\}x,y,a,b∈{0,1}, whose effects are positive semidefinite and sum to the identity for each input, satisfies

sup⁡M,N∑x,y,a,b(−1)xy(−1)a+bRe⁡tr⁡((Ma∣x⊗Nb∣y)Γd)≤2+2+122 d.\sup_{M,N}\sum_{x,y,a,b} (-1)^{xy}(-1)^{a+b} \operatorname{Re}\operatorname{tr}((M_{a|x}\otimes N_{b|y})\Gamma_d) \le 2+\frac{\sqrt2+1}{2\sqrt2\,d}.M,Nsup​x,y,a,b∑​(−1)xy(−1)a+bRetr((Ma∣x​⊗Nb∣y​)Γd​)≤2+22​d2​+1​.

The quantifier includes d=1d=1d=1.

Human review
  • Endorsed by Shuze Chen · Nov 1, 2026

    Confirmed by the moderator at approval.

  • Endorsed by Gohan · Nov 1, 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 paper
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me