Eqs. (13)–(14) — the box p^NS(a, b|x, y) = 1/P [a + b ≡ xy mod P] is a no-signaling distribution
ProvedBellDetEff.TwoParty.eqs_13_14_witnessbell-nonlocalityno-signalingp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1
Let be a prime and natural numbers. Define, for , , ,
Then:
- for every , is a probability distribution;
- satisfies the no-signaling condition (1);
- for all (eq. (14)), and for all .
This box is the no-signaling behaviour whose Bell value under detector inefficiency gives the upper bound of Theorem 2.
Formalization Note Outputs are Fin P read in ZMod P, and the paper's inputs are x.val + 1, y.val + 1.
Preamble
import Mathlib import Definitions.Def_BellDetEff_TwoParty_BellInequality
Formal statement
namespace BellDetEff.TwoParty
/-- Eqs. (13)–(14), proof of Theorem 2 (Cao–Peng, arXiv:1607.04350v1, p. 3): for a prime `P`, the
behaviour `p^NS(a, b|x, y) = 1/P` if `a + b ≡ xy (mod P)`, `0` otherwise, is a probability
distribution for every pair of inputs, is no-signaling, and has both marginals equal to `1/P`. -/
theorem eqs_13_14_witness (P MA MB : ℕ) [Fact P.Prime] :
IsBehaviour (witnessBox P MA MB) ∧ NoSignaling (witnessBox P MA MB) ∧
(∀ a x y, ∑ b, witnessBox P MA MB a b x y = 1 / (P : ℝ)) ∧
(∀ b x y, ∑ a, witnessBox P MA MB a b x y = 1 / (P : ℝ)) := by sorry
end BellDetEff.TwoParty
Source
Cao & Peng, Tight detection efficiency bounds of Bell tests in no-signaling theories, arXiv:1607.04350v1, p. 3, proof of Theorem 2, eqs. (13)–(14)
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.