The quantum moment problem and bounds on entangled multi-prover games

Proceedings of the Annual IEEE Conference on Computational Complexity

Volumn , Issue , 2008, Pages 199-210

  Doherty, Andrew C ^a   Toner, Ben ^b   Liang, Yeong Cherng ^a   Wehner, Stephanie ^c  

^a UNIVERSITY OF QUEENSLAND   (Australia)

^b CWI   (Netherlands)

^c CALIFORNIA INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

BANACH SPACES; COMPUTATIONAL COMPLEXITY; COMPUTER NETWORKS; FINANCIAL DATA PROCESSING; GAME THEORY; HILBERT SPACES; LARGE SCALE SYSTEMS; LEARNING SYSTEMS; MATHEMATICAL OPERATORS; MATHEMATICAL TECHNIQUES; PROBABILITY; RANDOM PROCESSES;

CONDITIONAL PROBABILITY DISTRIBUTIONS; MOMENT PROBLEMS;

RISK ASSESSMENT;

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

References (41)

1. L. Babai. Trading group theory for randomness. In Proceedings of 17th ACM STOC, pages 421-429, 1985.
2. L. Babai, L. Fortnow, and C. Lund. Non-deterministic exponential time has two-prover interactive protocols. Computational Complexity, 1(1):3-40, 1991.
3. J. S. Bell. On the Einstein-Podolsky-Rosen paradox. Physics, 1:195-200, 1964.
4. M. Ben-Or, S. Goldwasser, J. Kilian, and A. Wigderson. Multi prover interactive proofs: How to remove intractability. In Proc. of 20th ACM STOC, pages 113-131, 1988.
5. S. Boyd and L. Vandenberghe. Convex Optimization. Cambridge University Press, Cambridge, 2004.
6. S. L. Braunstein, A. Mann, and M. Revzen. Maximal violation of Bell inequalities for mixed states. Physical Review Letters, 68(22):3259-3261, 1992.
7. J. Cai, A. Condon, and R. Lipton. On bounded round multi-prover interactive proof systems. In Proc. of the 5th Structures, pages 45-54, 1990.
8. B. T. (Cirel'son). Quantum generalizations of Bell's inequality. Letters in Mathematical Physics, 4:93-100, 1980.
9. B. T. (Cirel'son). Quantum analogues of Bell inequalities: The case of two spatially separated domains. J. of Soviet Mathematics, 36:557-570, 1987.
10. B. T. (Cirel'son). Some results and problems on quantum Bell-type inequalities. Hadronic Journal Supplement, 8(4):329-345, 1993.
11. J. Clauser, M. Horne, A. Shimony, and R. Holt. Proposed experiment to test local hidden-variable theories. Phys. Rev. Lett., 23:880-884, 1969.
12. R. Cleve, P. Høyer, B. Toner, and J. Watrous. Consequences and limits of nonlocal strategies. In Proceedings of 19th IEEE Conference on Computational Complexity, pages 236-249, 2004.
13. A. C. Doherty, Y.-C. Liang, B. Toner, and S. Wehner. The quantum moment problem and bounds on entangled multi-prover games. arXiv:0803.4373.
14. U. Feige. On the success probability of two provers in one-round proof systems. In Proc. of the 6th Structures, pages 116-123, 1991.
15. U. Feige and L. Lovász. Two-prover one-round proof systems: their power and their problems. In Proc. of 24th ACM STOC, pages 733-744, 1992.
16. R. J. Glauber. The quantum theory of optical coherence. Phys. Rev. A, 130(6):2529-2539, 1963.
17. S. Goldwasser, S. Micali, and C. Rackoff. The knowledge complexity of interactive proof systems. SIAM J. on Computing, 1(18):186-208, 1989.
18. R. Haag. Local Quantum Physics: Fields, Particles, Algebras. Springer, Berlin, 2nd edition, 1996.
19. J. Håstad. Some optimal inapproximability results. J. ACM, 48(4):798-859, 2001.
20. J. Helton and S. A. McCullough. A positivstellensatz for non-commutative polynomials. Trans. Amer. Math. Soc., 356(9):3721-3737, 2004.
21. T. Ito, H. Kobayashi, and K. Matsumoto. Quantum multi-prover interactive proofs and decidability. In preparation.
22. 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. of 23rd Annual IEEE CCC, 2008.
23. J. Kempe, H. Kobayashi, K. Matsumoto, B. Toner, and T. Vidick. On the power of entangled provers: immunizing games against entanglement. arXiv:0704.2903.
24. J. Kempe, O. Regev, and B. Toner. The unique games conjecture with entangled provers is false. arXiv:0710.0655.
25. A. Kitaev and J. Watrous. Parallelization, amplification, and exponential time simulation of quantum interactive proof systems. In Proc. of 32nd ACM STOC, pages 608-617, 2000.
26. A. Klyachko. Quantum marginal problem and n-representability. J. of Physics, 36(1):71, 2006.
27. D. Lapidot and A. Shamir. Fully parallelized multi prover protocols for NEXP-time. In Proc. of 32nd FOCS, pages 13-18, 1991.
28. J. B. Lasserre. Global optimization with polynomials and the problem of moments. SIAM J. of Optimization, 11(3):796-817, 2001.
29. Y.-K. Liu, M. Christandl, and F. Verstraete. N-representability is QMA-complete. Phys. Rev. Lett., 98:110503, 2007.
30. L. Masanes. Extremal quantum correlations for N parties with two dichotomic observables per site. quantph/0512100.
31. M. Navascués, S. Pironio, and A. Acín. A convergent hierarchy of semidefinite programs characterizing the set of quantum correlations. arXiv:0803.4290.
32. M. Navascués, S. Pironio, and A. Acín. Convergent relaxations for polynomial optimization with non-commutative variables. In preparation.
33. M. Navascués, S. Pironio, and A. Acín. Bounding the set of quantum correlations. Phys. Rev. Lett., 98(1):010401, 2007.
34. P. A. Parrilo. Structured semidefinite programs and semialgebraic geometry methods in robustness and optimization. PhD thesis, Caltech, 2000.
35. P. A. Parrilo. Semidefinite programming relaxations for semialgebraic problems. Math. Prog. Ser.B, 96(2):293-320, 2003.
36. A. Peres. Quantum Theory: Concepts and Methods. Springer, New York, 1995.
37. I. Pitowsky. Correlation polytopes: their geometry and complexity. Math. Prog., 50:395-414, 1991.
38. S. Prajna, A. Papachrisodoulou, P. Seiler, and P. A. Parrilo. SOSTOOLS sums of squares optimization toolbox for MATLAB. http://www.cds.caltech.edu/ sostools/.
39. S. J. Summers. On the independence of local algebras in quantum field theory. Rev. Math. Phys., 2(2):201-247, 1990.
40. S. Wehner. Entanglement in interactive proof systems with binary answers. In Proc. of STACS 2006, volume 3884 of LNCS, pages 162-171, 2006.
41. S. Wehner. Tsirelson bounds for generalized Clauser-Horne-Shimony-Holt inequalities. Phys. Rev. A, 73:022110, 2006.