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 Applied Mathematics and Physics

Conditional Events and Quantum Logic

Philip G. Calabrese

Published Jan 1, 2018• 1 citation
Publisher

Abstract

This paper begins with an overview of quantum mechanics, and then recounts a relatively recent algebraic extension of the Boolean algebra of probabilistic events to “conditional events” (order pairs of events). The main point is to show that a so-called “superposition” of two (or more) quantum events (usually with mutually inconsistent initial conditions) can be represented in this algebra of conditional events and assigned a consistent conditional probability. There is no need to imagine that a quantum particle can simultaneously straddle two inconsistent possibilities.

DOI
10.4236/jamp.2018.66107

Related papers

The Logic of Quantum Measurements in terms of Conditional Events

Philip G. Calabrese

This paper shows that the non-Boolean logic of quantum measurements is more naturally represented by a relatively new 4-operation system of Boolean fractions—conditional events—than by the standard representation using Hilbert Space. After the requirements of quantum mechanics and the properties of conditional event algebra are introduced, the quantum concepts of orthogonality, completeness, simultaneous verifiability, logical operations, and deductions are expressed in terms of conditional events thereby demonstrating the adequacy and efficacy of this formulation. Since conditional event algebra is nearly Boolean and consists merely of ordered pairs of standard events or propositions, quantum events and the so-called “superpositions” of states need not be mysterious, and are here fully explicated. Conditional event algebra nicely explains these non-standard “superpositions” of quantum states as conjunctions or disjunctions of conditional events, Boolean fractions, but does not address the so-called “entanglement phenomena” of quantum mechanics, which remain physically mysterious. Nevertheless, separating the latter phenomena from superposition issues adds clarity to the interpretation of quantum entanglement, the phenomenon of influence propagated at faster than light speeds. With such treacherous possibilities present in all quantum situations, an observer has every reason to be completely explicit about the environmental–instrumental configuration, the conditions present when attempting quantum measurements. Conditional event algebra allows such explication without the physical and algebraic remoteness of Hilbert space.

Logic Journal of IGPL•Aug 20, 2006•1 citation

On Boolean posets of numerical events

Dietmar W. Dorninger, Helmut Länger

Abstract With many physical processes in which quantum mechanical phenomena can occur, it is essential to take into account a decision mechanism based on measurement data. This can be achieved by means of so-called numerical events, which are specified as follows: 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$$ s ∈ S . A function $$p:S\rightarrow [0,1]$$ p : S → [ 0 , 1 ] is called a numerical event or alternatively, an S-probability. If a set P of S-probabilities is ordered by the order of real functions, it becomes a poset which can be considered as a quantum logic. In case the logic P is a Boolean algebra, this will indicate that the underlying physical system is a classical one. The goal of this paper is to study sets of S-probabilities which are not far from being Boolean algebras by means of the addition and comparison of functions that occur in these sets. In particular, certain classes of so-called Boolean posets of S-probabilities are characterized and related to each other and descriptions based on sets of states are derived.

arXiv:2002.01058•Advances in Computational Intelligence•Jun 7, 2021•3 citations

Probability in quantum mechanics

J. V. Corbett

Quantum mechanics is usually described in the terminology of probability theory even though the properties of the probability spaces associated with it are fundamentally different from the standard ones of probability theory. For example, Kolmogorov's axioms are not general enough to encompass the non-commutative situations that arise in quantum theory. There have been many attempts to generalise these axioms to meet the needs of quantum mechanics. The focus of these attempts has been the observation, first made by Birkhoff and von Neumann (1936), that the propositions associated with a quantum-mechanical system do not form a Boolean σ-algebra. There is almost universal agreement that the probability space associated with a quantum-mechanical system is given by the set of subspaces of a separable Hilbert space, but there is disagreement over the algebraic structure that this set represents. In the most popular model for the probability space of quantum mechanics the propositions are assumed to form an orthocomplemented lattice (Mackey (1963), Jauch (1968)). The fundamental concept here is that of a partial order, that is a binary relation that is reflexive and transitive but not symmetric. The partial order is interpreted as embodying the logical concept of implication in the set of propositions associated with the physical system. Although this model provides an acceptable mathematical expression of the probabilistic structure of quantum mechanics in that the subspaces of a separable Hilbert space give a representation of an ortho-complemented lattice, it has several deficiencies which will be discussed later.

Advances in Applied Probability•Dec 1, 1978•1 citation

What is the Logical Form of Probability Assignment in Quantum Mechanics?

John Halpin

The nature of quantum mechanical probability has often seemed mysterious. To shed some light on this topic, the present paper analyzes the logical form of probability assignment in quantum mechanics. To begin the paper, I set out and criticize several attempts to analyze the form. I go on to propose a new form which utilizes a novel, probabilistic conditional and argue that this proposal is, overall, the best rendering of the quantum mechanical probability assignments. Finally, quantum mechanics aside, the discussion here has consequences for counterfactual logic, conditional probability, and epistemic probability.

Philosophy of Science•Mar 1, 1991•37 citations

Imprecise Probabilities in Quantum Mechanics

Stephan Hartmann

In his entry on "Quantum Logic and Probability Theory" in the Stanford Encyclopedia of Philosophy, Alexander Wilce (2012) writes that "it is uncontroversial (though remarkable) the formal apparatus quantum mechanics reduces neatly to a generalization of classical probability in which the role played by a Boolean algebra of events in the latter is taken over the 'quantum logic' of projection operators on a Hilbert space." For a long time, Patrick Suppes has opposed this view (see, for example, the paper collected in Suppes and Zanotti (1996). Instead of changing the logic and moving from a Boolean algebra to a non-Boolean algebra, one can also 'save the phenomena' by weakening the axioms of probability theory and work instead with upper and lower probabilities. However, it is fair to say that despite Suppes' efforts upper and lower probabilities are not particularly popular in physics as well as in the foundations of physics, at least so far. Instead, quantum logic is booming again, especially since quantum information and computation became hot topics. Interestingly, however, imprecise probabilities are becoming more and more popular in formal epistemology as recent work by authors such as James Joye (2010) and Roger White (2010) demonstrates.

•Jan 1, 2015•4 citations

Using ordered pairs to transcend the lilitations of knowledge representation with application to quantum logic.

Phil Catabrese

The algebraic construct of 'forming ordered pairs of the members of a set' has been used and reused with amazing success. Among these developments are Integer Fractions to better measure distances with pairs of whole numbers; Dedekind Cuts - an early way to define real numbers with ordered pairs of subsets of fractions; Vectors; Quatemians; and others like complex numbers - ordered pairs of real numbers. In the realm of Boolean Logic, ordered pairs of Boolean propositions (alternately ordered pairs of subsets of some universe set) transcend the limitations of pure Boolean Iogic to represent partially true conditional statements such as those used by conditiona1 probability. Pure Boolean logic is unable to adequately represent uncertain conditional logic, but ordered pairs of BooIean propositions can and do represent this knowledge in the logic of Boolean Fractions, also called Conditional Events. A given B can not be represented by A or not B unless P(AJB) and P(B) are both 1. Otherwise, P(A1B) < P(A or not B). But A given B can be represented by an ordered pair of propositions (AJB). These Boolean Fractions apply to the natural language and logic of A given B, they apply to classical conditional probability calculations, to expert system if-then rules, and now to the logic of quantum measurements, a logic that Boolean algebra could not represent, but which Boolean Fractions can represent without Hilbert space.

IEEE International Conference on Information Reuse and Integration (IRI)•Jan 1, 2004•0 citations
This paper begins with an overview of quantum mechanics, and then recounts a relatively recent algebraic extension of the Boolean algebra of probabilistic events to “conditional events” (order pairs of events). The main point is to show that a so-called “superposition” of two (or more) quantum events (usually with mutually inconsistent initial conditions) can be represented in this algebra of conditional events and assigned a consistent conditional probability. There is no need to imagine that a quantum particle can simultaneously straddle two inconsistent possibilities.
This paper shows that the non-Boolean logic of quantum measurements is more naturally represented by a relatively new 4-operation system of Boolean fractions—conditional events—than by the standard representation using Hilbert Space. After the requirements of quantum mechanics and the properties of conditional event algebra are introduced, the quantum concepts of orthogonality, completeness, simultaneous verifiability, logical operations, and deductions are expressed in terms of conditional events thereby demonstrating the adequacy and efficacy of this formulation. Since conditional event algebra is nearly Boolean and consists merely of ordered pairs of standard events or propositions, quantum events and the so-called “superpositions” of states need not be mysterious, and are here fully explicated. Conditional event algebra nicely explains these non-standard “superpositions” of quantum states as conjunctions or disjunctions of conditional events, Boolean fractions, but does not address the so-called “entanglement phenomena” of quantum mechanics, which remain physically mysterious. Nevertheless, separating the latter phenomena from superposition issues adds clarity to the interpretation of quantum entanglement, the phenomenon of influence propagated at faster than light speeds. With such treacherous possibilities present in all quantum situations, an observer has every reason to be completely explicit about the environmental–instrumental configuration, the conditions present when attempting quantum measurements. Conditional event algebra allows such explication without the physical and algebraic remoteness of Hilbert space.
Abstract With many physical processes in which quantum mechanical phenomena can occur, it is essential to take into account a decision mechanism based on measurement data. This can be achieved by means of so-called numerical events, which are specified as follows: 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∈Ss\in Ss∈S s ∈ S . A function p:S→[0,1]p:S\rightarrow [0,1]p:S→[0,1] p : S → [ 0 , 1 ] is called a numerical event or alternatively, an S-probability. If a set P of S-probabilities is ordered by the order of real functions, it becomes a poset which can be considered as a quantum logic. In case the logic P is a Boolean algebra, this will indicate that the underlying physical system is a classical one. The goal of this paper is to study sets of S-probabilities which are not far from being Boolean algebras by means of the addition and comparison of functions that occur in these sets. In particular, certain classes of so-called Boolean posets of S-probabilities are characterized and related to each other and descriptions based on sets of states are derived.
Quantum mechanics is usually described in the terminology of probability theory even though the properties of the probability spaces associated with it are fundamentally different from the standard ones of probability theory. For example, Kolmogorov's axioms are not general enough to encompass the non-commutative situations that arise in quantum theory. There have been many attempts to generalise these axioms to meet the needs of quantum mechanics. The focus of these attempts has been the observation, first made by Birkhoff and von Neumann (1936), that the propositions associated with a quantum-mechanical system do not form a Boolean σ-algebra. There is almost universal agreement that the probability space associated with a quantum-mechanical system is given by the set of subspaces of a separable Hilbert space, but there is disagreement over the algebraic structure that this set represents. In the most popular model for the probability space of quantum mechanics the propositions are assumed to form an orthocomplemented lattice (Mackey (1963), Jauch (1968)). The fundamental concept here is that of a partial order, that is a binary relation that is reflexive and transitive but not symmetric. The partial order is interpreted as embodying the logical concept of implication in the set of propositions associated with the physical system. Although this model provides an acceptable mathematical expression of the probabilistic structure of quantum mechanics in that the subspaces of a separable Hilbert space give a representation of an ortho-complemented lattice, it has several deficiencies which will be discussed later.
The nature of quantum mechanical probability has often seemed mysterious. To shed some light on this topic, the present paper analyzes the logical form of probability assignment in quantum mechanics. To begin the paper, I set out and criticize several attempts to analyze the form. I go on to propose a new form which utilizes a novel, probabilistic conditional and argue that this proposal is, overall, the best rendering of the quantum mechanical probability assignments. Finally, quantum mechanics aside, the discussion here has consequences for counterfactual logic, conditional probability, and epistemic probability.
In his entry on "Quantum Logic and Probability Theory" in the Stanford Encyclopedia of Philosophy, Alexander Wilce (2012) writes that "it is uncontroversial (though remarkable) the formal apparatus quantum mechanics reduces neatly to a generalization of classical probability in which the role played by a Boolean algebra of events in the latter is taken over the 'quantum logic' of projection operators on a Hilbert space." For a long time, Patrick Suppes has opposed this view (see, for example, the paper collected in Suppes and Zanotti (1996). Instead of changing the logic and moving from a Boolean algebra to a non-Boolean algebra, one can also 'save the phenomena' by weakening the axioms of probability theory and work instead with upper and lower probabilities. However, it is fair to say that despite Suppes' efforts upper and lower probabilities are not particularly popular in physics as well as in the foundations of physics, at least so far. Instead, quantum logic is booming again, especially since quantum information and computation became hot topics. Interestingly, however, imprecise probabilities are becoming more and more popular in formal epistemology as recent work by authors such as James Joye (2010) and Roger White (2010) demonstrates.
The algebraic construct of 'forming ordered pairs of the members of a set' has been used and reused with amazing success. Among these developments are Integer Fractions to better measure distances with pairs of whole numbers; Dedekind Cuts - an early way to define real numbers with ordered pairs of subsets of fractions; Vectors; Quatemians; and others like complex numbers - ordered pairs of real numbers. In the realm of Boolean Logic, ordered pairs of Boolean propositions (alternately ordered pairs of subsets of some universe set) transcend the limitations of pure Boolean Iogic to represent partially true conditional statements such as those used by conditiona1 probability. Pure Boolean logic is unable to adequately represent uncertain conditional logic, but ordered pairs of BooIean propositions can and do represent this knowledge in the logic of Boolean Fractions, also called Conditional Events. A given B can not be represented by A or not B unless P(AJB) and P(B) are both 1. Otherwise, P(A1B) < P(A or not B). But A given B can be represented by an ordered pair of propositions (AJB). These Boolean Fractions apply to the natural language and logic of A given B, they apply to classical conditional probability calculations, to expert system if-then rules, and now to the logic of quantum measurements, a logic that Boolean algebra could not represent, but which Boolean Fractions can represent without Hilbert space.