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:2311.12191

Quantum implications in orthomodular posets

Kadir Emir, Jan Paseka

Published Nov 20, 2023• 2 citations
arXivHTMLPDF

Abstract

We show that, for every orthogonal lub-complete poset P, we can introduce multiple-valued implications sharing properties with quantum implications presented for orthomodular lattices by Kalmbach. We call them classical implication, Kalmbach implication, non-tolens implication, Dishkant implication and Sasaki implication. If the classical implication satisfies the order property, then the corresponding orthologic becomes classical and vice versa. If the Kalmbach or non-tolens or Dishkant or Sasaki implication meets the order property, then the corresponding orthologic becomes quantum and vice versa. A related result for the modus ponens rule is obtained.

DOI
10.48550/arxiv.2311.12191

Related papers

Binary orthologic with modus ponens is either orthomodular or distributive

Mladen Pavičić, Norman D. Megill

Abstract. We show that binary orthologic becomes either quantum or classical logic when nothing but modus ponens rule is added to it, depending on the kind of the operation of implication used. We also show that in the usual approach the rule characterizes neither quantum nor classical logic. The dierence turns out to stem from the chosen valuation on a model of a logic. Thus algebraic mappings of axioms of standard quantum logics would fail to yield an orthomodular lattice if a unary|as opposed to binary|valuation were used. Instead, non-orthomodular nontrivial varieties of orthologic are obtained. We also discuss the computational eciency of the binary quantum logic and stress its importance for quantum computation and related algorithms.

Helvetica Physica Acta (Switzerland)•Dec 1, 1998•18 citations

An axiomatisation of quantum logic

Ian Clark

The purpose of this paper is to give an axiom system for quantum logic. Here quantum logic is considered to have the structure of an orthomodular lattice. Some authors assume that it has the structure of an orthomodular poset. In finding this axiom system the implication algebra given in Finch [1] has been very useful. Finch shows there that this algebra can be produced from an orthomodular lattice and vice versa. Definition. An orthocomplementation N on a poset (partially ordered set) whose partial ordering is denoted by ≤ and which has least and greatest elements 0 and 1 is a unary operation satisfying the following: (1) the greatest lower bound of a and Na exists and is 0, (2) a ≤ b implies Nb ≤ Na, (3) NNa = a. Definition. An orthomodular lattice is a lattice with meet ∧, join ∨, least and greatest elements 0 and 1 and an orthocomplementation N satisfying where a ≤ b means a ∧ b = a, as usual. Definition. A Finch implication algebra is a poset with a partial ordering ≤, least and greatest elements 0 and 1 which is orthocomplemented by N. In addition, it has a binary operation → satisfying the following: An orthomodular lattice gives a Finch implication algebra by defining → by A Finch implication algebra can be changed into an orthomodular lattice by defining the meet ∧ and join ∨ by The orthocomplementation is unchanged in both cases.

Journal of Symbolic Logic•Sep 1, 1973•13 citations

A Rule-Based Logic for Quantum Information

Olivier Brunet

In the present article, we explore a new approach for the study of orthomodular lattices, where we replace the problematic conjunction by a binary operator, called the Sasaki projection. We present a characterization of orthomodular lattices based on the use of an algebraic version of the Sasaki projection operator (together with orthocomplementation) rather than on the conjunction. We then define of a new logic, which we call Sasaki Orthologic, which is closely related to quantum logic, and provide a rule-based definition of this logic.

arXiv:cs/0504018•Apr 6, 2005•2 citations

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

On quantum implication

Yousef Younes, Ingo Schmitt

Abstract Logic is an algebraic structure that defines a set of abstract rules which govern an area of interest. The abstraction property of the rules makes them reusable tools to model different problems and to reason with them. The proliferation of quantum theory brought attention to quantum logic which is a lattice of projectors and it is of importance to quantum computing. Unfortunately, basic tools like implication are not sufficiently studied in that logic, which prevents us from exploiting the power of quantum mechanics in reasoning. This note investigates the implication issue in quantum logic and defines a quantum implication operator for compatible events as well as for incompatible events. The suggested operator depends both on the angle between the vector sub-spaces of the involved events and the angles between the system state and the vector sub-spaces. It differentiates between three cases depending on the angle between the events’ sub-spaces. The article further shows through an example that some classical reasoning rules such as Modus Ponens and Modus Tollens hold given the suggested implication.

Quantum Machine Intelligence•May 15, 2019•6 citations

Quasi-Implicative Lattices and the Logic of Quantum Mechanics

Gary M. Hardegree

Mittelstaedt has defined the class of quasi-implicative lattices and shown that an ortholattice (orthocomplemented lattice) is quasi-implicative exactly if it is orthomodular (quasi-modular). He has also shown that the quasi-implication operation is uniquely determined by the quasi-implicative conditions. One of Mittelstaedt's conditions, however, seems to lack immediate intuitive motivation. Consequently, this paper seeks to provide a number of reformulations of the quasi-implicative conditions which are more intuitively plausible. Three sets of conditions are examined, and it is shown that each set of conditions is both necessary and sufficient to ensure that an ortholattice is orthomodular, and each set of conditions uniquely specifies the implication operation to be Mittelstaedt's quasi-implication. Various properties of the quasi-implication are then investigated. In particular, it is shown that the quasi-implication fails to satisfy a number of laws associated with the classical material conditional. Various weakenings of these laws, satisfied by the quasi-implication, are also discussed

Zeitschrift für Naturforschung A•Nov 1, 1975•10 citations
We show that, for every orthogonal lub-complete poset P, we can introduce multiple-valued implications sharing properties with quantum implications presented for orthomodular lattices by Kalmbach. We call them classical implication, Kalmbach implication, non-tolens implication, Dishkant implication and Sasaki implication. If the classical implication satisfies the order property, then the corresponding orthologic becomes classical and vice versa. If the Kalmbach or non-tolens or Dishkant or Sasaki implication meets the order property, then the corresponding orthologic becomes quantum and vice versa. A related result for the modus ponens rule is obtained.
Abstract. We show that binary orthologic becomes either quantum or classical logic when nothing but modus ponens rule is added to it, depending on the kind of the operation of implication used. We also show that in the usual approach the rule characterizes neither quantum nor classical logic. The dierence turns out to stem from the chosen valuation on a model of a logic. Thus algebraic mappings of axioms of standard quantum logics would fail to yield an orthomodular lattice if a unary|as opposed to binary|valuation were used. Instead, non-orthomodular nontrivial varieties of orthologic are obtained. We also discuss the computational eciency of the binary quantum logic and stress its importance for quantum computation and related algorithms.
The purpose of this paper is to give an axiom system for quantum logic. Here quantum logic is considered to have the structure of an orthomodular lattice. Some authors assume that it has the structure of an orthomodular poset. In finding this axiom system the implication algebra given in Finch [1] has been very useful. Finch shows there that this algebra can be produced from an orthomodular lattice and vice versa. Definition. An orthocomplementation N on a poset (partially ordered set) whose partial ordering is denoted by ≤ and which has least and greatest elements 0 and 1 is a unary operation satisfying the following: (1) the greatest lower bound of a and Na exists and is 0, (2) a ≤ b implies Nb ≤ Na, (3) NNa = a. Definition. An orthomodular lattice is a lattice with meet ∧, join ∨, least and greatest elements 0 and 1 and an orthocomplementation N satisfying where a ≤ b means a ∧ b = a, as usual. Definition. A Finch implication algebra is a poset with a partial ordering ≤, least and greatest elements 0 and 1 which is orthocomplemented by N. In addition, it has a binary operation → satisfying the following: An orthomodular lattice gives a Finch implication algebra by defining → by A Finch implication algebra can be changed into an orthomodular lattice by defining the meet ∧ and join ∨ by The orthocomplementation is unchanged in both cases.
In the present article, we explore a new approach for the study of orthomodular lattices, where we replace the problematic conjunction by a binary operator, called the Sasaki projection. We present a characterization of orthomodular lattices based on the use of an algebraic version of the Sasaki projection operator (together with orthocomplementation) rather than on the conjunction. We then define of a new logic, which we call Sasaki Orthologic, which is closely related to quantum logic, and provide a rule-based definition of this logic.
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.
Abstract Logic is an algebraic structure that defines a set of abstract rules which govern an area of interest. The abstraction property of the rules makes them reusable tools to model different problems and to reason with them. The proliferation of quantum theory brought attention to quantum logic which is a lattice of projectors and it is of importance to quantum computing. Unfortunately, basic tools like implication are not sufficiently studied in that logic, which prevents us from exploiting the power of quantum mechanics in reasoning. This note investigates the implication issue in quantum logic and defines a quantum implication operator for compatible events as well as for incompatible events. The suggested operator depends both on the angle between the vector sub-spaces of the involved events and the angles between the system state and the vector sub-spaces. It differentiates between three cases depending on the angle between the events’ sub-spaces. The article further shows through an example that some classical reasoning rules such as Modus Ponens and Modus Tollens hold given the suggested implication.
Mittelstaedt has defined the class of quasi-implicative lattices and shown that an ortholattice (orthocomplemented lattice) is quasi-implicative exactly if it is orthomodular (quasi-modular). He has also shown that the quasi-implication operation is uniquely determined by the quasi-implicative conditions. One of Mittelstaedt's conditions, however, seems to lack immediate intuitive motivation. Consequently, this paper seeks to provide a number of reformulations of the quasi-implicative conditions which are more intuitively plausible. Three sets of conditions are examined, and it is shown that each set of conditions is both necessary and sufficient to ensure that an ortholattice is orthomodular, and each set of conditions uniquely specifies the implication operation to be Mittelstaedt's quasi-implication. Various properties of the quasi-implication are then investigated. In particular, it is shown that the quasi-implication fails to satisfy a number of laws associated with the classical material conditional. Various weakenings of these laws, satisfied by the quasi-implication, are also discussed