Fetching the paper…
Reading the bibliography…
In two-prover one-round interactive proof systems, no-signaling provers are those who are allowed to use arbitrary strategies, not limited to local operations, as long as their strategies cannot be used for communication between them.
On the Einstein-Podolsky-Rosen paradox
J. S. Bell · 1964
Earlier work this paper cites.
On relating time and space to size and depth
Allan Borodin · 1977
Earlier work this paper cites.
The complexity of promise problems with applications to public-key cryptography
Shimon Even, Alan L. Selman, and Yacov Yacobi · 1984
Earlier work this paper cites.
Trading group theory for randomness
László Babai · 1985
Earlier work this paper cites.
Quantum and quasi-classical analogs of Bell inequalities
Leonid A. Khalfin and Boris S. Tsirelson · 1985
Earlier work this paper cites.
Locality, Bell’s theorem, and quantum mechanics
Peter Rastall · 1985
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.
The knowledge complexity of interactive proof systems
Shafi Goldwasser, Silvio Micali, and Charles Rackoff · 1989
Earlier work this paper cites.
An application of Bell’s inequatilies to a quantum state extension problem
Reinhard F. Werner · 1989
Earlier work this paper cites.
Remarks on a quantum state extension problem
Reinhard F. Werner · 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.
Checking computations in polylogarithmic time
László Babai, Lance Fortnow, Leonid A. Levin, and Mario Szegedy · 1991
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.
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 J. Karloff, and Noam Nisan · 1992
Earlier work this paper cites.
IP = PSPACE \mathrm{IP}=\mathrm{PSPACE}
Adi Shamir · 1992
Earlier work this paper cites.
PSPACE \mathrm{PSPACE} is provable by two provers in one round
Jin-Yi Cai, Anne Condon, and Richard J. Lipton · 1994
Earlier work this paper cites.
On the power of multi-prover interactive protocols
Lance Fortnow, John Rompel, and Michael Sipser · 1994
Cited alongside, same era.
Computational Complexity
Christos H. Papadimitriou · 1994
Cited alongside, same era.
Quantum nonlocality as an axiom
Sandu Popescu and Daniel Rohrlich · 1994
Cited alongside, same era.
Fast approximation algorithms for fractional packing and covering problems
Serge A. Plotkin, David B. Shmoys, and Éva Tardos · 1995
Cited alongside, same era.
Interactive proofs and the hardness of approximating cliques
Uriel Feige, Shafi Goldwasser, Lászlo Lovász, Shmuel Safra, and Mario Szegedy · 1996
Cited alongside, same era.
Fully parallelized multi-prover protocols for NEXP \mathrm{NEXP} -time
Dror Lapidot and Adi Shamir · 1997
Cited alongside, same era.
Entangled games are hard to approximate
Julia Kempe, Hirotada Kobayashi, Keiji Matsumoto, Ben Toner, and Thomas Vidick · 2007
Later among the works it cites.
Quantum multi prover interactive proofs with communicating provers
Michael Ben-Or, Avinatan Hassidim, and Haran Pilpel · 2008
Later among the works it cites.
The quantum moment problem and bounds on entangled multi-prover games
Andrew C. Doherty, Yeong-Cherng Liang, Ben Toner, and Stephanie Wehner · 2008
Later among the works it cites.
Computational Complexity: A Conceptual Perspective
Oded Goldreich · 2008
Later among the works it cites.
Generalized Tsirelson inequalities, commuting-operator provers, and multi-prover interactive proof systems
Tsuyoshi Ito, Hirotada Kobayashi, Daniel Preda, Xiaoming Sun, and Andrew C.-C. Yao · 2008
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
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.
Causal and localizable quantum operations
David Beckman, Daniel Gottesman, M. A. Nielsen, and John Preskill · 2001
Cited alongside, same era.
Sequential and parallel algorithms for mixed packing and covering
Neal E. Young · 2001
Cited alongside, same era.
Quantum multi-prover interactive proof systems with limited prior entanglement
Hirotada Kobayashi and Keiji Matsumoto · 2003
Cited alongside, same era.
PSPACE \mathrm{PSPACE} has constant-round quantum interactive proof systems
John Watrous · 2003
Cited alongside, same era.
Julia Kempe, Hirotada Kobayashi, Keiji Matsumoto, Ben Toner, and Thomas Vidick · 2008
Later among the works it cites.
The unique games conjecture with entangled provers is false
Julia Kempe, Oded Regev, and Ben Toner · 2008
Later among the works it cites.
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.
Entanglement-resistant two-prover interactive proof systems and non-adaptive PIRs
Richard Cleve, Dmitry Gavinsky, and Rahul Jain · 2009
Closest in time.
Properties of local quantum operations with shared entanglement
Gus Gutoski · 2009
Closest in time.
Parallel repetition: Simplifications and the no-signaling case
Thomas Holenstein · 2009
Closest in time.
Oracularization and two-prover one-round interactive proofs against nonlocal strategies
Tsuyoshi Ito, Hirotada Kobayashi, and Keiji Matsumoto · 2009
Closest in time.
QIP = PSPACE \mathrm{QIP}=\mathrm{PSPACE}
Rahul Jain, Zhengfeng Ji, Sarvagya Upadhyay, and John Watrous · 2009
Closest in time.
Two-message quantum interactive proofs are in PSPACE \mathrm{PSPACE}
Rahul Jain, Sarvagya Upadhyay, and John Watrous · 2009
Closest in time.
Parallel approximation of non-interactive zero-sum quantum games
Rahul Jain and John Watrous · 2009
Closest in time.
Using entanglement in quantum multi-prover interactive proofs
Julia Kempe, Hirotada Kobayashi, Keiji Matsumoto, and Thomas Vidick · 2009
Closest in time.
Monogamy of nonlocal quantum correlations
Ben Toner · 2009
Closest in time.