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.
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.
In the flavour of categorical quantum mechanics, we extend nonlocal games to allow quantum questions and answers, using quantum sets (special symmetric dagger Frobenius algebras) and the quantum functions of Musto, Reutter, and Verdon. Equations are presented using a diagrammatic calculus for tensor categories. To this quantum question and answer setting, we extend the standard definitions, including strategies, correlations, and synchronicity, and we use these definitions to extend results about synchronicity. We extend the graph homomorphism (isomorphism) game to quantum graphs, and show it is synchronous (bisynchronous) and connect its perfect (bi)strategies to quantum graph homomorphisms (isomorphisms). Our extended definitions agree with the existing quantum games literature, except in the case of synchronicity.
We introduce a category qGph of quantum graphs, whose definition is motivated entirely from noncommutative geometry. For all quantum graphs G and H in qGph, we then construct a quantum graph [G,H] of homomorphisms from G to H, making qGph a closed symmetric monoidal category. We prove that for all finite graphs G and H, the quantum graph [G,H] is nonempty iff the (G,H)-homomorphism game has a winning quantum strategy, directly generalizing the classical case.
The finite quantum graphs in qGph are tracial, real, and self-adjoint, and the morphisms between them are CP morphisms that are adjoint to a unital ∗-homomorphism. We prove that Weaver's two notions of a CP morphism coincide in this context. We also include a short proof that every finite reflexive quantum graph is the confusability quantum graph of a quantum channel.
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.
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.
Compact graphs are graphs for which the fractional automorphism polytope has no genuinely fractional vertices. This paper proposes a quantum analogue of this idea by evaluating the fundamental magic unitary of the quantum automorphism group on states, which we show to produce a closed convex set of doubly stochastic matrices sitting between the classical automorphism polytope and the full fractional automorphism polytope. Our main result is that the natural quantum analogue of compactness is classical, that is, a quantum compact graph is classically compact.
We also relate this set to the quantum orbital algebra and obtain a hierarchy of classical and quantum compactness pseudo notions. The framework recovers familiar consequences of compactness through commutants and suggests quantum analogues of generous transitivity and distance-transitivity. We also isolate examples and open problems indicating where quantum symmetries may strictly refine the classical compactness theory.
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.