A Parallel Repetition Theorem for the GHZ Game

08/12/2020
by   Justin Holmgren, et al.
0

We prove that parallel repetition of the (3-player) GHZ game reduces the value of the game polynomially fast to 0. That is, the value of the GHZ game repeated in parallel t times is at most t^-Ω(1). Previously, only a bound of ≈1/α(t), where α is the inverse Ackermann function, was known. The GHZ game was recently identified by Dinur, Harsha, Venkat and Yuen as a multi-player game where all existing techniques for proving strong bounds on the value of the parallel repetition of the game fail. Indeed, to prove our result we use a completely new proof technique. Dinur, Harsha, Venkat and Yuen speculated that progress on bounding the value of the parallel repetition of the GHZ game may lead to further progress on the general question of parallel repetition of multi-player games. They suggested that the strong correlations present in the GHZ question distribution represent the "hardest instance" of the multi-player parallel repetition problem. Another motivation for studying the parallel repetition of the GHZ game comes from the field of quantum information. The GHZ game, first introduced by Greenberger, Horne and Zeilinger, is a central game in the study of quantum entanglement and has been studied in numerous works. For example, it is used for testing quantum entanglement and for device-independent quantum cryptography. In such applications a game is typically repeated to reduce the probability of error, and hence bounds on the value of the parallel repetition of the game may be useful.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
07/13/2021

Parallel Repetition for the GHZ Game: A Simpler Proof

We give a new proof of the fact that the parallel repetition of the (3-p...
research
02/14/2022

Parallel Repetition For All 3-Player Games Over Binary Alphabet

We prove that for every 3-player game with binary questions and answers ...
research
08/20/2020

A Direct Product Theorem for One-Way Quantum Communication

We prove a direct product theorem for the one-way entanglement-assisted ...
research
11/24/2022

Parallel Repetition for the GHZ Game: Exponential Decay

We show that the value of the n-fold repeated GHZ game is at most 2^-Ω(n...
research
04/02/2022

Polynomial Bounds On Parallel Repetition For All 3-Player Games With Binary Inputs

We prove that for every 3-player (3-prover) game 𝒢 with value less than ...
research
07/05/2022

CEN : Cooperatively Evolving Networks

A finitely repeated game is a dynamic game in which a simultaneous game ...
research
11/08/2020

Optimal tiling of the Euclidean space using symmetric bodies

What is the least surface area of a symmetric body B whose ℤ^n translati...

Please sign up or login with your details

Forgot password? Click here to reset