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.
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.
In recent work, several researchers including the authors have developed a categorical formalization of quantum mechanics in terms of symmetric monoidal dagger categories. In this framework, classical data turned out to be represented by an algebraic structure, that of special commutative dagger Frobenius algebras. This structure captures the distinct capabilities that apply to classical data – that they can be copied and deleted. In the present paper, we provide categorical semantics and diagrammatic representations of deterministic, nondeterministic, and probabilistic operations over classical data represented in this way. Moreover, a combination of some fundamental categorical constructions (the Kleisli construction of the category of free algebras and the Grothendieck construction of the total category of an indexed category) with the specific categorical presentations of pure and mixed quantum states provides a resource-sensitive categorical account of classical control of quantum data and of classical data resulting from quantum measurements, as well as of the classical data processing that may happen in between measurements and controls. Along the way we also discover some apparently novel quantum typing structures. One of the salient features of categorical quantum mechanics is still its graphic calculus, which allows succinct presentations of diverse quantum protocols. The elements of an abstract stochastic calculus are beginning to emerge from it, pointing toward convenient refinements of resource-sensitive logics that are hoped to capture the probabilistic content and limited observability of quantum data.
Abstract Monoidal category theory serves as a powerful framework for describing logical aspects of quantum theory, giving an abstract language for parallel and sequential composition and a conceptual way to understand many high-level quantum phenomena. Here, we lay the foundations for this categorical quantum mechanics, with an emphasis on the graphical calculus that makes computation intuitive. We describe superposition and entanglement using biproducts and dual objects, and show how quantum teleportation can be studied abstractly using these structures. We investigate monoids, Frobenius structures and Hopf algebras, showing how they can be used to model classical information and complementary observables. We describe the CP construction, a categorical tool to describe probabilistic quantum systems. The last chapter introduces higher categories, surface diagrams and 2-Hilbert spaces, and shows how the language of duality in monoidal 2-categories can be used to reason about quantum protocols, including quantum teleportation and dense coding. Previous knowledge of linear algebra, quantum information or category theory would give an ideal background for studying this text, but it is not assumed, with essential background material given in a self-contained introductory chapter. Throughout the text, we point out links with many other areas, such as representation theory, topology, quantum algebra, knot theory and probability theory, and present nonstandard models including sets and relations. All results are stated rigorously and full proofs are given as far as possible, making this book an invaluable reference for modern techniques in quantum logic, with much of the material not available in any other textbook.
Classical mathematical taxonomy has long relied on binary, crisp set membership where an object either belongs to a specific category or it does not. In contemporary mathematics, however, the proliferation of highly complex, multi-faceted, and abstract objects renders traditional binary classification inadequate. This paper introduces the Quantum Classification of Mathematical Objects (QCMO) framework, a novel paradigm that shifts from crisp set inclusion to a probabilistic classification model. By defining mathematical objects as states within a generalized vector space and employing conditional probabilities of the form P(C_i | X), QCMO captures the inherent ambiguity, multi-categorization, and structural superposition of advanced mathematical entities. We formulate the theoretical foundations, the mathematical mapping mechanisms, and the structural properties of QCMO, providing a robust tool for organizing and resolving high-complexity classification problems across diverse mathematical disciplines.
The past decade has seen a remarkable resurgence of the old programme of finding more or less a priori axioms for the mathematical framework of quantum mechanics. The new impetus comes largely from quantum information theory; in contrast to work in the older tradition, which tended to concentrate on structural features of individual quantum systems, the newer work is marked by an emphasis on systems in interaction. Within this newer work, one can discern two distinct approaches: one is “top-down”, and attempts to capture in category-theoretic terms what is distinctive about quantum information processing. The other is “bottom up”, attempting to construct non-classical models and theories by hand, as it were, and then characterizing those features that mark out quantum-like behavior. This paper blends these approaches. We present a constructive, bottom-up recipe for building probabilistic theories having strong symmetry properties, using as data any uniform enlargement of the symmetric group S(E) of any set, to a larger group G(E). Subject to some natural conditions, our construction leads to a monoidal category of fully symmetric test spaces, in which the monoidal product is “non-signaling”.
The study of the foundations of Quantum Mechanics, especially after the advent of Quantum Computation and Information, has benefited from the application of category-theoretic tools and modal logics to the analysis of Quantum processes: we witness a wealth of theoretical frameworks casted in either of the two languages. This paper explores the interplay of the two formalisms in the peculiar context of Quantum Theory. After a review of some influential abstract frameworks, we show how different modal logic frames can be extracted from the category of finite dimensional Hilbert spaces, connecting the Categorical Quantum Mechanics approach to some modal logics that have been proposed for Quantum Computing. We then apply a general version of the same technique to two other categorical frameworks, the ‘topos approach’ of Doering and Isham and the sheaf-theoretic work on contextuality by Abramsky and Brandenburger, suggesting how some key features can be expressed with modal languages.
Categorical quantum mechanics exploits the dagger compact closed structure of finite dimensional Hilbert spaces, and uses the graphical calculus of string diagrams to facilitate reasoning about finite dimensional processes. A significant portion of quantum physics, however, involves reasoning about infinite dimensional processes, and it is well-known that the category of all Hilbert spaces is not compact closed. Thus, a limitation of using dagger compact closed categories is that one cannot directly accommodate reasoning about infinite dimensional processes. A natural categorical generalization of compact closed categories, in which infinite dimensional spaces can be modelled, is *-autonomous categories and, more generally, linearly distributive categories. This article starts the development of this direction of generalizing categorical quantum mechanics. An important first step is to establish the behaviour of the dagger in these more general settings. Thus, these notes simultaneously develop the categorical semantics of multiplicative dagger linear logic. The notes end with the definition of a mixed unitary category. It is this structure which is subsequently used to extend the key features of categorical quantum mechanics.