Fetching the paper…
Reading the bibliography…
We prove a strong limitation on the ability of entangled provers to collude in a multiplayer game.
On the Einstein-Podolsky-Rosen paradox
John S. Bell · 1964
Earlier work this paper cites.
Probabilistic algorithms for sparse polynomials
Richard Zippel · 1979
Earlier work this paper cites.
Fast probabilistic algorithms for verification of polynomial identities
Jacob T. Schwartz · 1980
Earlier work this paper cites.
Quantum generalizations of Bell’s inequality
Boris S. Tsirelson · 1980
Earlier work this paper cites.
A note on succinct representations of graphs
Christos H. Papadimitriou and Mihalis Yannakakis · 1986
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.
Perturbation inequalities for the absolute value map in norm ideals of operators
Rajendra Bhatia · 1988
Earlier work this paper cites.
Simple unified form for the major no-hidden-variables theorems
N. David Mermin · 1990
Earlier work this paper cites.
Incompatible results of quantum measurements
Asher Peres · 1990
Earlier work this paper cites.
New algorithms for finding irreducible polynomials over finite fields
Victor Shoup · 1990
Earlier work this paper cites.
Non-deterministic exponential time has two-prover interactive protocols
László Babai, Lance Fortnow, and Carsten Lund · 1991
Earlier work this paper cites.
Simple constructions of almost k k -wise independent random variables
Noga Alon, Oded Goldreich, Johan Håstad, and René Peralta · 1992
Earlier work this paper cites.
Two-prover one-round proof systems: Their power and their problems
Uriel Feige and László Lovász · 1992
Earlier work this paper cites.
Algebraic methods for interactive proof systems
Carsten Lund, Lance Fortnow, Howard Karloff, and Noam Nisan · 1992
Earlier work this paper cites.
IP = PSPACE
Adi Shamir · 1992
Earlier work this paper cites.
Self-testing/correcting with applications to numerical problems
Manuel Blum, Michael Luby, and Ronitt Rubinfeld · 1993
Earlier work this paper cites.
A Cauchy–Schwarz inequality for operators with applications
Rajendra Bhatia and Chandler Davis · 1995
Earlier work this paper cites.
Proof verification and the hardness of approximation problems
Sanjeev Arora, Carsten Lund, Rajeev Motwani, Madhu Sudan, and Mario Szegedy · 1998
Cited alongside, same era.
Probabilistic checking of proofs: A new characterization of NP \mathrm{NP}
Sanjeev Arora and Shmuel Safra · 1998
Cited alongside, same era.
Coding theorem and strong converse for quantum channels
Andreas Winter · 1999
Cited alongside, same era.
Some optimal inapproximability results
Johan Håstad · 2001
Cited alongside, same era.
Quantum Computation and Quantum Information
Michael A. Nielsen and Isaac L. Chuang · 2001
Cited alongside, same era.
Classical and Quantum Computation
Alexei Yu. Kitaev, Alexander H. Shen, and Mikhail N. Vyalyi · 2002
Cited alongside, same era.
A convergent hierarchy of semidefinite programs characterizing the set of quantum correlations
Miguel Navascués, Stefano Pironio, and Antonio Acín · 2008
Later among the works it cites.
Volkher B. Scholz and Reinhard F. Werner · 2008
Later among the works it cites.
Computational Complexity: A Modern Approach
Sanjeev Arora and Boaz Barak · 2009
Later among the works it cites.
Entanglement-resistant two-prover interactive proof systems and non-adaptive PIR
Richard Cleve, Dmitry Gavinsky, and Rahul Jain · 2009
Later among the works it cites.
Oracularization and two-prover one-round interactive proofs against nonlocal strategies
Tsuyoshi Ito, Hirotada Kobayashi, and Keiji Matsumoto · 2009
Later among the works it cites.
Two-message quantum interactive proofs are in PSPACE
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Quantum multi-prover interactive proof systems with limited prior entanglement
Hirotada Kobayashi and Keiji Matsumoto · 2003
Cited alongside, same era.
Consequences and limits of nonlocal strategies
Richard Cleve, Peter Høyer, Benjamin Toner, and John Watrous · 2004
Cited alongside, same era.
Limitations of quantum advice and one-way communication
Scott Aaronson · 2005
Cited alongside, same era.
Entanglement in interactive proof systems with binary answers
Stephanie Wehner · 2006
Cited alongside, same era.
Making good codes for classical-quantum channel coding via quantum hypothesis testing
Tomohiro Ogawa and Hiroshi Nagaoka · 2007
Cited alongside, same era.
On the power of quantum, one round, two prover interactive proof systems
Alex Rapaport and Amnon Ta-Shma · 2007
Cited alongside, same era.
Rahul Jain, Sarvagya Upadhyay, and John Watrous · 2009
Later among the works it cites.
Quantum computational complexity
John Watrous · 2009
Later among the works it cites.
Anne Broadbent, Joseph Fitzsimons, and Elham Kashefi · 2010
Later among the works it cites.
Polynomial-space approximation of no-signaling provers
Tsuyoshi Ito · 2010
Later among the works it cites.
Operator space theory: A natural framework for Bell inequalities
M. Junge, C. Palazuelos, D. Pérez-García, I. Villanueva, and M. M. Wolf · 2010
Later among the works it cites.
Unique games with entangled provers are easy
Julia Kempe, Oded Regev, and Ben Toner · 2010
Later among the works it cites.
Parallelization of entanglement-resistant multi-prover interactive proofs, 2011
Tsuyoshi Ito · 2011
Later among the works it cites.
QIP = PSPACE
Rahul Jain, Zhengfeng Ji, Sarvaghya Upadhyay, and John Watrous · 2011
Later among the works it cites.
Entangled games are hard to approximate
Julia Kempe, Hirotada Kobayashi, Keiji Matsumoto, Ben Toner, and Thomas Vidick · 2011
Later among the works it cites.
Parallel repetition of entangled games
Julia Kempe and Thomas Vidick · 2011
Later among the works it cites.
A classical leash for a quantum system: Command of quantum systems via rigidity of CHSH games
Ben W. Reichardt, Falk Unger, and Umesh Vazirani · 2012
Closest in time.