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:1804.00581 · Journal of Mathematical Physics

Quantum sets

Andre Kornell

Published Oct 1, 2020• 20 citations
arXivHTMLPDF

Abstract

A quantum set is defined to be simply a set of nonzero finite-dimensional Hilbert spaces. Together with binary relations, essentially the quantum relations of Weaver, quantum sets form a dagger compact category. Functions between quantum sets are certain binary relations that can be characterized in terms of this dagger compact structure, and the resulting category of quantum sets and functions generalizes the category of ordinary sets and functions in the manner of noncommutative mathematics. In particular, this category is dual to a subcategory of von Neumann algebras. The basic properties of quantum sets are presented thoroughly, with the noncommutative dictionary in mind, and with an eye to convenient application. As a motivating example, a notion of quantum graph coloring is derived within this framework, and it is shown to be equivalent to the notion that appears in the quantum information theory literature.

DOI
10.1063/1.5054128

Related papers

A compositional approach to quantum functions

Benjamin Musto, David Reutter, Dominic Verdon

We introduce a notion of quantum function and develop a compositional framework for finite quantum set theory based on a 2-category of quantum sets and quantum functions. We use this framework to formulate a 2-categorical theory of quantum graphs, which captures the quantum graphs and quantum graph homomorphisms recently discovered in the study of nonlocal games and zero-error communication and relates them to quantum automorphism groups of graphs considered in the setting of compact quantum groups. We show that the 2-categories of quantum sets and quantum graphs are semisimple. We analyze dualisable and invertible 1-morphisms in these 2-categories and show that they correspond precisely to the existing notions of quantum isomorphism and classical isomorphism between sets and graphs.

arXiv:1711.07945•Journal of Mathematical Physics•Aug 1, 2018•66 citations

Quantum predicate logic with equality

Andre Kornell

The quantum propositional logic of Birkhoff and von Neumann is the logic of Boolean observables on a quantum system. The quantum predicate logic of Weaver extends this quantum propositional logic to a logic of Boolean observables on composite quantum systems. We investigate a variant of this quantum predicate logic in which the physical systems are modeled by hereditarily atomic von Neumann algebras. Such physical systems may be infinite-dimensional, but their superselection sectors are finite-dimensional. From the perspective of noncommutative mathematics, they are a quantum generalization of sets. We define an equality relation on each such quantum set. This definition allows us to axiomatize several classes of discrete quantum structures within quantum predicate logic, including quantum graphs, quantum groups and quantum metric spaces. We likewise characterize the quantum isomorphism of simple graphs. The proof that discrete quantum groups may be so axiomatized is due to Stefaan Vaes.

•Apr 9, 2020•2 citations

Categories of Quantum and Classical Channels (extended abstract)

Bob Coecke, Chris Heunen, Aleks Kissinger

We introduce the CP*-construction on a dagger compact closed category as a generalisation of Selinger's CPM-construction. While the latter takes a dagger compact closed category and forms its category of "abstract matrix algebras" and completely positive maps, the CP*-construction forms its category of "abstract C*-algebras" and completely positive maps. This analogy is justified by the case of finite-dimensional Hilbert spaces, where the CP*-construction yields the category of finite-dimensional C*-algebras and completely positive maps. The CP*-construction fully embeds Selinger's CPM-construction in such a way that the objects in the image of the embedding can be thought of as "purely quantum" state spaces. It also embeds the category of classical stochastic maps, whose image consists of "purely classical" state spaces. By allowing classical and quantum data to coexist, this provides elegant abstract notions of preparation, measurement, and more general quantum channels.

arXiv:1408.0049•Electronic Proceedings in Theoretical Computer Science•Jul 29, 2014•8 citations

Categorical Semantics for Quantum Vector Spaces

PAULO SÉRGIO DE ANDRADE

This paper explores the application of category theory to provide a semantic framework for quantum vector spaces, which are fundamental to quantum mechanics and quantum information. We move beyond the traditional algebraic and analytical descriptions of Hilbert spaces to adopt a more abstract, compositional, and graphical approach rooted in monoidal categories. This categorical perspective allows for a unified understanding of quantum phenomena, including superposition, entanglement, and measurement, by representing quantum systems as objects and processes as morphisms. We delve into the concept of compact closed categories and dagger symmetric monoidal categories as the appropriate mathematical structures to capture the essential features of quantum theory, such as duality, adjoints, and the tensor product for composite systems. Furthermore, the paper discusses how graphical calculi, arising from these categorical structures, offer an intuitive and rigorous method for reasoning about quantum protocols and computations, facilitating the design and verification of quantum algorithms. By providing a high-level, axiomatic framework, categorical semantics clarifies the foundational principles of quantum mechanics and opens new avenues for developing quantum programming languages and understanding the interplay between quantum information and computation.

•Nov 22, 2025•0 citations

Categories of relations as models of quantum theory

Chris Heunen, Sean Tull

Categories of relations over a regular category form a family of models of quantum theory. Using regular logic, many properties of relations over sets lift to these models, including the correspondence between Frobenius structures and internal groupoids. Over compact Hausdorff spaces, this lifting gives continuous symmetric encryption. Over a regular Mal'cev category, this correspondence gives a characterization of categories of completely positive maps, enabling the formulation of quantum features. These models are closer to Hilbert spaces than relations over sets in several respects: Heisenberg uncertainty, impossibility of broadcasting, and behavedness of rank one morphisms.

arXiv:1506.05028•Electronic Proceedings in Theoretical Computer Science•Nov 4, 2015•25 citations

Toy Quantum Categories (Extended Abstract)

Bob Coecke, Bill Edwards

We show that Rob Spekken's toy quantum theory arises as an instance of our categorical approach to quantum axiomatics, as a (proper) subcategory of the dagger compact category FRel of finite sets and relations with the cartesian product as tensor, where observables correspond to dagger Frobenius algebras. This in particular implies that the quantum-like properties of the toy model are in fact very general categorytheoretic properties. We also show the remarkable fact that we can already interpret complementary quantum observables on the two-element set in FRel. Keywords: Quantum category, dagger symmetric monoidal category, finite dimensional Hilbert spaces, FdHilb, FRel

Electronic Notes in Theoretical Computer Science•Feb 1, 2011•23 citations
A quantum set is defined to be simply a set of nonzero finite-dimensional Hilbert spaces. Together with binary relations, essentially the quantum relations of Weaver, quantum sets form a dagger compact category. Functions between quantum sets are certain binary relations that can be characterized in terms of this dagger compact structure, and the resulting category of quantum sets and functions generalizes the category of ordinary sets and functions in the manner of noncommutative mathematics. In particular, this category is dual to a subcategory of von Neumann algebras. The basic properties of quantum sets are presented thoroughly, with the noncommutative dictionary in mind, and with an eye to convenient application. As a motivating example, a notion of quantum graph coloring is derived within this framework, and it is shown to be equivalent to the notion that appears in the quantum information theory literature.
We introduce a notion of quantum function and develop a compositional framework for finite quantum set theory based on a 2-category of quantum sets and quantum functions. We use this framework to formulate a 2-categorical theory of quantum graphs, which captures the quantum graphs and quantum graph homomorphisms recently discovered in the study of nonlocal games and zero-error communication and relates them to quantum automorphism groups of graphs considered in the setting of compact quantum groups. We show that the 2-categories of quantum sets and quantum graphs are semisimple. We analyze dualisable and invertible 1-morphisms in these 2-categories and show that they correspond precisely to the existing notions of quantum isomorphism and classical isomorphism between sets and graphs.
The quantum propositional logic of Birkhoff and von Neumann is the logic of Boolean observables on a quantum system. The quantum predicate logic of Weaver extends this quantum propositional logic to a logic of Boolean observables on composite quantum systems. We investigate a variant of this quantum predicate logic in which the physical systems are modeled by hereditarily atomic von Neumann algebras. Such physical systems may be infinite-dimensional, but their superselection sectors are finite-dimensional. From the perspective of noncommutative mathematics, they are a quantum generalization of sets. We define an equality relation on each such quantum set. This definition allows us to axiomatize several classes of discrete quantum structures within quantum predicate logic, including quantum graphs, quantum groups and quantum metric spaces. We likewise characterize the quantum isomorphism of simple graphs. The proof that discrete quantum groups may be so axiomatized is due to Stefaan Vaes.
We introduce the CP*-construction on a dagger compact closed category as a generalisation of Selinger's CPM-construction. While the latter takes a dagger compact closed category and forms its category of "abstract matrix algebras" and completely positive maps, the CP*-construction forms its category of "abstract C*-algebras" and completely positive maps. This analogy is justified by the case of finite-dimensional Hilbert spaces, where the CP*-construction yields the category of finite-dimensional C*-algebras and completely positive maps. The CP*-construction fully embeds Selinger's CPM-construction in such a way that the objects in the image of the embedding can be thought of as "purely quantum" state spaces. It also embeds the category of classical stochastic maps, whose image consists of "purely classical" state spaces. By allowing classical and quantum data to coexist, this provides elegant abstract notions of preparation, measurement, and more general quantum channels.
This paper explores the application of category theory to provide a semantic framework for quantum vector spaces, which are fundamental to quantum mechanics and quantum information. We move beyond the traditional algebraic and analytical descriptions of Hilbert spaces to adopt a more abstract, compositional, and graphical approach rooted in monoidal categories. This categorical perspective allows for a unified understanding of quantum phenomena, including superposition, entanglement, and measurement, by representing quantum systems as objects and processes as morphisms. We delve into the concept of compact closed categories and dagger symmetric monoidal categories as the appropriate mathematical structures to capture the essential features of quantum theory, such as duality, adjoints, and the tensor product for composite systems. Furthermore, the paper discusses how graphical calculi, arising from these categorical structures, offer an intuitive and rigorous method for reasoning about quantum protocols and computations, facilitating the design and verification of quantum algorithms. By providing a high-level, axiomatic framework, categorical semantics clarifies the foundational principles of quantum mechanics and opens new avenues for developing quantum programming languages and understanding the interplay between quantum information and computation.
Categories of relations over a regular category form a family of models of quantum theory. Using regular logic, many properties of relations over sets lift to these models, including the correspondence between Frobenius structures and internal groupoids. Over compact Hausdorff spaces, this lifting gives continuous symmetric encryption. Over a regular Mal'cev category, this correspondence gives a characterization of categories of completely positive maps, enabling the formulation of quantum features. These models are closer to Hilbert spaces than relations over sets in several respects: Heisenberg uncertainty, impossibility of broadcasting, and behavedness of rank one morphisms.
We show that Rob Spekken's toy quantum theory arises as an instance of our categorical approach to quantum axiomatics, as a (proper) subcategory of the dagger compact category FRel of finite sets and relations with the cartesian product as tensor, where observables correspond to dagger Frobenius algebras. This in particular implies that the quantum-like properties of the toy model are in fact very general categorytheoretic properties. We also show the remarkable fact that we can already interpret complementary quantum observables on the two-element set in FRel. Keywords: Quantum category, dagger symmetric monoidal category, finite dimensional Hilbert spaces, FdHilb, FRel