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 Physics Conference Series

Quantum Logic Maps and Triangular Norms on D-posets

Ahmed M. Al-Adilee, Mustafa G. Al-Mousawi

Published May 1, 2020• 0 citations
Publisher

Abstract

Abstract In this paper, we propose a type of generalization of triangular norms and quantum logic functions on d-poset algebra. We compare the modified constructions, and properties to the classical properties of the generalized concepts. We show several structures with proof of each type of the proposed generalization. We show several relationships that connect the triangular norms to the quantum logic maps, and also show their relationships to the classical probability space. We provide some explanatory examples that show each structure on d-poset with extra properties that depends on a definition of state.

DOI
10.1088/1742-6596/1530/1/012121

Related papers

Introduction to quantum probability

Cong Cui

This thesis is a review of the quantum logic approach to quantum probability theory which was first studied by Birkhoff and von Neumann in 1936. Our study is based on the more general quantum structure which is known as the $\\sigma$-orthocomplete orthomodular poset or quantum logic. We introduce the definitions of states and observables and show that the quantum probability theory is a generalization of the classical probability theory due to Kolmogorov. Discussions about joint distributions of observables are given, and we also give the general expression of the uncertainty relation in the logico-algebraic sense which generalizes the well-known Heisenberg uncertainty relation. Two examples, the classical probability structure of Kolmogorov and the Hilbert space quantum logic, are given as illustrations throughout the whole discussion.

•Aug 1, 2011•2 citations

On orthoposets of numerical events in quantum logic

Dietmar Dorninger, Helmut Länger

Let S be a set of states of a physical system and p(s) the probability of the occurrence of an event when the system is in state s in S. Such a function p from S to [0,1] is known as a numerical event or more accurately an S-probability. A set P of numerical events including the constant functions 0 and 1 and 1-p with every p in P becomes a poset when ordered by the order of real functions and can serve as a general setting for quantum logics. We call such a poset P a general set of events (GSE). The thoroughly investigated algebras of S-probabilities (including Hilbert logics), concrete logics and Boolean algebras can all be represented within this setting. In this paper we study various classes of GSEs, in particular those that are orthoposets and their interrelations and connections to known logics. Moreover, we characterize GSEs as posets by means of states and discuss the situation for GSEs to be lattices.

quant-pharXiv:2601.00772•Reports on Mathematical Physics•Jan 5, 2026•0 citations

Conditional R-norm entropy and R-norm divergence in quantum logics

Mohammad Hossein Zarenezhad, Abolfazl Ebrahimzadeh

‎This contribution ‎‎deals with the mathematical modeling of R-norm entropy and R-norm divergence in quantum logics. ‎‎W‎e extend some results concerning the R-norm entropy and conditional R-norm entropy given in (Inf. Control 45, 1980), ‎‎‎‎‎to ‎the‎ quantum logics.‎ Firstly, the concepts of ‎‎R-norm entropy ‎and‎ ‎conditional R-norm entropy in quantum logics are introduced. ‎We ‎prove‎ ‎the concavity property for the notion of R-norm entropy in quantum logics ‎and we ‎show‎‎ that this entropy measure does not have the property of sub-additivity in a true sense. ‎It ‎is ‎prove‎n that ‎‎‎the monotonicity ‎property ‎for ‎the suggested type of ‎conditional ‎version ‎of ‎R-norm ‎entropy, holds. Furthermore, we introduce the concept of R-norm divergence of states in quantum logics and we derive basic properties of this quantity. ‎In particular‎, a relationship between the R-norm divergence and the R-norm entropy of partitions is provided.‎‎‎

Journal of mathematical extension.•Jul 22, 2020•0 citations

Probability Measures and Logical Connectives on Quantum Logics

Oľga Nánásiová, L’ubica Valášková, Viera Čerňanová

The present paper is devoted to modelling of a probability measure of logical connectives on a quantum logic via a G-map, which is a special map on it.We follow the work in which the probability of logical conjunction (AND), disjunction (OR), symmetric difference (XOR) and their negations for non-compatible propositions are studied.Now we study all remaining cases of G-maps on quantum logic, namely a probability measure of projections, of implications, and of their negations.We show that unlike classical (Boolean) logic, probability measures of projections on a quantum logic are not necessarilly pure projections.We indicate how it is possible to define a probability measure of implication using a G-map in the quantum logic, and then we study some properties of this measure which are different from a measure of implication in a Boolean algebra.Finally, we compare the properties of a G-map with the properties of a probability measure related to logical connectives on a Boolean algebra.

Journal of Automation Mobile Robotics & Intelligent Systems•Jul 18, 2019•0 citations

Quantum categories for quantum logic

В.Л. Васюков

The paper is the contribution to quantum toposophy focusing on the abstract orthomodular structures (following Dunn-Moss-Wang terminology). Early quantum toposophical approach to "abstract quantum logic" was proposed based on the topos of functors $\mathsf{[E,Sets]}$ where $\mathsf{E}$ is a so-called orthomodular preorder category – a modification of categorically rewritten orthomodular lattice (taking into account that like any lattice it will be a finite co-complete preorder category). In the paper another kind of categorical semantics of quantum logic is discussed which is based on the modification of the topos construction itself – so called $quantos$ – which would be evaluated as a non-classical modification of topos with some extra structure allowing to take into consideration the peculiarity of negation in orthomodular quantum logic. The algebra of subobjects of quantos is not the Heyting algebra but an orthomodular lattice. Quantoses might be apprehended as an abstract reflection of Landsman's proposal of "Bohrification", i.e., the mathematical interpretation of Bohr's classical concepts by commutative $C^*$-algebras, which in turn are studied in their quantum habitat of noncommutative $C^*$-algebras – more fundamental structures than commutative $C^*$-algebras. The Bohrification suggests that topos-theoretic approach also should be modified. Since topos by its nature is an intuitionistic construction then Bohrification in abstract case should be transformed in an application of categorical structure based on an orthomodular lattice which is more general construction than Heyting algebra – orthomodular lattices are non-distributive while Heyting algebras are distributive ones. Toposes thus should be studied in their quantum habitat of "orthomodular" categories i.e. of quntoses. Also an interpretation of some well-known systems of orthomodular quantum logic in quantos of functors $\mathsf{[E,QSets]}$ is constructed where $\mathsf{QSets}$ is a quantos (not a topos) of quantum sets. The completeness of those systems in respect to the semantics proposed is proved.

Logical Investigations•May 21, 2019•0 citations

Order structure and signalling in higher order quantum maps

Anna Jenčová

We study the signalling structure of higher order quantum maps from an order-theoretic perspective, building on the combinatorial characterization of higher order types by Bisio and Perinotti. We have shown in a previous work arxiv:2411.09256 that types are represented by boolean functions called type functions, and that each such function is characterized by a related structure poset. We characterize the distributive lattice generated by all type functions with fixed indices of input and output systems - whose elements we call regular subtypes - by a monotonicity condition. Unlike the set of type functions, the lattice of regular subtypes is closed under the one-way signalling product, moreover, it is generated by a specific family of causally ordered types. We then study signalling relations for maps belonging to a regular subtype, showing that the no-signalling conditions between an input and an output system are determined by a single evaluation of the corresponding function. For higher order types specifically, we show that all signalling relations can be read off directly from the structure poset via a rank parity condition. Finally, we study relations between the structure poset of a type and its normal forms, that is, expressions of the type in terms of causally ordered types. We illustrate construction of normal forms on some examples, demonstrating the possibility that the normal form can be systematically derived from maximal chains of the poset and signalling relations between them.

quant-pharXiv:2604.09192•Apr 13, 2026•0 citations
Abstract In this paper, we propose a type of generalization of triangular norms and quantum logic functions on d-poset algebra. We compare the modified constructions, and properties to the classical properties of the generalized concepts. We show several structures with proof of each type of the proposed generalization. We show several relationships that connect the triangular norms to the quantum logic maps, and also show their relationships to the classical probability space. We provide some explanatory examples that show each structure on d-poset with extra properties that depends on a definition of state.
This thesis is a review of the quantum logic approach to quantum probability theory which was first studied by Birkhoff and von Neumann in 1936. Our study is based on the more general quantum structure which is known as the sigma\\sigmasigma-orthocomplete orthomodular poset or quantum logic. We introduce the definitions of states and observables and show that the quantum probability theory is a generalization of the classical probability theory due to Kolmogorov. Discussions about joint distributions of observables are given, and we also give the general expression of the uncertainty relation in the logico-algebraic sense which generalizes the well-known Heisenberg uncertainty relation. Two examples, the classical probability structure of Kolmogorov and the Hilbert space quantum logic, are given as illustrations throughout the whole discussion.
Let S be a set of states of a physical system and p(s) the probability of the occurrence of an event when the system is in state s in S. Such a function p from S to [0,1] is known as a numerical event or more accurately an S-probability. A set P of numerical events including the constant functions 0 and 1 and 1-p with every p in P becomes a poset when ordered by the order of real functions and can serve as a general setting for quantum logics. We call such a poset P a general set of events (GSE). The thoroughly investigated algebras of S-probabilities (including Hilbert logics), concrete logics and Boolean algebras can all be represented within this setting. In this paper we study various classes of GSEs, in particular those that are orthoposets and their interrelations and connections to known logics. Moreover, we characterize GSEs as posets by means of states and discuss the situation for GSEs to be lattices.
‎This contribution ‎‎deals with the mathematical modeling of R-norm entropy and R-norm divergence in quantum logics. ‎‎W‎e extend some results concerning the R-norm entropy and conditional R-norm entropy given in (Inf. Control 45, 1980), ‎‎‎‎‎to ‎the‎ quantum logics.‎ Firstly, the concepts of ‎‎R-norm entropy ‎and‎ ‎conditional R-norm entropy in quantum logics are introduced. ‎We ‎prove‎ ‎the concavity property for the notion of R-norm entropy in quantum logics ‎and we ‎show‎‎ that this entropy measure does not have the property of sub-additivity in a true sense. ‎It ‎is ‎prove‎n that ‎‎‎the monotonicity ‎property ‎for ‎the suggested type of ‎conditional ‎version ‎of ‎R-norm ‎entropy, holds. Furthermore, we introduce the concept of R-norm divergence of states in quantum logics and we derive basic properties of this quantity. ‎In particular‎, a relationship between the R-norm divergence and the R-norm entropy of partitions is provided.‎‎‎
The present paper is devoted to modelling of a probability measure of logical connectives on a quantum logic via a G-map, which is a special map on it.We follow the work in which the probability of logical conjunction (AND), disjunction (OR), symmetric difference (XOR) and their negations for non-compatible propositions are studied.Now we study all remaining cases of G-maps on quantum logic, namely a probability measure of projections, of implications, and of their negations.We show that unlike classical (Boolean) logic, probability measures of projections on a quantum logic are not necessarilly pure projections.We indicate how it is possible to define a probability measure of implication using a G-map in the quantum logic, and then we study some properties of this measure which are different from a measure of implication in a Boolean algebra.Finally, we compare the properties of a G-map with the properties of a probability measure related to logical connectives on a Boolean algebra.
The paper is the contribution to quantum toposophy focusing on the abstract orthomodular structures (following Dunn-Moss-Wang terminology). Early quantum toposophical approach to "abstract quantum logic" was proposed based on the topos of functors [E,Sets]\mathsf{[E,Sets]}[E,Sets] where E\mathsf{E}E is a so-called orthomodular preorder category – a modification of categorically rewritten orthomodular lattice (taking into account that like any lattice it will be a finite co-complete preorder category). In the paper another kind of categorical semantics of quantum logic is discussed which is based on the modification of the topos construction itself – so called quantosquantosquantos – which would be evaluated as a non-classical modification of topos with some extra structure allowing to take into consideration the peculiarity of negation in orthomodular quantum logic. The algebra of subobjects of quantos is not the Heyting algebra but an orthomodular lattice. Quantoses might be apprehended as an abstract reflection of Landsman's proposal of "Bohrification", i.e., the mathematical interpretation of Bohr's classical concepts by commutative C∗C^*C∗-algebras, which in turn are studied in their quantum habitat of noncommutative C∗C^*C∗-algebras – more fundamental structures than commutative C∗C^*C∗-algebras. The Bohrification suggests that topos-theoretic approach also should be modified. Since topos by its nature is an intuitionistic construction then Bohrification in abstract case should be transformed in an application of categorical structure based on an orthomodular lattice which is more general construction than Heyting algebra – orthomodular lattices are non-distributive while Heyting algebras are distributive ones. Toposes thus should be studied in their quantum habitat of "orthomodular" categories i.e. of quntoses. Also an interpretation of some well-known systems of orthomodular quantum logic in quantos of functors [E,QSets]\mathsf{[E,QSets]}[E,QSets] is constructed where QSets\mathsf{QSets}QSets is a quantos (not a topos) of quantum sets. The completeness of those systems in respect to the semantics proposed is proved.
We study the signalling structure of higher order quantum maps from an order-theoretic perspective, building on the combinatorial characterization of higher order types by Bisio and Perinotti. We have shown in a previous work arxiv:2411.09256 that types are represented by boolean functions called type functions, and that each such function is characterized by a related structure poset. We characterize the distributive lattice generated by all type functions with fixed indices of input and output systems - whose elements we call regular subtypes - by a monotonicity condition. Unlike the set of type functions, the lattice of regular subtypes is closed under the one-way signalling product, moreover, it is generated by a specific family of causally ordered types. We then study signalling relations for maps belonging to a regular subtype, showing that the no-signalling conditions between an input and an output system are determined by a single evaluation of the corresponding function. For higher order types specifically, we show that all signalling relations can be read off directly from the structure poset via a rank parity condition. Finally, we study relations between the structure poset of a type and its normal forms, that is, expressions of the type in terms of causally ordered types. We illustrate construction of normal forms on some examples, demonstrating the possibility that the normal form can be systematically derived from maximal chains of the poset and signalling relations between them.