Entangled games are hard to approximate

Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS

Volumn , Issue , 2008, Pages 447-456

  Kempe, Julia ^a   Kobayashi, Hirotada ^b   Matsumoto, Keiji ^b   Toner, Ben ^c   Vidick, Thomas ^d  

^a TEL AVIV UNIVERSITY   (Israel)

^b NATIONAL INSTITUTE OF INFORMATICS   (Japan)

^c CWI   (Netherlands)

^d UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

HARDNESS OF APPROXIMATIONS; HARDNESS RESULTS; INAPPROXIMABILITY; NP-HARD; QUANTUM GAMES; SEMIDEFINITE PROGRAMS; TWO WAYS;

COMPUTERS; FIBER OPTIC CHEMICAL SENSORS; HARDNESS; POLYNOMIAL APPROXIMATION;

GAME THEORY;

EID: 57949095785     PISSN: 02725428     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/FOCS.2008.8     Document Type: Conference Paper

References (36)

1. P. K. Aravind. The magic squares and Bell's theorem. Technical report, arXiv:quant-ph/0206070, 2002.
2. S. Arora, C. Lund, R. Motwani, M. Sudan, and M. Szegedy. Proof verification and the hardness of approximation problems. J. ACM, 45(3):501-555, 1998.
3. S. Arora and S. Safra. Probabilistic checking of proofs: A new characterization of NP. J. ACM, 45(1):70-122, 1998.
4. J. Bell. On the Einstein-Podolsky-Rosen paradox. Physics, 1(3):195-200, 1964.
5. H. Buhrman, R. Cleve, J. Watrous, and R. de Wolf. Quantum fingerprinting. Phys. Rev. Lett, 87(16):167902, 2001.
6. J.-Y. Cai, A. Condon, and R. J. Lipton. PSPACE is provable by two provers in one round. J. Comput. Syst. Sci., 48(1):183-193, 1994.
7. R. Cleve, D. Gavinsky, and R. Jain. Entanglement-resistant two-prover interactive proof systems and non-adaptive private information retrieval systems. Technical report, arXiv:0707.1729, 2007.
8. R. Cleve, P. Høyer, B. Toner, and J. Watrous. Consequences and limits of nonlocal strategies. In Proc. 19th IEEE CCC, pages 236-249, 2004.
9. K. Davidson and S. Szarek. Local operator theory, random matrices and Banach spaces. In J. L. W. B. Johnson, editor, Handbook on the Geometry of Banach spaces, volume 1, pages 317-366. Elsevier Science, 2001.
10. R. Exel and T. A. Loring. Almost commuting unitary matrices. Proc. American Mathematical Society, 106(4):913-915, 1989.
11. S. Goldwasser and M. Sipser. Private coins versus public coins in interactive proof systems. In S. Micali, editor, Randomness and Computation, volume 5 of Advances in Computing Research, pages 73-90. JAI Press, 1989.
12. G. Gutoski and J. Watrous. Toward a general theory of quantum games. In Proc. 39th ACM STOC, pages 565-574, 2007.
13. P. Halmos. Some unknown problems of unknown depth about operators on Hilbert space. Proc. Roy. Soc. A, 76:67-76, 1976.
14. J. Håstad. Some optimal inapproximability results. J. ACM, 48(4):798-859, 2001.
15. T. Ito, H. Kobayashi, D. Preda, X. Sun, and A. C.-C. Yao. Generalized Tsirelson inequalities, commuting-operator provers, and multi-prover interactive proof systems. In Proc. 23rd IEEE CCC, pages 187-198, 2008.
16. J. Kempe, H. Kobayashi, K. Matsumoto, B. Toner, and T. Vidick. Entangled games are hard to approximate. Technical report, arXiv:0704.2903, 2007.
17. J. Kempe, H. Kobayashi, K. Matsumoto, and T. Vidick. Using entanglement in quantum multi-prover interactive proofs. In Proc. 23rd IEEE CCC, pages 211-222, 2008.
18. J. Kempe, O. Regev, and B. Toner. The unique games conjecture with entangled provers is false. In Proc. 49th IEEE FOCS, 2008.
19. J. Kempe and T. Vidick. On the power of entangled quantum provers. Technical report, arXiv:quant-ph/0612063, 2006.
20. A. Kitaev. A bound on the cheating probability of strong quantum coin-flipping. Unpublished.
21. A. Kitaev and J. Watrous. Parallelization, amplification, and exponential time simulation of quantum interactive proof systems. In Proc. 32nd ACM STOC, pages 608-617, 2000.
22. H. Kobayashi and K. Matsumoto. Quantum multi-prover interactive proof systems with limited prior entanglement. J. Comput. Syst. Sci., 66(3):429-450, 2003.
23. H. Kobayashi, K. Matsumoto, and T. Yamakami. Quantum Merlin-Arthur proof systems: Are multiple Merlins more helpful to Arthur? In Proc. 14th ISAAC, volume 2906 of Lecture Notes in Computer Science, pages 189-198, 2003.
24. X. Lin. Almost commuting selfadjoint matrices and applications. Fields Inst. Commun., 13:193-233, 1997.
25. C. Lund, L. Fortnow, H. Karloff, and N. Nisan. Algebraic methods for interactive proof systems. J. ACM, 39(4):859-868, 1992.
26. M. Navascues, S. Pironio, and A. Acín. Bounding the set of quantum correlations. Phys. Rev. Lett., 98(1):010401, 2007.
27. M. A. Nielsen and I. L. Chuang. Quantum Computation and Quantum Information. Cambridge University Press, 2000.
28. D. Preda. Personal communication.
29. A. Shamir. IP = PSPACE. J. ACM, 39(4):869-877, 1992.
30. A. Shen. IP = PSPACE: Simplified proof. J. ACM, 39(4):878-880, 1992.
31. B. M. Terhal, A. C. Doherty, and D. Schwab. Symmetric extensions of quantum states and local hidden variable theories. Phys. Rev. Lett., 90(15):157903, 2003.
32. B. F. Toner. Monogamy of nonlocal quantum correlations. Technical report, lanl-arXiv quant-ph/0601172, 2006.
33. B. S. Tsirelson. Quantum analogues of the Bell inequalities. The case of two spatially separated domains. J. Soviet Math., 36:557-570, 1987.
34. D. Voiculescu. Asymptotically commuting finite rank unitary operators without commuting approximants. Acta Sci. Math., 45:429-431, 1983.
35. R. F. Werner. An application of Bell's inequalities to a quantum state extension problem. Lett. Math Phys., 17:359-363, 1989.
36. A. Yao. Personal communication, Feb. 2007.