Imagine a task in which a group of separated players aim to simulate a statistic that violates a Bell inequality. Given measurement choices the players shall announce an output based solely on the results of local operations -- which they can discuss before the separation -- on shared random data and shared copies of a so-called unit correlation. In the first part of this article we show that in such a setting the simulation of any bipartite correlation, not containing the possibility of signaling, can be made arbitrarily accurate by increasing the number of shared Popescu-Rohrlich (PR) boxes. This establishes the PR box as a simple asymptotic unit of bipartite nonlocality. In the second part we study whether this property extends to the multipartite case. More generally, we ask if it is possible for separated players to asymptotically reproduce any nonsignaling statistic by local operations on bipartite unit correlations. We find that non-adaptive strategies are limited by a constant accuracy and that arbitrary strategies on n resource correlations make a mistake with a probability greater or equal to c/n, for some constant c.
This mission is the statement-level formalization of Bipartite Units of Non-Locality (arXiv:0808.0651v4). Every numbered result of the paper was scanned. The results stated here are open sorry goals, ready for solvers to prove.
6 statements of the paper are in Lean 4 (Mathlib 0df444a). The goal theorem is The corrected smaller resource is a permutation system (Lemma 1: the reduced resource is a permutation system (corrected construction), PDF p. 4). The milestones are the other numbered results, in the paper's order, each quoting the paper.
The paper's own objects are the definition item of this mission. Objects shared across papers come from the prove2quantum library and from earlier papers' missions, listed as references.
Provenance: prove2quantum's pipeline drafted each statement (gpt-6.1-sol on Stanford's Sherlock cluster). A blind read-back, written without seeing the paper, is attached to every item. An independent moderator compared each statement against the paper and passed the whole paper without edits.
12 results of the paper are not stated yet, because the library lacks an interface they need:
noncomputable section
open scoped BigOperators
namespace QAlgorithms.Papers.Independent.Intakethird100.P78
attribute [local instance] Classical.propDecidable Classical.decEq
/-- PDF pp.4–5, Lemma 1 (corrected construction): Dprime belongs to D.
Printed (7) is changed to test f(r_ahat(a)) = bhat before splicing; the
printed condition can map a surviving edge to the deleted output.
The reduction is restricted to d = m+1 > 2, because D excludes size 1.
Independent source-correction moderation is pending. -/
theorem reduced_resource_is_permutation
{X Y : Type} [Fintype X] [Fintype Y] [Nonempty X] [Nonempty Y]
{m : ℕ} (hm : 1 < m)
(F : X → Y → Equiv.Perm (Fin (m + 1))) :
IsPermutationSystem (reducedKernel (lt_trans Nat.zero_lt_one hm) F) := by sorry
end QAlgorithms.Papers.Independent.Intakethird100.P78
end
Let and be finite nonempty input alphabets, let , and for every let be a permutation of . The target permutation system assigns mass to each pair .
For a deleted label , let replace by and leave all other labels fixed. Define the corrected smaller map, for , by
The graph law of these maps, with mass , belongs to : every smaller map is a permutation and its output size is greater than one. Its local input alphabets are and .
This is the alphabet-reduction step used in the bipartite simulation construction. The condition in printed equation (7) is corrected as described in the audit; independent moderation of this source correction is pending.
No open leaves. Every sub-goal is proved or awaiting decomposition.