Non-signaling strategies are a generalization of quantum strategies that have been studied in physics over the past three decades. Recently, they have found applications in theoretical computer science, including to proving inapproximability results for linear programming and to constructing protocols for delegating computation. A central tool for these applications is probabilistically checkable proof (PCPs) systems that are sound against non-signaling strategies. In this paper we show, assuming a certain geometrical hypothesis about noise robustness of non-signaling proofs (or, equivalently, about robustness to noise of solutions to the Sherali-Adams linear program), that a slight variant of the parallel repetition of the exponential-length constant-query PCP construction due to Arora et al. (JACM 1998) is sound against non-signaling strategies with constant locality. Our proof relies on the analysis of the linearity test and agreement test (also known as the direct product test) in the non-signaling setting.

中文翻译：

---

对具有恒定局部性的非信号策略进行概率检查

非信号策略是过去三十年物理学研究的量子策略的概括。最近，他们发现了理论计算机科学中的应用，包括证明线性规划的不可逼近性结果和构建用于委托计算的协议。这些应用程序的一个核心工具是概率可检查证明 (PCP) 系统，它可以很好地抵御非信令策略。在本文中，我们展示，假设关于非信号证明的噪声鲁棒性（或等效地，关于对 Sherali-Adams 线性程序的解的噪声鲁棒性）的某个几何假设，指数的并行重复的轻微变体由于 Arora 等人的 -length 常量查询 PCP 构造。(JACM 1998) 反对具有恒定局部性的非信号策略。我们的证明依赖于对非信令设置中的线性测试和一致性测试（也称为直接乘积测试）的分析。