On the relationship between convex bodies related to correlation experiments with dichotomic observables

Journal of Physics A: Mathematical and General

Volumn 39, Issue 36, 2006, Pages 11283-11299

  Avis, David ^a   Imai, Hiroshi ^b,c   Ito, Tsuyoshi ^b,d  

^a MCGILL UNIVERSITY   (Canada)

^b UNIVERSITY OF TOKYO   (Japan)

^c JAPAN SCIENCE AND TECHNOLOGY AGENCY   (Japan)

^d JAPAN SOCIETY FOR THE PROMOTION OF SCIENCE   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 33747593858     PISSN: 03054470     EISSN: 13616447     Source Type: Journal    
DOI: 10.1088/0305-4470/39/36/010     Document Type: Article

References (37)

1. 1 embeddability, complexity and multicommodity flows Networks 21 595-617
2. Avis D, Imai H, Ito T and Sasaki Y 2005 Two-party Bell inequalities derived from combinatorics via triangular elimination J. Phys. A: Math. Gen. 38 10971-87 (Preprint quant-ph/0505060)
3. Avis D, Imai H and Ito T 2006 Generating facets for the cut polytope of a graph by triangular elimination Preprint math.CO/0601375 (Math. Program. at press)
4. Barahona F and Mahjoub A R 1986 On the cut polytope Math. Program. 36 157-73
5. Barrett J, Linden N, Massar S, Pironio S, Popescu S and Roberts D 2005 Nonlocal correlations as an information-theoretic resource Phys. Rev. A 71 022101 (Preprint quant-ph/0404097)
6. Boyd S and Vandenberghe L 2004 Convex Optimization (Cambridge: Cambridge University Press)
7. Christof T and Reinelt G 2001 Decomposition and parallelization techniques for enumerating the facets of combinatorial polytopes Int. J. Comput. Geom. Appl. 11 423-37
8. Cirel'son B S 1980 Quantum generalizations of Bell's inequality Lett. Math. Phys. 4 93-100
9. Clauser J F, Horne M A, Shimony A and Holt R A 1969 Proposed experiment to test local hidden-variable theories Phys. Rev. Lett. 23 880-4
10. Cleve R, Høyer P, Toner B and Watrous J 2004 Consequences and limits of nonlocal strategies Proc. 19th IEEE Annual Conf. on Computational Complexity (CCC'04) pp 236-49 (Preprint quant-ph/0404076)
11. Collins D and Gisin N 2004 A relevant two qubit Bell inequality inequivalent to the CHSH inequality J. Phys. A: Math. Gen. 37 1775-87 (Preprint quant-ph/0306129)
12. De Simone C 1990 Lifting facets of the cut polytope Oper. Res. Lett. 9 341-4
13. Deza M M and Laurent M 1997 Geometry of Cuts and Metrics (Algorithms and Combinatorics vol 15) (Berlin: Springer)
14. Froissart M 1981 Constructive generalization of Bell's inequalities Nuovo Cimento B 64 241-51
15. Fujisawa K, Kojima M, Nakata K and Yamashita M 1995 SDPA (SemiDefinite Programming Algorithm) User's Manual Version 6.2.0 Research Report B-308 (Tokyo: Department of Mathematics and Computer Science, Tokyo Institute of Technology) URL http://grid.r.dendai.ac.jp/sdpa/
16. Fukuda K cdd. URL http://www.ifor.math.ethz.ch/∼fukuda/cddhome/cdd. html
17. Gill R 2005 Bell inequalities holding for all quantum states Some Open Problems in Quantum Information Theory ed O Krüger and R F Werner (Preprint quant-ph/0504166) Problem 26. See also http://www.imaph.tu-bs.de/qi/problems/ 26.html
18. Gisin N 2005 private communication
19. Goemans M X and Williamson D P 1995 Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming J. Assoc. Comput. Mach. 42 1115-45
20. Grothendieck A 1953 Résumé de la théorie métrique des produits tensoriels topologiques Bol. Soc. Mat. So Paulo 8 1-79
21. Ito T, Imai H and Avis D 2006 Bell inequalities stronger than the Clauser-Horne-Shimony-Holt inequality for three-level isotropic states Phys. Rev. A 73 042109 (Preprint quant-ph/0508210)
22. Krivine J L 1979 Constantes de Grothendieck et fonctions de type positif sur les sphères Adv. Math. 31 16-30
23. Laurent M 1997 The real positive semidefinite completion problem for series-parallel graphs Linear Algebra Appl. 252 347-66
24. Laurent M and Poljak S 1995 On a positive semidefinite relaxation of the cut polytope Linear Algebra Appl. 224 439-61
25. Masanes L 2003 Tight Bell inequality for d-outcome measurements correlations Quantum Inform. Comput. 3 345-58 (Preprint quant-ph/0210073)
26. McKay B nauty URL http://cs.anu.edu.au/∼bdm/nauty/
27. Padberg M 1989 The Boolean quadric polytope: some characteristics, facets and relatives Math. Program. 45 139-72
28. Pironio S 2005 Lifting Bell inequalities J. Math. Phys. 46 062112 (Preprint quant-ph/0503179)
29. Pitowsky I 1986 The range of quantum probability J. Math. Phys. 27 1556-65
30. Pitowsky I 1991 Correlation polytopes: Their geometry and complexity Math. Program. 50 395-414
31. Pitowsky I 2002 Range theorems for quantum probability and entanglement. Quantum Theory: Reconsideration of Foundations pp 299-308 (Preprint quant-ph/0112068)
32. Pitowsky I 1989 Quantum Probability-Quantum Logic (Lecture Notes in Physics vol 321) (Berlin: Springer)
33. Research Group Discrete Optimization, University of Heidelberg. SMAPO-'small' 0/1-polytopes in combinatorial optimization. URL http://www.iwr.uni-heidelberg.de/groups/comopt/software/SMAPO/cut/cut.html
34. Tsirelson B S 1993 Some results and problems on quantum Bell-type inequalities Hadronic J. Suppl. 8 329-45
35. Tsirel'son B S 1987 Quantum analogues of the Bell inequalities: the case of two spatially separated domains J. Sov. Math. 36 557-70
36. Werner R F and Wolf M M 2001 All-multipartite Bell-correlation inequalities for two dichotomic observables per site Phys. Rev. A 64 032112 (Preprint quant-ph/0102024)
37. Ziegler G M 1998 Lectures on Polytopes (Graduate Texts in Mathematics vol 152) (Berlin: Springer) (revised edition)