Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:quant-ph/0508210 · Physical Review A

Bell inequalities stronger than the Clauser-Horne-Shimony-Holt inequality for three-level isotropic states

Tsuyoshi Ito, Hiroshi Imai, David Avis

Published Apr 21, 2006• 20 citations
arXivHTMLPDF

Abstract

We show that some two-party Bell inequalities with two-valued observables are stronger than the CHSH inequality for $3\ensuremath{\bigotimes}3$ isotropic states in the sense that they are violated by some isotropic states in the $3\ensuremath{\bigotimes}3$ system that do not violate the CHSH inequality. These Bell inequalities are obtained by applying triangular elimination to the list of known facet inequalities of the cut polytope on nine points. This gives a partial solution to an open problem posed by Collins and Gisin. The results of numerical optimization suggest that they are candidates for being stronger than the ${\mathrm{I}}_{3322}$ Bell inequality for $3\ensuremath{\bigotimes}3$ isotropic states. On the other hand, we found no Bell inequalities stronger than the CHSH inequality for $2\ensuremath{\bigotimes}2$ isotropic states. In addition, we illustrate an inclusion relation among some Bell inequalities derived by triangular elimination.

DOI
10.1103/physreva.73.042109

Related papers

Two-Party Bell Inequalities Derived from Combinatorics via Triangular Elimination

David Avis, Hiroshi Imai, Tsuyoshi Ito +1 more

Bell inequalities, originally introduced as a method to prove that some quantum states show nonlocal behavior, are now studied as a method to capture the extent of the nonlocality of quantum states. Tight Bell inequalities are considered to be more important than redundant ones. Despite the increasing importance of the study of Bell inequalities, few kinds of tight Bell inequalities have been found. Examples include the Clauser-Horne-Shimony-Holt inequality, the I_{mmvv} inequalities, the CGLMP inequalities, and the Bell inequalities in systems small enough to generate all the Bell inequalities by exhaustive search. In this paper, we establish a relation between the two-party Bell inequalities for two-valued measurements and a high-dimensional convex polytope called the cut polytope in polyhedral combinatorics. Using this relation, we propose a method, triangular elimination, to derive tight Bell inequalities from facets of the cut polytope. This method gives two hundred million inequivalent tight Bell inequalities from currently known results on the cut polytope. In addition, this method gives general formulas which represent families of infinitely many Bell inequalities. These results can be used to examine general properties of Bell inequalities.

•Jan 1, 2005•39 citations

All Clauser–Horne–Shimony–Holt polytopes

Stefano Pironio

The correlations that admit a local hidden-variable model are described by a family of polytopes, whose facets are the Bell inequalities. The Clauser–Horne–Shimony–Holt (CHSH) inequality is the simplest such Bell inequality and is a facet of every Bell polytope. We investigate for which Bell polytopes the CHSH inequality is also the unique (non-trivial) facet. We prove that the CHSH inequality is the unique facet for all bipartite polytopes where at least one party has a binary choice of dichotomic measurements, irrespective of the number of measurement settings and outcomes for the other party. Based on numerical results, we conjecture that it is also the unique facet for all bipartite polytopes involving two measurements per party where at least one measurement is dichotomic. Finally, we remark that these two situations can be the only ones for which the CHSH inequality is the unique facet, i.e., any polytope that does not correspond to one of these two cases necessarily has facets that are not of the CHSH form. As a byproduct of our approach, we derive a new family of facet inequalities. This article is part of a special issue of Journal of Physics A: Mathematical and Theoretical devoted to ‘50 years of Bell’s theorem’.

arXiv:1402.6914•Journal of Physics A Mathematical and Theoretical•Oct 9, 2014•35 citations

Deriving Tight Bell Inequalities for 2 Parties with Many 2-valued Observables from Facets of Cut Polytopes

David Avis, Imai, Hiroshi, Tsuyoshi Ito +1 more

Relatively few families of Bell inequalities have previously been identified. Some examples are the trivial, CHSH, I_{mm22}, and CGLMP inequalities. This paper presents a large number of new families of tight Bell inequalities for the case of many observables. For example, 44,368,793 inequivalent tight Bell inequalities other than CHSH are obtained for the case of 2 parties each with 10 2-valued observables. This is accomplished by first establishing a relationship between the Bell inequalities and the facets of the cut polytope, a well studied object in polyhedral combinatorics. We then prove a theorem allowing us to derive new facets of cut polytopes from facets of smaller polytopes by a process derived from Fourier-Motzkin elimination, which we call triangular elimination. These new facets in turn give new tight Bell inequalities. We give additional results for projections, liftings, and the complexity of membership testing for the associated Bell polytope.

arXiv:quant-ph/0404014•Apr 2, 2004•14 citations

for 2 Parties with Many 2-valued Observables from Facets of Cut Polytopes

David Avis, Hiroshi Imai, Tsuyoshi Ito +1 more

Relatively few families of Bell inequalities have previously been identified. Some examples are the trivial, CHSH, Imm22, and CGLMP inequalities. This paper presents a large number of new families of tight Bell inequalities for the case of many observables. For example, 44,368,793 inequivalent tight Bell inequalities other than CHSH are obtained for the case of 2 parties each with 10 2-valued observables. This is accomplished by first establishing a relationship between the Bell inequalities and the facets of the cut polytope, a well studied object in polyhedral combinatorics. We then prove a theorem allowing us to derive new facets of cut polytopes from facets of smaller polytopes by a process derived from FourierMotzkin elimination, which we call triangular elimination. These new facets in turn give new tight Bell inequalities. We give additional results for projections, liftings, and the complexity of membership testing for the associated Bell polytope.

•Jan 1, 2004•0 citations

Variant of the Clauser-Horne-Shimony-Holt inequality

Zeqian Chen

We construct a Bell inequality from the Clauser-Horne-Shimony-Holt inequality for two qubits that provides a stronger bound on the correlations of entangled states than allowed by the CHSH inequality. The argument involved here can be generalized to $n$ qubits. The inequalities obtained are violated by all the generalized Greenberger-Horne-Zeilinger states of multiqubits.

arXiv:0711.0810•Nov 6, 2007•0 citations

Two-party Bell inequalities derived from combinatorics via triangular elimination

David Avis, Hiroshi Imai, Tsuyoshi Ito +1 more

We establish a relation between the two-party Bell inequalities for two-valued measurements and a high-dimensional convex polytope called the cut polytope in polyhedral combinatorics. Using this relation, we propose a method, triangular elimination , to derive tight Bell inequalities from facets of the cut polytope. This method gives two hundred million inequivalent tight Bell inequalities from currently known results on the cut polytope. In addition, this method gives general formulae which represent families of infinitely many Bell inequalities. These results can be used to examine general properties of Bell inequalities.

arXiv:quant-ph/0505060•Journal of Physics A Mathematical and General•Nov 30, 2005•48 citations
We show that some two-party Bell inequalities with two-valued observables are stronger than the CHSH inequality for 3\ensuremath⨂33\ensuremath{\bigotimes}33\ensuremath⨂3 isotropic states in the sense that they are violated by some isotropic states in the 3\ensuremath⨂33\ensuremath{\bigotimes}33\ensuremath⨂3 system that do not violate the CHSH inequality. These Bell inequalities are obtained by applying triangular elimination to the list of known facet inequalities of the cut polytope on nine points. This gives a partial solution to an open problem posed by Collins and Gisin. The results of numerical optimization suggest that they are candidates for being stronger than the I3322{\mathrm{I}}_{3322}I3322​ Bell inequality for 3\ensuremath⨂33\ensuremath{\bigotimes}33\ensuremath⨂3 isotropic states. On the other hand, we found no Bell inequalities stronger than the CHSH inequality for 2\ensuremath⨂22\ensuremath{\bigotimes}22\ensuremath⨂2 isotropic states. In addition, we illustrate an inclusion relation among some Bell inequalities derived by triangular elimination.
Bell inequalities, originally introduced as a method to prove that some quantum states show nonlocal behavior, are now studied as a method to capture the extent of the nonlocality of quantum states. Tight Bell inequalities are considered to be more important than redundant ones. Despite the increasing importance of the study of Bell inequalities, few kinds of tight Bell inequalities have been found. Examples include the Clauser-Horne-Shimony-Holt inequality, the I_{mmvv} inequalities, the CGLMP inequalities, and the Bell inequalities in systems small enough to generate all the Bell inequalities by exhaustive search. In this paper, we establish a relation between the two-party Bell inequalities for two-valued measurements and a high-dimensional convex polytope called the cut polytope in polyhedral combinatorics. Using this relation, we propose a method, triangular elimination, to derive tight Bell inequalities from facets of the cut polytope. This method gives two hundred million inequivalent tight Bell inequalities from currently known results on the cut polytope. In addition, this method gives general formulas which represent families of infinitely many Bell inequalities. These results can be used to examine general properties of Bell inequalities.
The correlations that admit a local hidden-variable model are described by a family of polytopes, whose facets are the Bell inequalities. The Clauser–Horne–Shimony–Holt (CHSH) inequality is the simplest such Bell inequality and is a facet of every Bell polytope. We investigate for which Bell polytopes the CHSH inequality is also the unique (non-trivial) facet. We prove that the CHSH inequality is the unique facet for all bipartite polytopes where at least one party has a binary choice of dichotomic measurements, irrespective of the number of measurement settings and outcomes for the other party. Based on numerical results, we conjecture that it is also the unique facet for all bipartite polytopes involving two measurements per party where at least one measurement is dichotomic. Finally, we remark that these two situations can be the only ones for which the CHSH inequality is the unique facet, i.e., any polytope that does not correspond to one of these two cases necessarily has facets that are not of the CHSH form. As a byproduct of our approach, we derive a new family of facet inequalities. This article is part of a special issue of Journal of Physics A: Mathematical and Theoretical devoted to ‘50 years of Bell’s theorem’.
Relatively few families of Bell inequalities have previously been identified. Some examples are the trivial, CHSH, I_{mm22}, and CGLMP inequalities. This paper presents a large number of new families of tight Bell inequalities for the case of many observables. For example, 44,368,793 inequivalent tight Bell inequalities other than CHSH are obtained for the case of 2 parties each with 10 2-valued observables. This is accomplished by first establishing a relationship between the Bell inequalities and the facets of the cut polytope, a well studied object in polyhedral combinatorics. We then prove a theorem allowing us to derive new facets of cut polytopes from facets of smaller polytopes by a process derived from Fourier-Motzkin elimination, which we call triangular elimination. These new facets in turn give new tight Bell inequalities. We give additional results for projections, liftings, and the complexity of membership testing for the associated Bell polytope.
Relatively few families of Bell inequalities have previously been identified. Some examples are the trivial, CHSH, Imm22, and CGLMP inequalities. This paper presents a large number of new families of tight Bell inequalities for the case of many observables. For example, 44,368,793 inequivalent tight Bell inequalities other than CHSH are obtained for the case of 2 parties each with 10 2-valued observables. This is accomplished by first establishing a relationship between the Bell inequalities and the facets of the cut polytope, a well studied object in polyhedral combinatorics. We then prove a theorem allowing us to derive new facets of cut polytopes from facets of smaller polytopes by a process derived from FourierMotzkin elimination, which we call triangular elimination. These new facets in turn give new tight Bell inequalities. We give additional results for projections, liftings, and the complexity of membership testing for the associated Bell polytope.
We construct a Bell inequality from the Clauser-Horne-Shimony-Holt inequality for two qubits that provides a stronger bound on the correlations of entangled states than allowed by the CHSH inequality. The argument involved here can be generalized to nnn qubits. The inequalities obtained are violated by all the generalized Greenberger-Horne-Zeilinger states of multiqubits.
We establish a relation between the two-party Bell inequalities for two-valued measurements and a high-dimensional convex polytope called the cut polytope in polyhedral combinatorics. Using this relation, we propose a method, triangular elimination , to derive tight Bell inequalities from facets of the cut polytope. This method gives two hundred million inequivalent tight Bell inequalities from currently known results on the cut polytope. In addition, this method gives general formulae which represent families of infinitely many Bell inequalities. These results can be used to examine general properties of Bell inequalities.