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

Journal of Mathematical Physics

Bell inequalities on quantum logics

Sylvia Pulmannová, Vladimír Majerník

Published Jun 1, 1992• 30 citations
Publisher

Abstract

Three types of Bell inequalities, expressed in terms of quantum logics (orthomodular lattices) and states on them, are studied. It is shown that the two first types are equivalent to the subadditivity of the corresponding state. The third type is equivalent to the existence of a Boolean quotient B of the orthomodular lattice L and a state s̄ on B, such that s̄⋅φ=s, where s is the state on L and φ:L→B is the quotient mapping.

DOI
10.1063/1.529638

Related papers

States and Boolean Algebra

Nabila Nassiief Mikhaeel, Basim Samir Labib

We investigate subadditive measures on orthomodular lattices. We show as the main result that the Boolean algebra, the special metric orthomodular lattice and the orthomodular lattice which is unital with respect to subadditive states are equivalent. This result may find an application in the foundation of quantum theories and mathematical logic.

Algebra Colloquium•Dec 1, 2008•0 citations

Bell-Type Inequalities for Bivariate Maps on Orthomodular Lattices

Jarosław Pykacz, L’ubica Valášková, Oľga Nánásiová

Bell-type inequalities on orthomodular lattices, in which conjunctions of propositions are not modeled by meets but by maps for simultaneous measurements ( $$s$$ -maps), are studied. It is shown, that the most simple of these inequalities, that involves only two propositions, is always satisfied, contrary to what happens in the case of traditional version of this inequality in which conjunctions of propositions are modeled by meets. Equivalence of various Bell-type inequalities formulated with the aid of bivariate maps on orthomodular lattices is studied. Our investigations shed new light on the interpretation of various multivariate maps defined on orthomodular lattices already studied in the literature. The paper is concluded by showing the possibility of using $$s$$ -maps and $$j$$ -maps to represent counterfactual conjunctions and disjunctions of non-compatible propositions about quantum systems.

arXiv:1409.3744•Foundations of Physics•May 18, 2015•7 citations

Quantum logics close to Boolean algebras

Mirko Navara, Pavel Pták

We consider orthomodular posets endowed with a symmetric difference. We call them ODPs. Expressed in the quantum logic language, we consider quantum logics with an XOR-type connective. We study three classes of "almost Boolean" ODPs, two of them defined by requiring rather specific behaviour of infima and the third by a Boolean-like behaviour of Frink ideals. We establish a (rather surprising) inclusion between the three classes, shadding thus light on their intrinsic properties. (More details can be found in the Introduction that follows.) Let us only note that the orthomodular posets pursued here, though close to Boolean algebras (i.e., close to standard quantum logics), still have a potential for an arbitrarily high degree of non-compatibility and hence they may enrich the studies of mathematical foundations of quantum mechanics.

arXiv:2101.05501•Jan 14, 2021•0 citations

Systems of quantum logic

R I G Hughes

According to quantum mechanics, the pure states of a microsystem are represented by vectors in a Hilbert Space. Sentences of the form, "x є L" (where x is the state vector for a system, L a subspace of the appropriate Hilbert space), may be called Q-propositions: such sentences serve to summarise our information about the results of possible experiments on the system. Quantum logic investigates the relations which hold among the Q-propositions about a given physical sys tem. These logical relations correspond to algebraic relations among the subspaces of Hilbert space. The algebra of this set of subspaces is non-Boolean, and may be regarded either as an orthomodular lattice or as a partial Boolean algebra. With each type of structure we can associate a logic. A general approach to the semantics for such a logic is provided in terms of interpretations of a formal language within an algebraic structure; an interpretation maps sentences of the language homomorphically onto elements of the structure. When the structure in question is a Boolean algera, the resulting logic is classical; here we develop a semantics for the logic associated with partial Boolean algebras. Two systems of proof, based on the natural deduction systems of Gentzen, are shown for this logic. With respect to the given sematics, these calculi are sound and weakly complete. Strong completeness is conjectured. Quantum logic deals with the logical relations between sentences, and so is properly called a logic. However, it is the logic appropriate to a limited class of sentences: proposals that it should replace classical logic wherever the latter is used should be viewed with suspicion.

•Jan 1, 2010•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

Boolean embeddings of orthomodular sets and quantum logic

Neal Zierler, Michael Schlessinger

By a “quantum logic” we mean a pair F, P where P is a set and F is a set of functions from P to the closed real unit interval satisfying three postulates which we describe in intuitive terms here. Cf. [2], [4], [7]. P may be interpreted as the set of events and F the set of states of a “physical system”, and f(x) then becomes the probability of occurrence of the event x in the state f. Since the outcome of an experiment is an estimate for some f(x), or a collection of such estimates, it is natural to identify events which cannot be distinguished by experiment.

Duke Mathematical Journal•Jun 1, 1965•73 citations
Three types of Bell inequalities, expressed in terms of quantum logics (orthomodular lattices) and states on them, are studied. It is shown that the two first types are equivalent to the subadditivity of the corresponding state. The third type is equivalent to the existence of a Boolean quotient B of the orthomodular lattice L and a state s̄ on B, such that s̄⋅φ=s, where s is the state on L and φ:L→B is the quotient mapping.
Bell-type inequalities on orthomodular lattices, in which conjunctions of propositions are not modeled by meets but by maps for simultaneous measurements ( sss -maps), are studied. It is shown, that the most simple of these inequalities, that involves only two propositions, is always satisfied, contrary to what happens in the case of traditional version of this inequality in which conjunctions of propositions are modeled by meets. Equivalence of various Bell-type inequalities formulated with the aid of bivariate maps on orthomodular lattices is studied. Our investigations shed new light on the interpretation of various multivariate maps defined on orthomodular lattices already studied in the literature. The paper is concluded by showing the possibility of using sss -maps and jjj -maps to represent counterfactual conjunctions and disjunctions of non-compatible propositions about quantum systems.
We consider orthomodular posets endowed with a symmetric difference. We call them ODPs. Expressed in the quantum logic language, we consider quantum logics with an XOR-type connective. We study three classes of "almost Boolean" ODPs, two of them defined by requiring rather specific behaviour of infima and the third by a Boolean-like behaviour of Frink ideals. We establish a (rather surprising) inclusion between the three classes, shadding thus light on their intrinsic properties. (More details can be found in the Introduction that follows.) Let us only note that the orthomodular posets pursued here, though close to Boolean algebras (i.e., close to standard quantum logics), still have a potential for an arbitrarily high degree of non-compatibility and hence they may enrich the studies of mathematical foundations of quantum mechanics.
According to quantum mechanics, the pure states of a microsystem are represented by vectors in a Hilbert Space. Sentences of the form, "x є L" (where x is the state vector for a system, L a subspace of the appropriate Hilbert space), may be called Q-propositions: such sentences serve to summarise our information about the results of possible experiments on the system. Quantum logic investigates the relations which hold among the Q-propositions about a given physical sys tem. These logical relations correspond to algebraic relations among the subspaces of Hilbert space. The algebra of this set of subspaces is non-Boolean, and may be regarded either as an orthomodular lattice or as a partial Boolean algebra. With each type of structure we can associate a logic. A general approach to the semantics for such a logic is provided in terms of interpretations of a formal language within an algebraic structure; an interpretation maps sentences of the language homomorphically onto elements of the structure. When the structure in question is a Boolean algera, the resulting logic is classical; here we develop a semantics for the logic associated with partial Boolean algebras. Two systems of proof, based on the natural deduction systems of Gentzen, are shown for this logic. With respect to the given sematics, these calculi are sound and weakly complete. Strong completeness is conjectured. Quantum logic deals with the logical relations between sentences, and so is properly called a logic. However, it is the logic appropriate to a limited class of sentences: proposals that it should replace classical logic wherever the latter is used should be viewed with suspicion.
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
By a “quantum logic” we mean a pair F, P where P is a set and F is a set of functions from P to the closed real unit interval satisfying three postulates which we describe in intuitive terms here. Cf. [2], [4], [7]. P may be interpreted as the set of events and F the set of states of a “physical system”, and f(x) then becomes the probability of occurrence of the event x in the state f. Since the outcome of an experiment is an estimate for some f(x), or a collection of such estimates, it is natural to identify events which cannot be distinguished by experiment.