Example Eq. (8): swap private bit CHSH bound
OpenQAlgorithms.Papers.Independent.Intakethird100.P09.swap_private_chshAll 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)),
This bounds CHSH violation for the particular swap private bit.
The fixed private-bit formula used here is
with the two key qubits and shields regrouped by owner.
import Definitions.Def_QAlgorithms_Papers_Independent_Intakethird100_P09
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
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
For every positive integer , let be the matrix on with entries if and , and otherwise, and let be the identity on that space. Define a matrix on by first grouping the two binary indices as a key: its key blocks and are , its blocks and are , and all other key blocks vanish. Equivalently, this is the regrouped matrix obtained from the four-block construction using , diagonal blocks , and off-diagonal blocks . Then the supremum over binary local measurements , for , whose effects are positive semidefinite and sum to the identity for each input, satisfies
The quantifier includes .
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.