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:1306.0831 · Electronic Proceedings in Theoretical Computer Science

Towards a Categorical Account of Conditional Probability

Robert Furber, Bart Jacobs

Published Nov 4, 2015• 10 citations
arXivHTMLPDF

Abstract

This paper presents a categorical account of conditional probability, covering both the classical and the quantum case. Classical conditional probabilities are expressed as a certain "triangle-fill-in" condition, connecting marginal and joint probabilities, in the Kleisli category of the distribution monad. The conditional probabilities are induced by a map together with a predicate (the condition). The latter is a predicate in the logic of effect modules on this Kleisli category. This same approach can be transferred to the category of C*-algebras (with positive unital maps), whose predicate logic is also expressed in terms of effect modules. Conditional probabilities can again be expressed via a triangle-fill-in property. In the literature, there are several proposals for what quantum conditional probability should be, and also there are extra difficulties not present in the classical case. At this stage, we only describe quantum systems with classical parametrization.

DOI
10.4204/eptcs.195.14

Related papers

Effectus of Quantum Probability on Relational Structures

Octavio Zapata

The notion of effectus from categorical logic is relevant in the emerging field of categorical probability theory. In some cases, stochastic maps are represented by maps in the Kleisli category of some probability monad. Quantum homomorphisms from combinatorics and quantum information theory are the Kleisli maps of certain sort of quantum monad. We show that the Kleisli category of this quantum monad is an effectus. This gives rise to notions of quantum probabilistic reasoning as predicates, validity, conditioning, and channels.

arXiv:2005.00209•Electronic Proceedings in Theoretical Computer Science•Apr 30, 2020•0 citations

New Directions in Categorical Logic, for Classical, Probabilistic and Quantum Logic

Bart Jacobs

Intuitionistic logic, in which the double negation law not-not-P = P fails, is dominant in categorical logic, notably in topos theory. This paper follows a different direction in which double negation does hold. The algebraic notions of effect algebra/module that emerged in theoretical physics form the cornerstone. It is shown that under mild conditions on a category, its maps of the form X -> 1+1 carry such effect module structure, and can be used as predicates. Predicates are identified in many different situations, and capture for instance ordinary subsets, fuzzy predicates in a probabilistic setting, idempotents in a ring, and effects (positive elements below the unit) in a C*-algebra or Hilbert space. In quantum foundations the duality between states and effects plays an important role. It appears here in the form of an adjunction, where we use maps 1 -> X as states. For such a state s and a predicate p, the validity probability s |= p is defined, as an abstract Born rule. It captures many forms of (Boolean or probabilistic) validity known from the literature. Measurement from quantum mechanics is formalised categorically in terms of `instruments', using L\"uders rule in the quantum case. These instruments are special maps associated with predicates (more generally, with tests), which perform the act of measurement and may have a side-effect that disturbs the system under observation. This abstract description of side-effects is one of the main achievements of the current approach. It is shown that in the special case of C*-algebras, side-effect appear exclusively in the non-commutative case. Also, these instruments are used for test operators in a dynamic logic that can be used for reasoning about quantum programs/protocols. The paper describes four successive assumptions, towards a categorical axiomatisation of quantitative logic for probabilistic and quantum systems.

arXiv:1205.3940•Logical Methods in Computer Science•Oct 1, 2015•60 citations

Conditional Distributions for Quantum Systems

Arthur J. Parzygnat

Conditional distributions, as defined by the Markov category framework, are studied in the setting of matrix algebras (quantum systems). Their construction as linear unital maps are obtained via a categorical Bayesian inversion procedure. Simple criteria establishing when such linear maps are positive are obtained. Several examples are provided, including the standard EPR scenario, where the EPR correlations are reproduced in a purely compositional (categorical) manner. A comparison between the Bayes map, the Petz recovery map, and the Leifer-Spekkens acausal belief propagation is provided, illustrating some similarities and key differences.

arXiv:2102.01529•Electronic Proceedings in Theoretical Computer Science•Sep 9, 2021•10 citations

The Unification of Probabilistic Logics: A Categorical Foundation for Classical and Quantum Uncertainty

Revista, Zen, MATH, 10

This paper proposes a comprehensive categorical framework for unifying classical and quantum probabilistic logics. We leverage the inherent compositional and structural advantages of category theory to construct a common mathematical language capable of expressing both Kolmogorovian probability and the non-Boolean structures characteristic of quantum mechanics. By treating systems and processes as objects and morphisms within suitable monoidal categories, we demonstrate how core concepts like states, observables, measurements, and conditioning can be abstractly represented and seamlessly transitioned between classical and quantum domains. The framework utilizes probability monads for classical uncertainty and dagger compact closed categories for quantum processes, showing how these distinct structures can be seen as instances of a more general categorical paradigm. This unification not only provides a deeper foundational understanding of uncertainty across different physical theories but also opens new avenues for developing hybrid probabilistic-logical systems in fields such as artificial intelligence and quantum computation.

•Dec 5, 2025•0 citations

Logical aspects of probability and quantum computation

Zapata Fonseca, Octavio Baltasar

Most of the work presented in this document can be read as a sequel to previous work of the author and collaborators, which has been published and appears in [DSZ16, DSZ17, ABdSZ17]. In [ABdSZ17], the mathematical description of quantum homomorphisms of graphs and more generally of relational structures, using the language of category theory is given. In particular, we introduced the concept of ‘quantum’ monad. In this thesis we show that the quantum monad fits nicely into the categorical framework of effectus theory, developed by Jacobs et al. [Jac15, CJWW15]. Effectus theory is an emergent field in categorical logic aiming to describe logic and probability, from the point of view of classical and quantum computation. The main contribution in the first part of this document prove that the Kleisli category of the quantum monad on relational structures is an effectus. The second part is rather different. There, distinct facets of the equivalence relation on graphs called cospectrality are described: algebraic, combinatorial and logical relations are presented as sufficient conditions on graphs for having the same spectrum (i.e. being ‘cospectral’). Other equivalence of graphs (called fractional isomorphism) is also related using some ‘game’ comonads from Abramsky et al. [ADW17, Sha17, AS18]. We also describe a sufficient condition for a pair of graphs to be cospectral using the quantum monad: two Kleisli morphisms (going in opposite directions) between them satisfying certain compatibility requirement.

•Jan 1, 2019•1 citation

A categorical approach to quantum Bayes' rule

Hitoshi Motoyama, Kohei Tanaka

We introduce a concept of conditional measures in quantum measure spaces from a view point of Gelfand duality between classical measure spaces and quantum measure spaces. Classical conditional measure spaces are based on subspaces of a space, hence we define quantum conditional measure spaces based on the dual notion, ideals and quotients of an algebra. Although the classical Bayes rule indicates the ratio of conditional measure (probability) and original one, the quantum Bayes rule describes the difference between them in quantum measure spaces. We also give categorical structures on classical and quantum measure spaces based on Bayes' rule, respectively. These extend the Riesz-Markov-Kakutani representation theorem to an equivalence of categories between the category of classical measure spaces and the category of commutative $C^{\ast}$-measure spaces.

•Dec 18, 2014•1 citation
This paper presents a categorical account of conditional probability, covering both the classical and the quantum case. Classical conditional probabilities are expressed as a certain "triangle-fill-in" condition, connecting marginal and joint probabilities, in the Kleisli category of the distribution monad. The conditional probabilities are induced by a map together with a predicate (the condition). The latter is a predicate in the logic of effect modules on this Kleisli category. This same approach can be transferred to the category of C*-algebras (with positive unital maps), whose predicate logic is also expressed in terms of effect modules. Conditional probabilities can again be expressed via a triangle-fill-in property. In the literature, there are several proposals for what quantum conditional probability should be, and also there are extra difficulties not present in the classical case. At this stage, we only describe quantum systems with classical parametrization.
The notion of effectus from categorical logic is relevant in the emerging field of categorical probability theory. In some cases, stochastic maps are represented by maps in the Kleisli category of some probability monad. Quantum homomorphisms from combinatorics and quantum information theory are the Kleisli maps of certain sort of quantum monad. We show that the Kleisli category of this quantum monad is an effectus. This gives rise to notions of quantum probabilistic reasoning as predicates, validity, conditioning, and channels.
Intuitionistic logic, in which the double negation law not-not-P = P fails, is dominant in categorical logic, notably in topos theory. This paper follows a different direction in which double negation does hold. The algebraic notions of effect algebra/module that emerged in theoretical physics form the cornerstone. It is shown that under mild conditions on a category, its maps of the form X -> 1+1 carry such effect module structure, and can be used as predicates. Predicates are identified in many different situations, and capture for instance ordinary subsets, fuzzy predicates in a probabilistic setting, idempotents in a ring, and effects (positive elements below the unit) in a C*-algebra or Hilbert space. In quantum foundations the duality between states and effects plays an important role. It appears here in the form of an adjunction, where we use maps 1 -> X as states. For such a state s and a predicate p, the validity probability s |= p is defined, as an abstract Born rule. It captures many forms of (Boolean or probabilistic) validity known from the literature. Measurement from quantum mechanics is formalised categorically in terms of `instruments', using L\"uders rule in the quantum case. These instruments are special maps associated with predicates (more generally, with tests), which perform the act of measurement and may have a side-effect that disturbs the system under observation. This abstract description of side-effects is one of the main achievements of the current approach. It is shown that in the special case of C*-algebras, side-effect appear exclusively in the non-commutative case. Also, these instruments are used for test operators in a dynamic logic that can be used for reasoning about quantum programs/protocols. The paper describes four successive assumptions, towards a categorical axiomatisation of quantitative logic for probabilistic and quantum systems.
Conditional distributions, as defined by the Markov category framework, are studied in the setting of matrix algebras (quantum systems). Their construction as linear unital maps are obtained via a categorical Bayesian inversion procedure. Simple criteria establishing when such linear maps are positive are obtained. Several examples are provided, including the standard EPR scenario, where the EPR correlations are reproduced in a purely compositional (categorical) manner. A comparison between the Bayes map, the Petz recovery map, and the Leifer-Spekkens acausal belief propagation is provided, illustrating some similarities and key differences.
This paper proposes a comprehensive categorical framework for unifying classical and quantum probabilistic logics. We leverage the inherent compositional and structural advantages of category theory to construct a common mathematical language capable of expressing both Kolmogorovian probability and the non-Boolean structures characteristic of quantum mechanics. By treating systems and processes as objects and morphisms within suitable monoidal categories, we demonstrate how core concepts like states, observables, measurements, and conditioning can be abstractly represented and seamlessly transitioned between classical and quantum domains. The framework utilizes probability monads for classical uncertainty and dagger compact closed categories for quantum processes, showing how these distinct structures can be seen as instances of a more general categorical paradigm. This unification not only provides a deeper foundational understanding of uncertainty across different physical theories but also opens new avenues for developing hybrid probabilistic-logical systems in fields such as artificial intelligence and quantum computation.
Most of the work presented in this document can be read as a sequel to previous work of the author and collaborators, which has been published and appears in [DSZ16, DSZ17, ABdSZ17]. In [ABdSZ17], the mathematical description of quantum homomorphisms of graphs and more generally of relational structures, using the language of category theory is given. In particular, we introduced the concept of ‘quantum’ monad. In this thesis we show that the quantum monad fits nicely into the categorical framework of effectus theory, developed by Jacobs et al. [Jac15, CJWW15]. Effectus theory is an emergent field in categorical logic aiming to describe logic and probability, from the point of view of classical and quantum computation. The main contribution in the first part of this document prove that the Kleisli category of the quantum monad on relational structures is an effectus. The second part is rather different. There, distinct facets of the equivalence relation on graphs called cospectrality are described: algebraic, combinatorial and logical relations are presented as sufficient conditions on graphs for having the same spectrum (i.e. being ‘cospectral’). Other equivalence of graphs (called fractional isomorphism) is also related using some ‘game’ comonads from Abramsky et al. [ADW17, Sha17, AS18]. We also describe a sufficient condition for a pair of graphs to be cospectral using the quantum monad: two Kleisli morphisms (going in opposite directions) between them satisfying certain compatibility requirement.
We introduce a concept of conditional measures in quantum measure spaces from a view point of Gelfand duality between classical measure spaces and quantum measure spaces. Classical conditional measure spaces are based on subspaces of a space, hence we define quantum conditional measure spaces based on the dual notion, ideals and quotients of an algebra. Although the classical Bayes rule indicates the ratio of conditional measure (probability) and original one, the quantum Bayes rule describes the difference between them in quantum measure spaces. We also give categorical structures on classical and quantum measure spaces based on Bayes' rule, respectively. These extend the Riesz-Markov-Kakutani representation theorem to an equivalence of categories between the category of classical measure spaces and the category of commutative C∗C^{\ast}C∗-measure spaces.