Generalized Tsirelson inequalities, commuting-operator provers, and multi-prover interactive proof systems

Proceedings of the Annual IEEE Conference on Computational Complexity

Volumn , Issue , 2008, Pages 187-198

  Ito, Tsuyoshi ^a   Kobayashi, Hirotada ^b   Preda, Daniel ^c   Sun, Xiaoming ^d   Yao, Andrew C C ^d  

^a MCGILL UNIVERSITY   (Canada)

^b NATIONAL INSTITUTE OF INFORMATICS   (Japan)

^c UNIVERSITY OF CALIFORNIA   (United States)

^d TSINGHUA UNIVERSITY   (China)

Author keywords

[No Author keywords available]

Indexed keywords

CHLORINE COMPOUNDS; COMPUTATIONAL METHODS; GAME THEORY; INFORMATION THEORY; MATHEMATICAL TECHNIQUES; NUCLEAR PROPULSION; PROGRAMMABLE LOGIC CONTROLLERS; QUANTUM OPTICS; TERMINOLOGY;

CLAUSER-HORNE-SHIMONY-HOLT INEQUALITY; COOPERATIVE GAMES; IMPERFECT INFORMATION; INTERACTIVE PROOF SYSTEMS; INTERACTIVE PROOFS; NON LOCAL; NP-HARD; PROOF SYSTEMS; QUANTUM INFORMATION THEORY;

COMPUTATIONAL COMPLEXITY;

EID: 51949088586     PISSN: 10930159     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/CCC.2008.12     Document Type: Conference Paper

References (18)

1. L. Babai, L. Fortnow, and C. Lund. Non-deterministic exponential time has two-prover interactive protocols. Computational Complexity, 1(1):3-40, 1991.
2. J. Barrett and S. Pironio. Popescu-Rohrlich correlations as a unit of nonlocality. Physical Review Letters, 95(140401), 2005.
3. M. Ben-Or, S. Goldwasser, J. Kilian, and A. Wigderson. Multi-prover interactive proofs: How to remove intractability assumptions. In Proceedings of the Twentieth Annual ACM Symposium on Theory of Computing, pages 113-131, 1988.
4. J. F. Clauser, M. A. Horne, A. Shimony, and R. A. Holt. Proposed experiment to test local hidden-variable theories. Physical Review Letters, 23(15):880-884, 1969.
5. R. Cleve, D. Gavinsky, and R. Jain. Entanglement-resistant two-prover interactive proof systems and non-adaptive private information retrieval systems. arXiv:0707.1729v1 [quant-ph], 2007.
6. R. Cleve, P. Høyer, B. Toner, and J. Watrous. Consequences and limits of nonlocal strategies. In Proceedings of the Nineteenth IEEE Annual Conference on Computational Complexity, pages 236-249, 2004.
7. D.-Z. Du and K.-I. Ko. Theory of Computational Complexity. Series in Discrete Mathematics and Optimization. Wiley-Interscience, 2000.
8. U. Feige and L. Lovász. Two-prover one-round proof systems: Their power and their problems. In Proceedings of the Twenty-Fourth Annual ACM Symposium on Theory of Computing, pages 733-744, 1992.
9. L. Fortnow, J. Rompel, and M. Sipser. On the power of multi-prover interactive protocols. Theoretical Computer Science, 134(2):545-557, 1994.
10. J. Håstad. Some optimal inapproximability results. Journal of the ACM, 48(4):798-859, 2001.
11. J. Kempe, H. Kobayashi, K. Matsumoto, B. Toner, and T. Vidick. Entangled games are hard to approximate. arXiv:0704.2903v2 [quant-ph], 2007.
12. H. Kobayashi and K. Matsumoto. Quantum multi-prover interactive proof systems with limited prior entanglement. Journal of Computer and System Sciences, 66(3):429-450, 2003.
13. M. A. Nielsen and I. L. Chuang. Quantum Computation and Quantum Information. Cambridge University Press, 2001.
14. A. Peres. Quantum Theory: Concepts and Methods, volume 57 of Fundamental Theories of Physics. Kluwer Academic Publishers, 1993.
15. X. Sun, A. C.-C. Yao, and D. Preda. On entangled quantum 3-prover systems for SAT and the magic square. Invited talk at QIP 2007 presented by A. Yao, 2007.
16. B. S. Tsirelson. Quantum generalizations of Bell's inequality. Letters in Mathematical Physics, 4(2):93-100, 1980.
17. B. S. Tsirelson. Bell inequalities and operator algebras (Problem 33). In Quantum Information: Open Problems. 2006. http://www.imaph.tu-bs.de/qi/ problems/33.html.
18. S. Wehner. Tsirelson bounds for generalized Clauser-Horne-Shimony-Holt inequalities. Physical Review A, 73(022110), 2006.