Entries of :
ProvedNoSignalPA.chsh_tensor_entrycryptographynonlocalityp2o-gran-per-chapterp2o-plan-paperp2o-v1privacy-amplificationquantum-information
For all bit strings ,
where is the bitwise product, the bitwise exclusive or, and the number of ones. The exponent counts the coordinates at which the CHSH condition fails; it governs every entrywise estimate in the proof of Lemma 2.
Differences from the source: none.
Preamble
import Mathlib import Definitions.Def_NoSignalPA_chshPow import Definitions.Def_NoSignalPA_ones
Formal statement
namespace NoSignalPA
/-- **The entries of `|CHSH⟩^{⊗Nr}`.**
Ll. Masanes, *Universally-composable privacy amplification from causality constraints*,
arXiv:0807.2158v4, Appendix, proof of Lemma 2, pp. 4–5 (PDF pp. 4–5): "Using this notation we can write the
entries of the vector `|CHSH⟩^{⊗Nr}` as `CHSH^{⊗Nr}(a, b, x, y) = 2^{−5Nr/2} 5^{‖a⊕b⊕x·y‖}`".
For all bit strings `a, b, x, y` of length `Nr`, the entry of the tensor power of the table (2)
is `2^{−5Nr/2} · 5^{‖a ⊕ b ⊕ x·y‖}`, where `x·y` is the bitwise product, `⊕` the bitwise xor and
`‖·‖` the number of ones.
**Formalization Note.** `2^{−5Nr/2}` is a real power. -/
theorem chsh_tensor_entry {Nr : ℕ} (a b x y : Str Nr) :
chshPow a b x y
= (2 : ℝ) ^ (-(5 * (Nr : ℝ)) / 2)
* 5 ^ ones (fun i => xor (xor (a i) (b i)) (x i && y i)) := by sorry
end NoSignalPA
Source
Masanes, Universally-composable privacy amplification from causality constraints, arXiv:0807.2158v4, Appendix, proof of Lemma 2, pp.4–5
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.