Fetching the paper…
Reading the bibliography…
We prove that parallel repetition of the (3-player) GHZ game reduces the value of the game polynomially fast to 0.
Can quantum-mechanical description of physical reality be considered complete?
Albert Einstein, Boris Podolsky, and Nathan Rosen · 1935
Earlier work this paper cites.
Multi-prover interactive proofs: How to remove intractability assumptions
Michael Ben-Or, Shafi Goldwasser, Joe Kilian, and Avi Wigderson · 1988
Earlier work this paper cites.
Complexity-theoretic aspects of interactive proof systems
Lance Jeremy Fortnow · 1989
Earlier work this paper cites.
Going Beyond Bell’s Theorem
Daniel M. Greenberger, Michael A. Horne, and Anton Zeilinger · 1989
Earlier work this paper cites.
On the success probability of the two provers in one-round proof systems
Uriel Feige · 1991
Earlier work this paper cites.
Approximating clique is almost NP-complete (preliminary version)
Uriel Feige, Shafi Goldwasser, László Lovász, Shmuel Safra, and Mario Szegedy · 1991
Earlier work this paper cites.
A density version of the Hales-Jewett theorem
H. Furstenberg and Y. Katznelson · 1991
Earlier work this paper cites.
On the power of multi-prover interactive protocols
Lance Fortnow, John Rompel, and Michael Sipser · 1994
Earlier work this paper cites.
Error reduction by parallel repetition - a negative result
Uriel Feige and Oleg Verbitsky · 1996
Cited alongside, same era.
Towards the parallel repetition conjecture
Oleg Verbitsky · 1996
Cited alongside, same era.
Direct product results and the GCD problem, in old and new communication models
Itzhak Parnafes, Ran Raz, and Avi Wigderson · 1997
Cited alongside, same era.
A parallel repetition theorem
Ran Raz · 1998
Cited alongside, same era.
Inequalities on the Lambert W function and hyperpower function
Abdolhossein Hoorfar and Mehdi Hassani · 2000
Cited alongside, same era.
An information statistics approach to data stream and communication complexity
Ziv Bar-Yossef, T. S. Jayram, Ravi Kumar, and D. Sivakumar · 2004
Cited alongside, same era.
Parallel repetition: Simplification and the no-signaling case
Thomas Holenstein · 2009
Later among the works it cites.
A counterexample to strong parallel repetition
Ran Raz · 2011
Later among the works it cites.
A new proof of the density Hales-Jewett theorem
D.H.J. Polymath · 2012
Later among the works it cites.
Optimal robust self-testing by binary nonlocal XOR games
Carl A. Miller and Yaoyun Shi · 2013
Later among the works it cites.
A parallel repetition theorem for all entangled games
Henry Yuen · 2016
Later among the works it cites.
Multiplayer parallel repetition for expanding games
Irit Dinur, Prahladh Harsha, Rakesh Venkat, and Henry Yuen · 2017
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Consequences and limits of nonlocal strategies
Richard Cleve, Peter Høyer, Benjamin Toner, and John Watrous · 2004
Cited alongside, same era.
The parallel repetition of non-signaling games: counterexamples and dichotomy
Justin Holmgren and Lisa Yang · 2019
Later among the works it cites.