On the Parallel Repetition of Multi-Player Games: The No-Signaling Case

Open Access
Authors
Publication date 11-2014
Host editors
  • S.T. Flammia
  • A.W. Harrow
Book title 9th Conference on the Theory of Quantum Computation, Communication and Cryptography
Book subtitle TQC 2014, May 21-23, 2014, National University of Singapore, Singapore
ISBN (electronic)
  • 9783939897736
Series Leibniz International Proceedings in Informatics
Event 9th Conference on the Theory of Quantum Computation, Communication and Cryptography
Pages (from-to) 24-35
Number of pages 12
Publisher Saarbrücken/Wadern: Schloss Dagstuhl - Leibniz-Zentrum für Informatik
Organisations
  • Interfacultary Research - Institute for Logic, Language and Computation (ILLC)
  • Faculty of Science (FNWI)
Abstract
We consider the natural extension of two-player nonlocal games to an arbitrary number of players. An important question for such nonlocal games is their behavior under parallel repetition. For two-player nonlocal games, it is known that both the classical and the non-signaling value of any game converges to zero exponentially fast under parallel repetition, given that the game is non-trivial to start with (i.e., has classical/non-signaling value < 1). Very recent results show similar behavior of the quantum value of a two-player game under parallel repetition. For nonlocal games with three or more players, very little is known up to present on their behavior under parallel repetition; this is true for the classical, the quantum and the non-signaling value. In this work, we show a parallel repetition theorem for the non-signaling value of a large class of multi-player games, for an arbitrary number of players. Our result applies to all multi-player games for which all possible combinations of questions have positive probability; this class in particular includes all free games, in which the questions to the players are chosen independently. Specifically, we prove that if the original game G has a non-signaling value v_{ns}(G) < 1, then the non-signaling value of the n-fold parallel repetition is exponentially small in n. Stronger than that, we prove that the probability of winning more than (v_{ns}(G) + delta) * n parallel repetitions is exponentially small in n (for any delta > 0). Our parallel repetition theorem for multi-player games is weaker than the known parallel repetition results for two-player games in that the rate at which the non-signaling value of the game decreases not only depends on the non-signaling value of the original game (and the number of possible responses), but on the complete description of the game. Nevertheless, we feel that our result is a first step towards a better understanding of the parallel repetition of nonlocal games with more than two players.
Document type Conference contribution
Language English
Published at https://doi.org/10.4230/LIPIcs.TQC.2014.24
Other links http://drops.dagstuhl.de/opus/portals/lipics/index.php?semnr=14012
Downloads
On the Parallel Repetition of Multi (Final published version)
Permalink to this page
Back