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

Algebraic computations in quantum logics

Jeannine J. M. Gabriëls

Published Jan 1, 2015• 0 citations
OpenAlex

Abstract

Mathematical description of quantum phenomena requires an event structure more general than a Boolean algebra. For this purpose, Birkhoff and von Neumann proposed the notion of an orthomodular lattice. Its typical feature is the existence of so–called non–commuting events, which are not simultaneously observable (like position and momentum, according to Heisenberg’s uncertainty principle). There is an old open problem whether the word problem for orthomodular lattices is solvable. Is it possible to decide whether two formulas are equivalent? In Boolean algebras, an easy positive answer is given by a transformation of the formula to a unique normal form. This requires the commutativity, associativity, and distributivity of the Boolean operations (disjunction and conjunction). In orthomodular lattices, the corresponding lattice operations (join and meet) violate distributivity. This disables the use of normal forms. We looked for alternative approaches. E.g., the join is only one of six orthomodular lattice operations generalizing the disjunction. In the thesis, we study the question whether some of the 96 binary operations in orthomodular lattices admit normal forms similar to the classical logic. The first question was which operations satisfy the associative identity, eventually under the assumption that some variables commute. Then we studied monotonicity because it is related to distributivity over the meet and join. The conclusion is that there is no pair of operations in orthomodular lattices admitting “Boolean–like” normal forms. In the last chapter we study “Moufang–like” identities, which were inspired by the algebras of quaternions and octonions. These identities generalize associativity and may enable further progress. As a by–product, we proved interesting, yet unknown, properties of some orthomodular lattice operations (e.g., the Sasaki projection). These new tools simplify algebraic computations and give a chance to develop algorithms more general than the current specialized software.

Related papers

Sublattices and Δ-blocks of orthomodular posets

Ivan Chajda, Helmut Länger

Abstract States of quantum systems correspond to vectors in a Hilbert space and observations to closed subspaces. Hence, this logic corresponds to the algebra of closed subspaces of a Hilbert space. This can be considered as a complete lattice with orthocomplementation, but it is not distributive. It satisfies a weaker condition, the so-called orthomodularity. Later on, it was recognized that joins in this structure need not exist provided the subspaces are not orthogonal. Hence, the resulting structure need not be a lattice but a so-called orthomodular poset, more generally an orthoposet only. For orthoposets, we introduce a binary relation $\mathrel \Delta$ and a binary operator $d(x,y)$ that are generalizations of the binary relation $\textrm{C}$ and the commutator $c(x,y)$, respectively, known for orthomodular lattices. We characterize orthomodular posets among orthogonal posets. Moreover, we describe connections between the relations $\mathrel \Delta$ and $\leftrightarrow$ (the latter was introduced by P. Pták and S. Pulmannová) and the operator $d(x,y)$. In addition, we investigate certain orthomodular posets of subsets of a finite set. In particular, we describe maximal orthomodular sublattices and Boolean subalgebras of such orthomodular posets. Finally, we study properties of $\Delta$-blocks with respect to Boolean subalgebras and distributive subposets they include.

arXiv:2004.01962•Journal of Logic and Computation•Jun 25, 2020•0 citations

Kuantum Mantığı

Hatice Kırmacı

Quantum Logic Distributivity And The Algebraic Structure Of Propositions As with many subatomic particles, the question of under what conditions the electron behaves as a particle or as a wave continues to be the subject of research. It was necessary to employ appropriate logic to organise the propositions describing the behaviour of such an object at the subatomic scale into a precise from and to establish coherent relationships between them. Quantum logic, which can be regarded as an interpretation of quantum mechanics, arose from this need. In classical mechanics, the state and properties of a system are described using the propositions of classical logic, which is based on Boolean algebra. In quantum mechanics, however, the fact that the operators representing the measured quantities do not commute has shown that quantum phenomena cannot be described using the propositions of classical logic. It is therefore necessary to have a formal framework suited to the propositions describing quantum phenomena. In our study, we highlight the various differences between classical logic and quantum logic, examine the distributive property and discuss, from the perspective of Birkhoff and von Neumann, the algebraic structure to which quantum logic might correspond. At the conclusion of our research, we find that, in order to assert that all experimental propositions logically equivalent to a given experimental proposition constitute a physical property, the operators corresponding to the measured quantities must commute with one another. Boolean algebra has an algebraic structure that allows classical logic to be formalised. In such algebra, the distributive property holds; thus, distributivity does not pose a problem for classical logic. Consequently, the distributive property does not always hold in quantum logic and quantum systems can be modelled using orthomodular lattices associated with closed subspaces of Hilbert space. We believe that this model must evolve in parallel with the discovery of new quantum phenomena and that it provides a framework conductive to this evolution. Keywords: Quantum logic; distributivity; partially order sets (posets); lattice; orthomodular lattice; Hilbert space; Boolean algebra.

•Sep 9, 2026•0 citations

Quantum Logic

David J. Foulis, Richard J. Greechie, María Luisa Dalla Chiara +1 more

This chapter contains sections titled: Brief History of Quantum Logic The Origin of Quantum Logic The Work of Birkhoff and von Neumann The Orthomodular Law The Interpretation of Meet and Join Standard Quantum Logic The Orthomodular Lattice of Projections on a Hilbert Space Observables States Superposition of States Dynamics Combinations of Standard Quantum Logics Orthoalgebras as Models for a General Quantum Logic Orthoalgebras Compatibility, Conjunction, and Disjunction in an Orthoalgebra Probability Measures on and Supports in an Orthoalgebra Cartesian and Tensor Products of Orthoalgebras The Logic of a Physical System The Canonical Mapping Critique of Quantum Logic The Logician's Approach Algebraic and Possible-World Semantics Orthodox Quantum Logic Semantic Characterizations of QL An Axiomatization of QL Orthologic and Unsharp Quantum Logics Hilbert-Space Models of the Brouwer–Zadeh Logics Partial Quantum Logics Algebraic Semantics for WPaQL An Axiomatization of Partial Quantum Logics Critique of Abstract Quantum Logics

Wiley eBooks•Aug 24, 2005•1 citation

The center of an orthologic

Barbara Jeffcott

Since 1933, when Kolmogorov laid the foundations for probability and statistics as we know them today [1], it has been recognized that propositions asserting that such and such an event occurred as a consequence of the execution of a particular random experiment tend to band together and form a Boolean algebra. In 1936, Birkhoff and von Neumann [2] suggested that the so-called logic of quantum mechanics should not be a Boolean algebra, but rather should form what is now called a modular ortholattice [3]. Presumably, the departure from Boolean algebras encountered in quantum mechanics can be attributed to the fact that in quantum mechanics, one must consider more than one physical experiment, e.g., an experiment measuring position, an experiment measuring charge, an experiment measuring momentum, etc., and, because of the uncertainty principle, these experiments need not admit a common refinement in terms of which the Kolmogorov theory is directly applicable. Mackey's Axioms I–VI for quantum mechanics [4] imply that the logic of quantum mechanics should be a σ-orthocomplete orthomodular poset [5]. Most contemporary practitioners of quantum logic seem to agree that a quantum logic is (at least) an orthomodular poset [6], [7], [8], [9], [10] or some variation thereof [11]. P. D. Finch [12] has shown that every completely orthomodular poset is the logic arising from sets of Boolean logics, where these sets have a structure similar to the structures generally given to quantum logic. In all of these versions of quantum logic, a fundamental relation, the relation of compatibility or commutativity, plays a decisive role.

Journal of Symbolic Logic•Dec 1, 1972•15 citations

Logique quantique et intrication

Pierre Uzan

Due to the failure of the classical principles of bivalence and verifunctionality, the logic of experimental propositions relative to quantum systems cannot be interpreted in Boolean algebras. However, we cannot say neither that this logic is captured by orthomodular lattices, as claimed by many authors along the line of Birkhoff's and von Neumann's standard approach. For the alleged violation of distributivity is based on the possibility of combining statements relative to complementary contexts, which does not refer to any experience and, consequently, has no meaning. Indeed, quantum logic should be interpreted in partial, transitive Boolean algebras whose compatibility relation limits the application of the connectives within each of its Boolean sub-algebras, which refer to partial, classical descriptions. Moreover, this approach of quantum logic makes it possible to deal with composite systems, which was not possible to do within the standard approach, and then to deal with the fundamental notion of quantum entanglement. The latter notion can be represented by a series of axioms of the object language that restrict the set of experimental statements bearing on a composite system, while its close link to the notion of complementarity can be expressed in the metalanguage.

Logos & Episteme•Jan 1, 2014•0 citations

On ring-like structures of lattice-ordered numerical events

Dietmar W. Dorninger, Helmut Länger

Let [Formula: see text] be a set of states of a physical system. The probabilities [Formula: see text] of the occurrence of an event when the system is in different states [Formula: see text] define a function from [Formula: see text] to [Formula: see text] called a numerical event or, more accurately, an [Formula: see text]-probability. Sets of [Formula: see text]-probabilities ordered by the partial order of functions give rise to so-called algebras of [Formula: see text]-probabilities, in particular, to the ones that are lattice-ordered. Among these, there are the [Formula: see text]-algebras known from probability theory and the Hilbert-space logics which are important in quantum-mechanics. Any algebra of [Formula: see text]-probabilities can serve as a quantum-logic, and it is of special interest when this logic turns out to be a Boolean algebra because then the observed physical system will be classical. Boolean algebras are in one-to-one correspondence to Boolean rings, and the question arises to find an analogue correspondence for lattice-ordered algebras of [Formula: see text]-probabilities generalizing the correspondence between Boolean algebras and Boolean rings. We answer this question by defining ring-like structures of events (RLSEs). First, the structure of RLSEs is revealed and Boolean rings among RLSEs are characterized. Then we establish how RLSEs correspond to lattice-ordered algebras of numerical events. Further, functions for associating lattice-ordered algebras of [Formula: see text]-probabilities to RLSEs are studied. It is shown that there are only two ways to assign lattice-ordered algebras of [Formula: see text]-probabilities to RLSEs if one restricts the corresponding mappings to term functions over the underlying orthomodular lattice. These term functions are the very functions by which also the Boolean algebras can be assigned to Boolean rings.

arXiv:2008.04961•Asian-European Journal of Mathematics•Mar 12, 2021•2 citations
Mathematical description of quantum phenomena requires an event structure more general than a Boolean algebra. For this purpose, Birkhoff and von Neumann proposed the notion of an orthomodular lattice. Its typical feature is the existence of so–called non–commuting events, which are not simultaneously observable (like position and momentum, according to Heisenberg’s uncertainty principle). There is an old open problem whether the word problem for orthomodular lattices is solvable. Is it possible to decide whether two formulas are equivalent? In Boolean algebras, an easy positive answer is given by a transformation of the formula to a unique normal form. This requires the commutativity, associativity, and distributivity of the Boolean operations (disjunction and conjunction). In orthomodular lattices, the corresponding lattice operations (join and meet) violate distributivity. This disables the use of normal forms. We looked for alternative approaches. E.g., the join is only one of six orthomodular lattice operations generalizing the disjunction. In the thesis, we study the question whether some of the 96 binary operations in orthomodular lattices admit normal forms similar to the classical logic. The first question was which operations satisfy the associative identity, eventually under the assumption that some variables commute. Then we studied monotonicity because it is related to distributivity over the meet and join. The conclusion is that there is no pair of operations in orthomodular lattices admitting “Boolean–like” normal forms. In the last chapter we study “Moufang–like” identities, which were inspired by the algebras of quaternions and octonions. These identities generalize associativity and may enable further progress. As a by–product, we proved interesting, yet unknown, properties of some orthomodular lattice operations (e.g., the Sasaki projection). These new tools simplify algebraic computations and give a chance to develop algorithms more general than the current specialized software.
Abstract States of quantum systems correspond to vectors in a Hilbert space and observations to closed subspaces. Hence, this logic corresponds to the algebra of closed subspaces of a Hilbert space. This can be considered as a complete lattice with orthocomplementation, but it is not distributive. It satisfies a weaker condition, the so-called orthomodularity. Later on, it was recognized that joins in this structure need not exist provided the subspaces are not orthogonal. Hence, the resulting structure need not be a lattice but a so-called orthomodular poset, more generally an orthoposet only. For orthoposets, we introduce a binary relation Δ\mathrel \DeltaΔ and a binary operator d(x,y)d(x,y)d(x,y) that are generalizations of the binary relation C\textrm{C}C and the commutator c(x,y)c(x,y)c(x,y), respectively, known for orthomodular lattices. We characterize orthomodular posets among orthogonal posets. Moreover, we describe connections between the relations Δ\mathrel \DeltaΔ and ↔\leftrightarrow↔ (the latter was introduced by P. Pták and S. Pulmannová) and the operator d(x,y)d(x,y)d(x,y). In addition, we investigate certain orthomodular posets of subsets of a finite set. In particular, we describe maximal orthomodular sublattices and Boolean subalgebras of such orthomodular posets. Finally, we study properties of Δ\DeltaΔ-blocks with respect to Boolean subalgebras and distributive subposets they include.
Quantum Logic Distributivity And The Algebraic Structure Of Propositions As with many subatomic particles, the question of under what conditions the electron behaves as a particle or as a wave continues to be the subject of research. It was necessary to employ appropriate logic to organise the propositions describing the behaviour of such an object at the subatomic scale into a precise from and to establish coherent relationships between them. Quantum logic, which can be regarded as an interpretation of quantum mechanics, arose from this need. In classical mechanics, the state and properties of a system are described using the propositions of classical logic, which is based on Boolean algebra. In quantum mechanics, however, the fact that the operators representing the measured quantities do not commute has shown that quantum phenomena cannot be described using the propositions of classical logic. It is therefore necessary to have a formal framework suited to the propositions describing quantum phenomena. In our study, we highlight the various differences between classical logic and quantum logic, examine the distributive property and discuss, from the perspective of Birkhoff and von Neumann, the algebraic structure to which quantum logic might correspond. At the conclusion of our research, we find that, in order to assert that all experimental propositions logically equivalent to a given experimental proposition constitute a physical property, the operators corresponding to the measured quantities must commute with one another. Boolean algebra has an algebraic structure that allows classical logic to be formalised. In such algebra, the distributive property holds; thus, distributivity does not pose a problem for classical logic. Consequently, the distributive property does not always hold in quantum logic and quantum systems can be modelled using orthomodular lattices associated with closed subspaces of Hilbert space. We believe that this model must evolve in parallel with the discovery of new quantum phenomena and that it provides a framework conductive to this evolution. Keywords: Quantum logic; distributivity; partially order sets (posets); lattice; orthomodular lattice; Hilbert space; Boolean algebra.
This chapter contains sections titled: Brief History of Quantum Logic The Origin of Quantum Logic The Work of Birkhoff and von Neumann The Orthomodular Law The Interpretation of Meet and Join Standard Quantum Logic The Orthomodular Lattice of Projections on a Hilbert Space Observables States Superposition of States Dynamics Combinations of Standard Quantum Logics Orthoalgebras as Models for a General Quantum Logic Orthoalgebras Compatibility, Conjunction, and Disjunction in an Orthoalgebra Probability Measures on and Supports in an Orthoalgebra Cartesian and Tensor Products of Orthoalgebras The Logic of a Physical System The Canonical Mapping Critique of Quantum Logic The Logician's Approach Algebraic and Possible-World Semantics Orthodox Quantum Logic Semantic Characterizations of QL An Axiomatization of QL Orthologic and Unsharp Quantum Logics Hilbert-Space Models of the Brouwer–Zadeh Logics Partial Quantum Logics Algebraic Semantics for WPaQL An Axiomatization of Partial Quantum Logics Critique of Abstract Quantum Logics
Since 1933, when Kolmogorov laid the foundations for probability and statistics as we know them today [1], it has been recognized that propositions asserting that such and such an event occurred as a consequence of the execution of a particular random experiment tend to band together and form a Boolean algebra. In 1936, Birkhoff and von Neumann [2] suggested that the so-called logic of quantum mechanics should not be a Boolean algebra, but rather should form what is now called a modular ortholattice [3]. Presumably, the departure from Boolean algebras encountered in quantum mechanics can be attributed to the fact that in quantum mechanics, one must consider more than one physical experiment, e.g., an experiment measuring position, an experiment measuring charge, an experiment measuring momentum, etc., and, because of the uncertainty principle, these experiments need not admit a common refinement in terms of which the Kolmogorov theory is directly applicable. Mackey's Axioms I–VI for quantum mechanics [4] imply that the logic of quantum mechanics should be a σ-orthocomplete orthomodular poset [5]. Most contemporary practitioners of quantum logic seem to agree that a quantum logic is (at least) an orthomodular poset [6], [7], [8], [9], [10] or some variation thereof [11]. P. D. Finch [12] has shown that every completely orthomodular poset is the logic arising from sets of Boolean logics, where these sets have a structure similar to the structures generally given to quantum logic. In all of these versions of quantum logic, a fundamental relation, the relation of compatibility or commutativity, plays a decisive role.
Due to the failure of the classical principles of bivalence and verifunctionality, the logic of experimental propositions relative to quantum systems cannot be interpreted in Boolean algebras. However, we cannot say neither that this logic is captured by orthomodular lattices, as claimed by many authors along the line of Birkhoff's and von Neumann's standard approach. For the alleged violation of distributivity is based on the possibility of combining statements relative to complementary contexts, which does not refer to any experience and, consequently, has no meaning. Indeed, quantum logic should be interpreted in partial, transitive Boolean algebras whose compatibility relation limits the application of the connectives within each of its Boolean sub-algebras, which refer to partial, classical descriptions. Moreover, this approach of quantum logic makes it possible to deal with composite systems, which was not possible to do within the standard approach, and then to deal with the fundamental notion of quantum entanglement. The latter notion can be represented by a series of axioms of the object language that restrict the set of experimental statements bearing on a composite system, while its close link to the notion of complementarity can be expressed in the metalanguage.
Let [Formula: see text] be a set of states of a physical system. The probabilities [Formula: see text] of the occurrence of an event when the system is in different states [Formula: see text] define a function from [Formula: see text] to [Formula: see text] called a numerical event or, more accurately, an [Formula: see text]-probability. Sets of [Formula: see text]-probabilities ordered by the partial order of functions give rise to so-called algebras of [Formula: see text]-probabilities, in particular, to the ones that are lattice-ordered. Among these, there are the [Formula: see text]-algebras known from probability theory and the Hilbert-space logics which are important in quantum-mechanics. Any algebra of [Formula: see text]-probabilities can serve as a quantum-logic, and it is of special interest when this logic turns out to be a Boolean algebra because then the observed physical system will be classical. Boolean algebras are in one-to-one correspondence to Boolean rings, and the question arises to find an analogue correspondence for lattice-ordered algebras of [Formula: see text]-probabilities generalizing the correspondence between Boolean algebras and Boolean rings. We answer this question by defining ring-like structures of events (RLSEs). First, the structure of RLSEs is revealed and Boolean rings among RLSEs are characterized. Then we establish how RLSEs correspond to lattice-ordered algebras of numerical events. Further, functions for associating lattice-ordered algebras of [Formula: see text]-probabilities to RLSEs are studied. It is shown that there are only two ways to assign lattice-ordered algebras of [Formula: see text]-probabilities to RLSEs if one restricts the corresponding mappings to term functions over the underlying orthomodular lattice. These term functions are the very functions by which also the Boolean algebras can be assigned to Boolean rings.