ANCHORED PARALLEL REPETITION FOR NONLOCAL GAMES

被引:1
|
作者
Bavarian, Mohammad [1 ]
Vidick, Thomas [2 ]
Yuen, Henry [3 ]
机构
[1] MIT, Dept Math, Cambridge, MA 02139 USA
[2] CALTECH, Dept Comp & Math Sci, Pasadena, CA 91125 USA
[3] Columbia Univ, Dept Comp Sci, New York, NY 10027 USA
基金
加拿大自然科学与工程研究理事会;
关键词
nonlocal games; quantum complexity theory; quantum information; parallel repetition; hardness amplification; gap amplification; ERROR;
D O I
10.1137/21M1405927
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
We introduce a simple transformation on two-player nonlocal games, called "anchoring," and prove an exponential-decay parallel repetition theorem for all anchored games in the setting of quantum entangled players. This transformation is inspired in part by the Feige-Kilian transformation [SIAM J. Comput., 30 (2000), pp. 324-346], and has the property that if the quantum value of the original game G is v, then the quantum value of the anchored game G(perpendicular to) is 1 - (1 - alpha)(2) center dot (1 - v), where alpha is a parameter of the transformation. In particular the anchored game has quantum value 1 if and only if the original game G has quantum value 1. This provides the first gap amplification technique for general two-player nonlocal games that achieves exponential decay of the quantum value.
引用
收藏
页码:214 / 253
页数:40
相关论文
共 50 条
  • [1] Parallel Repetition of Two Prover Games
    Raz, Ran
    25TH ANNUAL IEEE CONFERENCE ON COMPUTATIONAL COMPLEXITY - CCC 2010, 2010, : 3 - 6
  • [2] PARALLEL REPETITION IN PROJECTION GAMES AND A CONCENTRATION BOUND
    Rao, Anup
    SIAM JOURNAL ON COMPUTING, 2011, 40 (06) : 1871 - 1891
  • [3] Parallel Repetition of Entangled Games [Extended Abstract]
    Kempe, Julia
    Vidick, Thomas
    STOC 11: PROCEEDINGS OF THE 43RD ACM SYMPOSIUM ON THEORY OF COMPUTING, 2011, : 353 - 362
  • [4] Small Value Parallel Repetition for General Games
    Braverman, Mark
    Garg, Ankit
    STOC'15: PROCEEDINGS OF THE 2015 ACM SYMPOSIUM ON THEORY OF COMPUTING, 2015, : 335 - 340
  • [5] Derandomized Parallel Repetition Theorems for Free Games
    Shaltiel, Ronen
    COMPUTATIONAL COMPLEXITY, 2013, 22 (03) : 565 - 594
  • [6] Derandomized parallel repetition theorems for free games
    Shaltiel, Ronen
    25TH ANNUAL IEEE CONFERENCE ON COMPUTATIONAL COMPLEXITY - CCC 2010, 2010, : 28 - 37
  • [7] A parallel repetition theorem for entangled projection games
    Dinur, Irit
    Steurer, David
    Vidick, Thomas
    2014 IEEE 29TH CONFERENCE ON COMPUTATIONAL COMPLEXITY (CCC), 2014, : 197 - 208
  • [8] Derandomized Parallel Repetition Theorems for Free Games
    Ronen Shaltiel
    computational complexity, 2013, 22 : 565 - 594
  • [9] The Structure of Winning Strategies in Parallel Repetition Games
    Dinur, Irit
    Goldenberg, Elazar
    APPROXIMATION, RANDOMIZATION, AND COMBINATORIAL OPTIMIZATION: ALGORITHMS AND TECHNIQUES, 2010, 6302 : 518 - 530
  • [10] A parallel repetition theorem for entangled projection games
    Irit Dinur
    David Steurer
    Thomas Vidick
    computational complexity, 2015, 24 : 201 - 254