Fetching the paper…
Reading the bibliography…
We establish the first hardness results for the problem of computing the value of one-round games played by a verifier and a team of provers who can share quantum entanglement.
On the Einstein-Podolsky-Rosen paradox
J. Bell · 1964
Earlier work this paper cites.
Some unknown problems of unknown depth about operators on hilbert space
P. Halmos · 1976
Earlier work this paper cites.
Asymptotically commuting finite rank unitary operators without commuting approximants
D. Voiculescu · 1983
Earlier work this paper cites.
Quantum analogues of the Bell inequalities. The case of two spatially separated domains
B. S. Tsirelson · 1987
Earlier work this paper cites.
Almost commuting unitary matrices
R. Exel and T. A. Loring · 1989
Earlier work this paper cites.
Private coins versus public coins in interactive proof systems
S. Goldwasser and M. Sipser · 1989
Earlier work this paper cites.
An application of Bell’s inequalities to a quantum state extension problem
R. F. Werner · 1989
Earlier work this paper cites.
IP = PSPACE
A. Shamir · 1992
Earlier work this paper cites.
IP = PSPACE: simplified proof
A. Shen · 1992
Earlier work this paper cites.
PSPACE is provable by two provers in one round
J.-Y. Cai, A. Condon, and R. J. Lipton · 1994
Earlier work this paper cites.
Almost commuting selfadjoint matrices and applications
X. Lin · 1997
Earlier work this paper cites.
Proof verification and hardness of approximation problems
S. Arora, C. Lund, R. Motwani, M. Sudan, and M. Szegedy · 1998
Earlier work this paper cites.
Probabilistic checking of proofs; a new characterization of NP
S. Arora and S. Safra · 1998
Cited alongside, same era.
Coding Theorems of Quantum Information Theory
A. Winter · 1999
Cited alongside, same era.
Parallelization, amplification, and exponential time simulation of quantum interactive proof systems
A. Kitaev and J. Watrous · 2000
Cited alongside, same era.
Quantum Computation and Quantum Information
M. A. Nielsen and I. L. Chuang · 2000
Cited alongside, same era.
Quantum fingerprinting
H. Buhrman, R. Cleve, J. Watrous, and R. de Wolf · 2001
Cited alongside, same era.
Local operator theory, random matrices and banach spaces
K. Davidson and S. Szarek · 2001
Cited alongside, same era.
Limitations of quantum advice and one-way communication
S. Aaronson · 2005
Later among the works it cites.
QMA/qpoly is contained in PSPACE/poly: De-Merlinizing quantum protocols
S. Aaronson · 2006
Later among the works it cites.
On the power of entangled quantum provers
J. Kempe and T. Vidick · 2006
Later among the works it cites.
Monogamy of nonlocal quantum correlations
B. F. Toner · 2006
Later among the works it cites.
Entanglement-resistant two-prover interactive proof systems and non-adaptive private information retrieval systems
R. Cleve, D. Gavinsky, and R. Jain · 2007
Closest in time.
Strong parallel repetition theorem for quantum XOR proof systems
R. Cleve, W. Slofstra, F. Unger, and S. Upadhyay · 2007
Closest in time.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Some optimal inapproximability results
J. Håstad · 2001
Cited alongside, same era.
Dense quantum coding and quantum finite automata
A. Ambainis, A. Nayak, A. Ta-Shma, and U. Vazirani · 2002
Cited alongside, same era.
The magic squares and Bell’s theorem
P. K. Aravind · 2002
Cited alongside, same era.
Quantum multi-prover interactive proof systems with limited prior entanglement
H. Kobayashi and K. Matsumoto · 2003
Cited alongside, same era.
Quantum Merlin-Arthur Proof Systems: Are Multiple Merlins More Helpful to Arthur?
H. Kobayashi, K. Matsumoto, and T. Yamakami · 2003
Cited alongside, same era.
Consequences and limits of nonlocal strategies
R. Cleve, P. Høyer, B. Toner, and J. Watrous · 2004
Cited alongside, same era.
Toward a general theory of quantum games
G. Gutoski and J. Watrous · 2007
Closest in time.
Generalized tsirelson inequalities, commuting-operator provers, and multi-prover interactive proof systems, 2007
T. Ito, H. Kobayashi, D. Preda, X. Sun, and A. C.-C. Yao · 2007
Closest in time.
Using entanglement in quantum multi-prover interactive proofs, 2007
J. Kempe, H. Kobayashi, K. Matsumoto, and T. Vidick · 2007
Closest in time.
The unique games conjecture with entangled provers is false
J. Kempe, O. Regev, and B. Toner · 2007
Closest in time.
Bounding the set of quantum correlations
M. Navascues, S. Pironio, and A. Acín · 2007
Closest in time.
Personal communication, Feb. 2007
A. Yao · 2007
Closest in time.