Algebraic methods for interactive proof systems
Journal of the ACM (JACM)
Journal of the ACM (JACM)
Journal of the ACM (JACM)
PSPACE is provable by two provers in one round
Journal of Computer and System Sciences
Probabilistic checking of proofs: a new characterization of NP
Journal of the ACM (JACM)
Proof verification and the hardness of approximation problems
Journal of the ACM (JACM)
Parallelization, amplification, and exponential time simulation of quantum interactive proof systems
STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
Some optimal inapproximability results
Journal of the ACM (JACM)
Quantum computation and quantum information
Quantum computation and quantum information
Dense quantum coding and quantum finite automata
Journal of the ACM (JACM)
Quantum multi-prover interactive proof systems with limited prior entanglement
Journal of Computer and System Sciences
Classical and Quantum Computation
Classical and Quantum Computation
Consequences and Limits of Nonlocal Strategies
CCC '04 Proceedings of the 19th IEEE Annual Conference on Computational Complexity
QMA/qpoly \subseteq PSPACE/poly: De-Merlinizing Quantum Protocols
CCC '06 Proceedings of the 21st Annual IEEE Conference on Computational Complexity
Parallel repetition: simplifications and the no-signaling case
Proceedings of the thirty-ninth annual ACM symposium on Theory of computing
Toward a general theory of quantum games
Proceedings of the thirty-ninth annual ACM symposium on Theory of computing
CCC '08 Proceedings of the 2008 IEEE 23rd Annual Conference on Computational Complexity
Perfect Parallel Repetition Theorem for Quantum Xor Proof Systems
Computational Complexity
Unique Games with Entangled Provers are Easy
FOCS '08 Proceedings of the 2008 49th Annual IEEE Symposium on Foundations of Computer Science
Oracularization and Two-Prover One-Round Interactive Proofs against Nonlocal Strategies
CCC '09 Proceedings of the 2009 24th Annual IEEE Conference on Computational Complexity
Proceedings of the forty-second ACM symposium on Theory of computing
No Strong Parallel Repetition with Entangled and Non-signaling Provers
CCC '10 Proceedings of the 2010 IEEE 25th Annual Conference on Computational Complexity
Polynomial-space approximation of no-signaling provers
ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming
Entanglement-resistant two-prover interactive proof systems and non-adaptive pir's
Quantum Information & Computation
Communications of the ACM
Quantum de finetti theorems under local measurements with applications
Proceedings of the forty-fifth annual ACM symposium on Theory of computing
Hi-index | 0.02 |
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. In particular, we show that it is NP-hard to approximate within an inverse polynomial the value of a one-round game with (i) a quantum verifier and two entangled provers or (ii) a classical verifier and three entangled provers. Previously it was not even known if computing the value exactly is NP-hard. We also describe a mathematical conjecture, which, if true, would imply hardness of approximation of entangled-prover games to within a constant. Using our techniques we also show that every language in PSPACE has a two-prover one-round interactive proof system with perfect completeness and soundness $1-1/\,\mathrm{poly}$ even against entangled provers. We start our proof by describing two ways to modify classical multiprover games to make them resistant to entangled provers. We then show that a strategy for the modified game that uses entanglement can be “rounded” to one that does not. The results then follow from classical inapproximability bounds. Our work implies that, unless $\mathrm{P}=\mathrm{NP}$, the values of entangled-prover games cannot be computed by semidefinite programs that are polynomial in the size of the verifier's system, a method that has been successful for more restricted quantum games.