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/0105083 · International Mathematica Symposium (IMS)

Boole-Bell-type inequalities in Mathematica

Stefan Filipp, Karl Svozil

Published Jun 1, 2003• 8 citations
arXivHTMLPDF

Abstract

Classical Pitowsky correlation polytopes are reviewed with particular emphasis on the Minkowski-Weyl representation theorem. The inequalities representing the faces of polytopes are Boole's ``conditions of possible experience.'' Many of these inequalities have been discussed in the context of Bell's inequalities. We introduce CddIF, a Mathematica package created as an interface between Mathematica and the cdd program by Komei Fukuda, which represents a highly efficient method to solve the hull problem for general classical correlation polytopes.

DOI
10.1142/9781848161313_0028

Related papers

George Boole and the Bell inequalities

Elemér Elad Rosinger

As shown by Pitowsky, the Bell inequalities are related to certain classes of probabilistic inequalities dealt with by George Boole, back in the 1850s. Here a short presentation of this relationship is given. Consequently, the Bell inequalities can be obtained without any assumptions of physical nature, and merely through mathematical argument.

arXiv:quant-ph/0406004•Prespacetime journal•Jun 1, 2004•10 citations

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

David Avis, Hiroshi Imai, Tsuyoshi Ito

In this paper we explore further the connections between convex bodies related to quantum correlation experiments with dichotomic variables and related bodies studied in combinatorial optimization, especially cut polyhedra. Such a relationship was established in Avis et al ( 2005 J. Phys. A: Math. Gen. 38 10971–87 ) with respect to Bell inequalities. We show that several well-known bodies related to cut polyhedra are equivalent to bodies such as those defined by Tsirelson (1993 Hadronic J. Suppl. 8 329–45) to represent hidden deterministic behaviours, quantum behaviours and no-signalling behaviours. Among other things, our results allow a unique representation of these bodies, give a necessary condition for vertices of the no-signalling polytope, and give a method for bounding the quantum violation of Bell inequalities by means of a body that contains the set of quantum behaviours. Optimization over this latter body may be performed efficiently by semidefinite programming. In the second part of the paper we apply these results to the study of classical correlation functions. We provide a complete list of tight inequalities for the two party case with ( m , n ) dichotomic observables when m = 4, n = 4 and when min{ m , n } ⩽ 3, and give a new general family of correlation inequalities.

arXiv:quant-ph/0605148•Journal of Physics A Mathematical and General•Aug 18, 2006•61 citations

Bell Inequalities from Polyhedral Sampling

Christian Staufenbiel

Bell inequalities play a central role in certifying quantum correlations and underpin protocols such as device-independent quantum key distribution. However, enumerating all Bell inequalities for a given scenario remains intractable beyond the simplest cases, as it requires solving a computationally hard facet enumeration problem on the associated Bell polytope. We propose the Adjacency Sampling method, which builds on the Adjacency Decomposition method but sacrifices completeness for speed. On previously solved Bell polytopes, the method reproduces every known class of inequalities. For scenarios where no complete enumeration exists, it greatly exceeds existing partial results: in $\mathcal{L}_{3,3,3,3}$ we obtain over $1.29 \times 10^8$ classes, more than 25 times the previous count; in $\mathcal{L}_{4,5,2,2}$ we nearly triple the known list to 49\,358 classes; and for $\mathcal{L}_{4,6,2,2}$ we report over 4.3 million classes.

quant-pharXiv:2604.22859•Apr 24, 2026•0 citations

Logical Views of Bell Inequalities

Zeno Toffano

Bell's Inequalites structure can be considered in a logical-probabilistic framework, as outlined by Pitowsky [1], where the origin of the inequality was attributed to George Boole’s “conditions of possible experience”. The inequality has then been often renamed the Bell-Boole inequality. An interesting fact is that G. Boole’s method used to establish his probability inequalities stems directly from his mathematical treatment of logic using idempotent symbols (which he called “elective symbols”). The “Boolean Algebra” we consider today bears some major differences with Boole’s original method as thoroughly discussed by Hailperin [2].We proposed recently the “Eigenlogic” approach [3] where we translate Boole’s original logical method to linear algebra using idempotent and also unitary operators and outline the bridges to quantum theories in particular to quantum information [4]. Eigenlogic can thus be a framework for transposing logic in a quantum context, the probabilistic aspects are then simply derived by measurements on logical operators using the Born rule.Bell Inequalities (BI) can be expressed in an operator form where the measurement observables of an experiment are combined to form Bell operators, the outcomes are then derived by using the quantum mechanical mean value (again the Born rule). The popular form adapted for this method is the CHSH form of the BI for spin 1/2 particles or polarized photons with outcomes ±1. Using the isomorphism between idempotent and self-inverse unitary operators (Householder transform) the CHSH Bell operator transforms in Eigenlogic in a combination of idempotent operators from which by using the Born rule one gets the Fine inequality on probabilities.As stated by Khrennikov [5] the BI violation occurs only when incompatible (non-commuting) observables are used in the BI associated experiments. Particularly in the CHSH-BI experiments on an entangled state, mutually unbiased bases (MUB), representing maximally dissimilar contexts, lead to the maximum quantum violation represented by the number 2√2>2. This is the case for the couple of MUB (z,x) associated to Pauli spin operators σ_x and σ_z. In Eigenlogic these (z,x) contexts represent dual logical systems which are at interplay and have an original syntax-semantic interpretation [4]. It has to be outlined that in many quantum algorithms the MUB (z,x), linked by the Hadamard gate which represents the Fourier Transformation between the two bases, provides a quantum algorithmic advantage.The situations of the BI in the so called post-quantum regime are also analyzed by generalizing the concept of PR-Box which relates outputs (a,b) to inputs (x,y) in a two-party correlation by means of the logical equation: a⊕b=x∧y. Using Eigenlogic, families of boxes with all possible combinations of logical functions are analyzed through the equations: f(a,b)=g(x,y), where f and g correspond to the 16 different Boolean functions, giving 256 possible logical equations. The logical equations are transformed in logical operators and used to define the associated Bell operator. 16 cases of the PR-Box type (considering all the possible complementations of the variables a,b,x,y) violate the CHSH-BI maximally with the number 4>2√2 (Tsirelson’s bound). Another family of 32 logical cases gives a CHSH-BI violation of 3.33 also beyond the quantum limit; this is the case for the logical equation: a∨b=x∧y.[1] Pitowsky, I., George Boole’s ‘conditions of possible experience’ and the quantum puzzle. Brit. J. Phil. Sci., 45:95–125 (1994).[2] Hailperin, T. Boole’s Algebra isn’t Boolean algebra. A description using modern algebra, of what Boole really did create. Math. Mag. 54(4): 172–184 (1981).[3] Toffano, Z. Eigenlogic in the Spirit of George Boole. Log. Univers. 14, 175–207 (2020). https://doi.org/10.1007/s11787-020-00252-3[4] Toffano, Z.; Dubois, F. Adapting Logic to Physics: The Quantum-Like Eigenlogic Program. Entropy 2020, 22, 139. https://doi.org/10.3390/e22020139[5] Khrennikov, A. Contextuality, Complementarity, Signaling, and Bell Tests. Entropy 2022, 24, 1380. https://doi.org/10.3390/e24101380

•Jun 13, 2023•0 citations

Bell inequalities from variable-elimination methods

Costantino Budroni, Adán Cabello

Tight Bell inequalities are facets of Pitowsky's correlation polytope and are usually obtained from its extreme points by solving the hull problem.Here, we present an alternative method based on a combination of algebraic results on extensions of measures and variable-elimination methods, e.g., the Fourier-Motzkin method.Our method is shown to overcome some of the computational difficulties associated with the hull problem in some nontrivial cases.Moreover, it provides an explanation for the arising of only a finite number of families of Bell inequalities in measurement scenarios where one experimenter can choose between an arbitrary number of different measurements.

arXiv:1112.5876•Journal of Physics A Mathematical and Theoretical•Sep 5, 2012•20 citations

Unifying Bell Inequalities and Entanglement Witnesses via Correlation Polytope Geometry — E8 Intelligence Research

Andrew Stewart Caldin

FINDING: Buscemi's framework unifies Bell inequalities with entanglement witnesses via "semidefinite programming" and "facet structure" of correlation polytopes, showing quantum violations correspond to specific geometric facets. | MATH: Bell inequalities are linear inequalities over the correlation polytope \( \mathcal{P} \); quantum correlations form a convex set \( \mathcal{Q} \) strictly larger than \( \mathcal{P} \) (local hidden variable polytope). Buscemi's unification maps entanglement witnesses (Hermitian operators \( W \geq 0 \) with \( \mathrm{Tr}(W\rho) \geq 0 \) for separable \( \rho \)) to Bell-type inequalities via a "quantum channel" transformation. Key constants: the Tsirelson bound \( 2\sqrt{2} \) for CHSH, and the ratio \( 2\sqrt{2}/2 = \sqrt{2} \approx 1.414 \) (not a golden ratio, but a quadratic irrational). Facet structure: the polytope \( \mathcal{P} \) has facets defined by inequalities like \( \langle A_1B_1 \rangle + \langle A_1B_2 \rangle + \langle A_2B_1 \r Author: Andrew Stewart Caldin, Independent Researcher, UK. Part of the E8 Intelligence Research series. Platform: e8intelligence.com

•Sep 4, 2026•0 citations
Classical Pitowsky correlation polytopes are reviewed with particular emphasis on the Minkowski-Weyl representation theorem. The inequalities representing the faces of polytopes are Boole's ``conditions of possible experience.'' Many of these inequalities have been discussed in the context of Bell's inequalities. We introduce CddIF, a Mathematica package created as an interface between Mathematica and the cdd program by Komei Fukuda, which represents a highly efficient method to solve the hull problem for general classical correlation polytopes.
In this paper we explore further the connections between convex bodies related to quantum correlation experiments with dichotomic variables and related bodies studied in combinatorial optimization, especially cut polyhedra. Such a relationship was established in Avis et al ( 2005 J. Phys. A: Math. Gen. 38 10971–87 ) with respect to Bell inequalities. We show that several well-known bodies related to cut polyhedra are equivalent to bodies such as those defined by Tsirelson (1993 Hadronic J. Suppl. 8 329–45) to represent hidden deterministic behaviours, quantum behaviours and no-signalling behaviours. Among other things, our results allow a unique representation of these bodies, give a necessary condition for vertices of the no-signalling polytope, and give a method for bounding the quantum violation of Bell inequalities by means of a body that contains the set of quantum behaviours. Optimization over this latter body may be performed efficiently by semidefinite programming. In the second part of the paper we apply these results to the study of classical correlation functions. We provide a complete list of tight inequalities for the two party case with ( m , n ) dichotomic observables when m = 4, n = 4 and when min{ m , n } ⩽ 3, and give a new general family of correlation inequalities.
Bell inequalities play a central role in certifying quantum correlations and underpin protocols such as device-independent quantum key distribution. However, enumerating all Bell inequalities for a given scenario remains intractable beyond the simplest cases, as it requires solving a computationally hard facet enumeration problem on the associated Bell polytope. We propose the Adjacency Sampling method, which builds on the Adjacency Decomposition method but sacrifices completeness for speed. On previously solved Bell polytopes, the method reproduces every known class of inequalities. For scenarios where no complete enumeration exists, it greatly exceeds existing partial results: in L3,3,3,3\mathcal{L}_{3,3,3,3}L3,3,3,3​ we obtain over 1.29×1081.29 \times 10^81.29×108 classes, more than 25 times the previous count; in L4,5,2,2\mathcal{L}_{4,5,2,2}L4,5,2,2​ we nearly triple the known list to 49\,358 classes; and for L4,6,2,2\mathcal{L}_{4,6,2,2}L4,6,2,2​ we report over 4.3 million classes.
Bell's Inequalites structure can be considered in a logical-probabilistic framework, as outlined by Pitowsky [1], where the origin of the inequality was attributed to George Boole’s “conditions of possible experience”. The inequality has then been often renamed the Bell-Boole inequality. An interesting fact is that G. Boole’s method used to establish his probability inequalities stems directly from his mathematical treatment of logic using idempotent symbols (which he called “elective symbols”). The “Boolean Algebra” we consider today bears some major differences with Boole’s original method as thoroughly discussed by Hailperin [2].We proposed recently the “Eigenlogic” approach [3] where we translate Boole’s original logical method to linear algebra using idempotent and also unitary operators and outline the bridges to quantum theories in particular to quantum information [4]. Eigenlogic can thus be a framework for transposing logic in a quantum context, the probabilistic aspects are then simply derived by measurements on logical operators using the Born rule.Bell Inequalities (BI) can be expressed in an operator form where the measurement observables of an experiment are combined to form Bell operators, the outcomes are then derived by using the quantum mechanical mean value (again the Born rule). The popular form adapted for this method is the CHSH form of the BI for spin 1/2 particles or polarized photons with outcomes ±1. Using the isomorphism between idempotent and self-inverse unitary operators (Householder transform) the CHSH Bell operator transforms in Eigenlogic in a combination of idempotent operators from which by using the Born rule one gets the Fine inequality on probabilities.As stated by Khrennikov [5] the BI violation occurs only when incompatible (non-commuting) observables are used in the BI associated experiments. Particularly in the CHSH-BI experiments on an entangled state, mutually unbiased bases (MUB), representing maximally dissimilar contexts, lead to the maximum quantum violation represented by the number 2√2>2. This is the case for the couple of MUB (z,x) associated to Pauli spin operators σ_x and σ_z. In Eigenlogic these (z,x) contexts represent dual logical systems which are at interplay and have an original syntax-semantic interpretation [4]. It has to be outlined that in many quantum algorithms the MUB (z,x), linked by the Hadamard gate which represents the Fourier Transformation between the two bases, provides a quantum algorithmic advantage.The situations of the BI in the so called post-quantum regime are also analyzed by generalizing the concept of PR-Box which relates outputs (a,b) to inputs (x,y) in a two-party correlation by means of the logical equation: a⊕b=x∧y. Using Eigenlogic, families of boxes with all possible combinations of logical functions are analyzed through the equations: f(a,b)=g(x,y), where f and g correspond to the 16 different Boolean functions, giving 256 possible logical equations. The logical equations are transformed in logical operators and used to define the associated Bell operator. 16 cases of the PR-Box type (considering all the possible complementations of the variables a,b,x,y) violate the CHSH-BI maximally with the number 4>2√2 (Tsirelson’s bound). Another family of 32 logical cases gives a CHSH-BI violation of 3.33 also beyond the quantum limit; this is the case for the logical equation: a∨b=x∧y.[1] Pitowsky, I., George Boole’s ‘conditions of possible experience’ and the quantum puzzle. Brit. J. Phil. Sci., 45:95–125 (1994).[2] Hailperin, T. Boole’s Algebra isn’t Boolean algebra. A description using modern algebra, of what Boole really did create. Math. Mag. 54(4): 172–184 (1981).[3] Toffano, Z. Eigenlogic in the Spirit of George Boole. Log. Univers. 14, 175–207 (2020). https://doi.org/10.1007/s11787-020-00252-3[4] Toffano, Z.; Dubois, F. Adapting Logic to Physics: The Quantum-Like Eigenlogic Program. Entropy 2020, 22, 139. https://doi.org/10.3390/e22020139[5] Khrennikov, A. Contextuality, Complementarity, Signaling, and Bell Tests. Entropy 2022, 24, 1380. https://doi.org/10.3390/e24101380
Tight Bell inequalities are facets of Pitowsky's correlation polytope and are usually obtained from its extreme points by solving the hull problem.Here, we present an alternative method based on a combination of algebraic results on extensions of measures and variable-elimination methods, e.g., the Fourier-Motzkin method.Our method is shown to overcome some of the computational difficulties associated with the hull problem in some nontrivial cases.Moreover, it provides an explanation for the arising of only a finite number of families of Bell inequalities in measurement scenarios where one experimenter can choose between an arbitrary number of different measurements.
FINDING: Buscemi's framework unifies Bell inequalities with entanglement witnesses via "semidefinite programming" and "facet structure" of correlation polytopes, showing quantum violations correspond to specific geometric facets. | MATH: Bell inequalities are linear inequalities over the correlation polytope P \mathcal{P} P; quantum correlations form a convex set Q \mathcal{Q} Q strictly larger than P \mathcal{P} P (local hidden variable polytope). Buscemi's unification maps entanglement witnesses (Hermitian operators W≥0 W \geq 0 W≥0 with Tr(Wρ)≥0 \mathrm{Tr}(W\rho) \geq 0 Tr(Wρ)≥0 for separable ρ \rho ρ) to Bell-type inequalities via a "quantum channel" transformation. Key constants: the Tsirelson bound 22 2\sqrt{2} 22​ for CHSH, and the ratio 22/2=2≈1.414 2\sqrt{2}/2 = \sqrt{2} \approx 1.414 22​/2=2​≈1.414 (not a golden ratio, but a quadratic irrational). Facet structure: the polytope P \mathcal{P} P has facets defined by inequalities like \( \langle A_1B_1 \rangle + \langle A_1B_2 \rangle + \langle A_2B_1 \r Author: Andrew Stewart Caldin, Independent Researcher, UK. Part of the E8 Intelligence Research series. Platform: e8intelligence.com