A New Proof of Nonsignalling Multiprover Parallel Repetition Theorem
Information Theory
2019-02-01 v1 math.IT
Abstract
We present an information theoretic proof of the nonsignalling multiprover parallel repetition theorem, a recent extension of its two-prover variant that underlies many hardness of approximation results. The original proofs used de Finetti type decomposition for strategies. We present a new proof that is based on a technique we introduced recently for proving strong converse results in multiuser information theory and entails a change of measure after replacing hard information constraints with soft ones.
Cite
@article{arxiv.1901.11105,
title = {A New Proof of Nonsignalling Multiprover Parallel Repetition Theorem},
author = {Himanshu Tyagi and Shun Watanabe},
journal= {arXiv preprint arXiv:1901.11105},
year = {2019}
}