Toward Probabilistic Checking against Non-Signaling Strategies with Constant Locality

09/10/2020
by   Mohammad Mahdi Jahanara, et al.
0

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.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
03/11/2020

The Measure-and-Reprogram Technique 2.0: Multi-Round Fiat-Shamir and More

We revisit recent works by Don, Fehr, Majenz and Schaffner and by Liu an...
research
04/12/2019

Proceedings Joint International Workshop on Linearity Trends in Linear Logic and Applications

This volume contains a selection of papers presented at Linearity/TLLA 2...
research
03/09/2023

The Robustness Verification of Linear Sound Quantum Classifiers

I present a quick and sound method for the robustness verification of a ...
research
03/05/2018

Spatial Isolation Implies Zero Knowledge Even in a Quantum World

Zero knowledge plays a central role in cryptography and complexity. The ...
research
09/06/2020

Optimal Inapproximability of Satisfiable k-LIN over Non-Abelian Groups

A seminal result of Håstad [J. ACM, 48(4):798–859, 2001] shows that it i...
research
04/26/2022

Lattices Without a Big Constant and With Noise

We show how Frieze's analysis of subset sum solving using lattices can b...
research
09/27/2020

Quantum soundness of the classical low individual degree test

Low degree tests play an important role in classical complexity theory, ...

Please sign up or login with your details

Forgot password? Click here to reset