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:1609.00822 · Advances in Mathematical Physics

Classical Logic and Quantum Logic with Multiple and Common Lattice Models

Mladen Pavičić

Published Jan 1, 2016• 11 citations
arXivHTMLPDF

Abstract

We consider a proper propositional quantum logic and show that it has multiple disjoint lattice models, only one of which is an orthomodular lattice (algebra) underlying Hilbert (quantum) space. We give an equivalent proof for the classical logic which turns out to have disjoint distributive and nondistributive ortholattices. In particular, we prove that both classical logic and quantum logic are sound and complete with respect to each of these lattices. We also show that there is one common nonorthomodular lattice that is a model of both quantum and classical logic. In technical terms, that enables us to run the same classical logic on both a digital (standard, two-subset, 0-1-bit) computer and a nondigital (say, a six-subset) computer (with appropriate chips and circuits). With quantum logic, the same six-element common lattice can serve us as a benchmark for an efficient evaluation of equations of bigger lattice models or theorems of the logic.

DOI
10.1155/2016/6830685

Related papers

Non orthomodular models for both standard quantum logic and standard classical logic : repercussions for quantum computers

Mladen Pavičić, Norman D. Megill

Abstract. It is shown that propositional calculuses of both quantum and classical logics are noncategorical. We find that quantum logic is in addition to an orthomodular lattice also modeled by a weakly orthomodular lattice and that classical logic is in addition to a Boolean algebra also modeled by a weakly distributive lattice. Both new models turn out to be non-orthomodular. We prove the soundness and completeness of the calculuses for the models. We also prove that all the operations in an orthomodular lattice are five-fold defined. In the end we discuss possible repercussions of our results to quantum computations and quantum computers.

•Oct 1, 1999•14 citations

Quantum logic for genuine quantum simulators

Mladen Pavičić

Recently we proved that there are two non-isomorphic models of the calculus of quantum logic corresponding to an infinite-dimensional Hilbert space representation: an orthomodular lattice and a weakly orthomodular lattice. We also discovered that there are two non-isomorphic models of the calculus of classical logic: a distributive lattice (Boolean algebra) and a weakly distributive lattice. In this work we consider implications of these results to a quantum simulator which should mimic quantum systems by giving precise instructions on how to produce input state, how to evolve them, and how to read off the final states. We analyze which conditions quantum states of a quantum computer currently obey and which they should obey in order to enable full quantum computing, i.e., proper quantum mathematics. In particular we find several new conditions which lattices of Hilbert space subspaces must satisfy.

Proceedings of SPIE, the International Society for Optical Engineering/Proceedings of SPIE•Jul 13, 2000•0 citations

Quantum Logic as the Logic of Contexts

Haruki Emori, Atsushi Iriki, Andrei Khrennikov +1 more

Quantum logic is usually presented as a non-classical departure from ordinary reasoning forced on us by quantum mechanics, with classical logic kept as the secure starting point. We argue for the opposite order of explanation in a finite and fully computable setting. The free orthomodular lattice on two generators has ninety-six elements, the direct product of a six-element non-distributive factor and a sixteen-element Boolean factor. Reading the first factor as a register of contexts and the second as Boolean content, we obtain a calculus whose elements are context--bit-vector pairs and whose operations act component by component. With this calculus we establish three results. First, we classify the six layers by commutativity, identifying the central kernel of context-neutral propositions together with a dual central layer in which all complementary contexts are present. Second, we show that orthocomplementation rearranges the layers exactly as the complementation of the small factor rearranges its elements, which makes the duality among the layers rigid rather than accidental. Third, we prove that the operation forgetting the context is a surjective homomorphism of orthocomplemented lattices whose quotient is the classical Boolean algebra, so that classical logic is a six-to-one, information-losing image of the contextual calculus.

quant-pharXiv:2607.09032•Jul 13, 2026•0 citations

Quantum logic

Alireza Moazzen

This article employs a descriptive-analytical method with an algebraic and axiomatic approach to address quantum logic. Through several thought experiments, it is demonstrated that the distributive law for propositions does not hold in quantum mechanics. Therefore, the logic governing this domain of science is not classical logic. In fact, the algebra corresponding to the logic of quantum propositions is an orthomodular lattice, which is why the distributive law is not necessarily valid for such propositions. In quantum logic, various definitions are offered for the implication operator. Since none of these operators satisfy the deduction theorem, a suitable implication operator with this property must be defined. This objective is achieved by defining a unified quantum logic. By constructing a Lindenbaum-Tarski algebra for this unified quantum logic, it can be shown that it is indeed a quantum logic. Dishkant presented an embedding of quantum logic into the Br-modal logic system. This provides an appropriate semantics for quantum logic. A suitable model for this logic is the closed subspaces of a Hilbert space.

•Nov 1, 2025•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

Quantum Logic as Classical Logic

Simon Kramer

We propose a semantic representation of the standard quantum logic QL within a classical, normal modal logic, and this via a lattice-embedding of orthomodular lattices into Boolean algebras with one modal operator. Thus our classical logic is a completion of the quantum logic QL. In other words, we refute Birkhoff and von Neumann's classic thesis that the logic (the formal character) of Quantum Mechanics would be non-classical as well as Putnam's thesis that quantum logic (of his kind) would be the correct logic for propositional inference in general. The propositional logic of Quantum Mechanics is modal but classical, and the correct logic for propositional inference need not have an extroverted quantum character. One normal necessity modality suffices to capture the subjectivity of observation in quantum experiments, and this thanks to its failure to distribute over classical disjunction. The key to our result is the translation of quantum negation as classical negation of observability.

arXiv:1406.3526•Jun 13, 2014•3 citations
We consider a proper propositional quantum logic and show that it has multiple disjoint lattice models, only one of which is an orthomodular lattice (algebra) underlying Hilbert (quantum) space. We give an equivalent proof for the classical logic which turns out to have disjoint distributive and nondistributive ortholattices. In particular, we prove that both classical logic and quantum logic are sound and complete with respect to each of these lattices. We also show that there is one common nonorthomodular lattice that is a model of both quantum and classical logic. In technical terms, that enables us to run the same classical logic on both a digital (standard, two-subset, 0-1-bit) computer and a nondigital (say, a six-subset) computer (with appropriate chips and circuits). With quantum logic, the same six-element common lattice can serve us as a benchmark for an efficient evaluation of equations of bigger lattice models or theorems of the logic.
Abstract. It is shown that propositional calculuses of both quantum and classical logics are noncategorical. We find that quantum logic is in addition to an orthomodular lattice also modeled by a weakly orthomodular lattice and that classical logic is in addition to a Boolean algebra also modeled by a weakly distributive lattice. Both new models turn out to be non-orthomodular. We prove the soundness and completeness of the calculuses for the models. We also prove that all the operations in an orthomodular lattice are five-fold defined. In the end we discuss possible repercussions of our results to quantum computations and quantum computers.
Recently we proved that there are two non-isomorphic models of the calculus of quantum logic corresponding to an infinite-dimensional Hilbert space representation: an orthomodular lattice and a weakly orthomodular lattice. We also discovered that there are two non-isomorphic models of the calculus of classical logic: a distributive lattice (Boolean algebra) and a weakly distributive lattice. In this work we consider implications of these results to a quantum simulator which should mimic quantum systems by giving precise instructions on how to produce input state, how to evolve them, and how to read off the final states. We analyze which conditions quantum states of a quantum computer currently obey and which they should obey in order to enable full quantum computing, i.e., proper quantum mathematics. In particular we find several new conditions which lattices of Hilbert space subspaces must satisfy.
Quantum logic is usually presented as a non-classical departure from ordinary reasoning forced on us by quantum mechanics, with classical logic kept as the secure starting point. We argue for the opposite order of explanation in a finite and fully computable setting. The free orthomodular lattice on two generators has ninety-six elements, the direct product of a six-element non-distributive factor and a sixteen-element Boolean factor. Reading the first factor as a register of contexts and the second as Boolean content, we obtain a calculus whose elements are context--bit-vector pairs and whose operations act component by component. With this calculus we establish three results. First, we classify the six layers by commutativity, identifying the central kernel of context-neutral propositions together with a dual central layer in which all complementary contexts are present. Second, we show that orthocomplementation rearranges the layers exactly as the complementation of the small factor rearranges its elements, which makes the duality among the layers rigid rather than accidental. Third, we prove that the operation forgetting the context is a surjective homomorphism of orthocomplemented lattices whose quotient is the classical Boolean algebra, so that classical logic is a six-to-one, information-losing image of the contextual calculus.
This article employs a descriptive-analytical method with an algebraic and axiomatic approach to address quantum logic. Through several thought experiments, it is demonstrated that the distributive law for propositions does not hold in quantum mechanics. Therefore, the logic governing this domain of science is not classical logic. In fact, the algebra corresponding to the logic of quantum propositions is an orthomodular lattice, which is why the distributive law is not necessarily valid for such propositions. In quantum logic, various definitions are offered for the implication operator. Since none of these operators satisfy the deduction theorem, a suitable implication operator with this property must be defined. This objective is achieved by defining a unified quantum logic. By constructing a Lindenbaum-Tarski algebra for this unified quantum logic, it can be shown that it is indeed a quantum logic. Dishkant presented an embedding of quantum logic into the Br-modal logic system. This provides an appropriate semantics for quantum logic. A suitable model for this logic is the closed subspaces of a Hilbert space.
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.
We propose a semantic representation of the standard quantum logic QL within a classical, normal modal logic, and this via a lattice-embedding of orthomodular lattices into Boolean algebras with one modal operator. Thus our classical logic is a completion of the quantum logic QL. In other words, we refute Birkhoff and von Neumann's classic thesis that the logic (the formal character) of Quantum Mechanics would be non-classical as well as Putnam's thesis that quantum logic (of his kind) would be the correct logic for propositional inference in general. The propositional logic of Quantum Mechanics is modal but classical, and the correct logic for propositional inference need not have an extroverted quantum character. One normal necessity modality suffices to capture the subjectivity of observation in quantum experiments, and this thanks to its failure to distribute over classical disjunction. The key to our result is the translation of quantum negation as classical negation of observability.