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:1809.10530 · Advances in intelligent systems and computing

Probability Measures and Projections on Quantum Logics

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

Published Apr 17, 2019• 3 citations
arXivHTMLPDF
DOI
10.1007/978-3-030-18058-4_25

Related papers

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

Representations of Quantum Logics and Transition Probability Spaces

Sylvia Pulmannová

Springer eBooks•Jan 1, 1989•4 citations

Quantum Logic and Quantum Probability

Enrico G. Beltrametti

Springer eBooks•Jan 1, 2004•4 citations

A Hierarchy of Compatibility and Comeasurability Levels in Quantum Logics with Unique Conditional Probabilities

Gerd Niestegge

In the quantum mechanical Hilbert space formalism, the probabilistic interpretation is a later ad-hoc add-on, more or less enforced by the experimental evidence, but not motivated by the mathematical model itself. A model involving a clear probabilistic interpretation from the very beginning is provided by the quantum logics with unique conditional probabilities. It includes the projection lattices in von Neumann algebras and here probability conditionalization becomes identical with the state transition of the Lüders-von Neumann measurement process. This motivates the definition of a hierarchy of five compatibility and comeasurability levels in the abstract setting of the quantum logics with unique conditional probabilities. Their meanings are: the absence of quantum interference or influence, the existence of a joint distribution, simultaneous measurability, and the independence of the final state after two successive measurements from the sequential order of these two measurements. A further level means that two elements of the quantum logic (events) belong to the same Boolean subalgebra. In the general case, the five compatibility and comeasurability levels appear to differ, but they all coincide in the common Hilbert space formalism of quantum mechanics, in von Neumann algebras, and in some other cases.

arXiv:1001.1542•Communications in Theoretical Physics•Dec 1, 2010•6 citations

Nondeterministic testing of Sequential Quantum Logic propositions on a quantum computer

Matthew Leifer

In the past few years it has been shown that universal quantum computation can be obtained by projective measurements alone, with no need for unitary gates. This suggests that the underlying logic of quantum computing may be an algebra of sequences of quantum measurements rather than an algebra of products of unitary operators. Such a Sequential Quantum Logic (SQL) was developed in the late 70's and has more recently been applied to the consistent histories framework of quantum mechanics as a possible route to the theory of quantum gravity. In this letter, I give a method for deciding the truth of a proposition in SQL with nonzero probability of success on a quantum computer.

arXiv:quant-ph/0509193•Sep 28, 2005•0 citations

Quantum logic and generalized probability theory

Urs Kägi‐Romano

Journal of Philosophical Logic•Jan 1, 1977•16 citations
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.
In the quantum mechanical Hilbert space formalism, the probabilistic interpretation is a later ad-hoc add-on, more or less enforced by the experimental evidence, but not motivated by the mathematical model itself. A model involving a clear probabilistic interpretation from the very beginning is provided by the quantum logics with unique conditional probabilities. It includes the projection lattices in von Neumann algebras and here probability conditionalization becomes identical with the state transition of the Lüders-von Neumann measurement process. This motivates the definition of a hierarchy of five compatibility and comeasurability levels in the abstract setting of the quantum logics with unique conditional probabilities. Their meanings are: the absence of quantum interference or influence, the existence of a joint distribution, simultaneous measurability, and the independence of the final state after two successive measurements from the sequential order of these two measurements. A further level means that two elements of the quantum logic (events) belong to the same Boolean subalgebra. In the general case, the five compatibility and comeasurability levels appear to differ, but they all coincide in the common Hilbert space formalism of quantum mechanics, in von Neumann algebras, and in some other cases.
In the past few years it has been shown that universal quantum computation can be obtained by projective measurements alone, with no need for unitary gates. This suggests that the underlying logic of quantum computing may be an algebra of sequences of quantum measurements rather than an algebra of products of unitary operators. Such a Sequential Quantum Logic (SQL) was developed in the late 70's and has more recently been applied to the consistent histories framework of quantum mechanics as a possible route to the theory of quantum gravity. In this letter, I give a method for deciding the truth of a proposition in SQL with nonzero probability of success on a quantum computer.