Abstract
The cut polytope of a graph arises in many fields. Although much is known about facets of the cut polytope of the complete graph, very little is known for general graphs. The study of Bell inequalities in quantum information science requires knowledge of the facets of the cut polytope of the complete bipartite graph or, more generally, the complete k-partite graph. Lifting is a central tool to prove certain inequalities are facet inducing for the cut polytope. In this paper we introduce a lifting operation, named triangular elimination, applicable to the cut polytope of a wide range of graphs. Triangular elimination is a specific combination of zero-lifting and Fourier–Motzkin elimination using the triangle inequality. We prove sufficient conditions for the triangular elimination of facet inducing inequalities to be facet inducing. The proof is based on a variation of the lifting lemma adapted to general graphs. The result can be used to derive facet inducing inequalities of the cut polytope of various graphs from those of the complete graph. We also investigate the symmetry of facet inducing inequalities of the cut polytope of the complete bipartite graph derived by triangular elimination.
Article PDF
Similar content being viewed by others
Avoid common mistakes on your manuscript.
References
Avis D., Deza M. (1991) The cut cone, L 1 embeddability, complexity and multicommodity flows. Networks 21(6): 595–617
Avis, D., Imai, H., Ito, T.: On the relationship between convex bodies related to correlation experiments with dichotomic observables. arXiv:quant-ph/0605148 (2006) (Submitted)
Avis D., Imai H., Ito T., Sasaki Y. Two-party Bell inequalities derived from combinatorics via triangular elimination. J. Phys. A. Math. General 38(50), 10971–10987, arXiv:quant-ph/0505060 (2005)
Barahona F., Grötschel M., Mahjoub A.R. (1985) Facets of the bipartite subgraph polytope. Math. Oper. Res. 10(2): 340–358
Barahona F., Mahjoub A.R. (1986) On the cut polytope. Math. Program. 36(2): 157–173
Bell J.S. (1964) On the Einstein Podolsky Rosen paradox. Physics 1(3): 195–200
Boole G. (1854) An Investigation of the Laws of Thought, on Which Are Founded the Mathematical Theories of Logic and Probabilities. Dover Publications, New York
Cleve, R., Høyer, P., Toner, B., Watrous, J.: Consequences and limits of nonlocal strategies. In: Proceedings of 19th IEEE Annual Conference on Computational Complexity (CCC’04), pp. 236–249, arXiv:quant-ph/0404076 (2004)
Collins, D., Gisin, N.: A relevant two qubit Bell inequality inequivalent to the CHSH inequality. J. Phys. A Math. General 37(5), 1775–1787, arXiv:quant-ph/0306129 (2004)
Deza M. (1973) Matrices des formes quadratiques non négatives pour des arguments binaires. C. R. Acad. Sci. Paris 277A(18): 873–875
Deza M., Laurent M. (1992) Facets for the cut cone I. math. Program. 56(2): 121–160
Deza M., Laurent M. (1992) Facets for the cut cone II: Clique-web inequalities. Math. Program. 56(2): 161–188
Deza M., Laurent M. (1994) Applications of cut polyhedra I. J. Comput. Appl. Math. 55(2): 191–216
Deza M., Laurent M. (1994) Applications of cut polyhedra II. J. Comput. Appl. Math. 55(2): 217–247
Deza M.M., Laurent M. (1997) Geometry of Cuts and Metrics. Algorithms and Combinatorics, vol. 15. Springer, Berlin Heidelberg New York
Froissart M. (1981) Constructive generalization of Bell’s inequalities. Nuovo Cimento Soc Ital 64B(2): 241–251
Grishukhin V.P. (1990) All facets of the cut cone C n for n = 7 are known. Eur. J. Combin. 11(2): 115–117
Hammer P.L. (1965) Some network flow problems solved with pseudo-Boolean programming. Oper. Res. 13(3): 388–399
Krüger, O., Werner, R.F.: Some open problems in quantum information theory. arXiv:quant-ph/0504166. See also http://www.imaph.tu-bs.de/qi/problems/problems.html, (2005)
McRae W.B., Davidson E.R. (1972) Linear inequalities for density matrices II. J. Math. Phys. 13(10): 1527–1538
Nemhauser G.L., Wolsey L.A. (1988) Integer and Combinatorial Optimization Wiley-Interscience Series in Discrete Mathematics and Optimization. Wiley, New York
Peres, A.: All the Bell inequalities. Found. Phys. 29(4), 589–614, arXiv:quant-ph/9807017 (1999)
Pitowsky I. (1986) The range of quantum probability. J. Math. Phys. 27(6): 1556–1565
Pitowsky I.(1989) Quantum Probability – Quantum Logic. Lecture Notes in Physics, vol. 321. Springer, Berlin Heidelberg New York
Pitowsky I. (1991) Correlation polytopes: Their geometry and complexity. Math. Program. 50(3): 395–414
Pitowsky, I., Svozil, K.: Optimal tests of quantum nonlocality. Phys. Rev. A 64(014102) arXiv:quant-ph/0011060 (2001)
De Simone C. (1990) Lifting facets of the cut polytope. Oper. Res. Lett. 9(5): 341–344
Werner, R.F., Wolf, M.M.: All-multipartite Bell-correlation inequalities for two dichotomic observables per site. Phys. Rev. A 64(032112), arXiv:quant-ph/0102024 (2001)
Werner, R.F., Wolf, M.M.: Bell inequalities and entanglement. Quantum Information and Computation 1(3), 1–25, arXiv:quant-ph/0107093 (2001)
Ziegler G.M. (1998) Lectures on Polytopes, Graduate Texts in Mathematics, vol. 152, revised edn. Springer, Berlin Heidelberg New York
Żukowski, M., Brukner, Č.: Bell’s theorem for general N-qubit states. Phys. Rev. Lett. 88(210401), arXiv:quant-ph/0102039 (2002)
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Avis, D., Imai, H. & Ito, T. Generating facets for the cut polytope of a graph by triangular elimination. Math. Program. 112, 303–325 (2008). https://doi.org/10.1007/s10107-006-0018-z
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10107-006-0018-z