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:0909.0988

Braided Categorical Quantum Mechanics I

Spencer D. Stirling, Yong-Shi Wu

Published Sep 5, 2009• 2 citations
arXivHTMLPDF

Abstract

This is the first paper in a series where we generalize the Categorical Quantum Mechanics program (due to Abramsky, Coecke, et al) to braided systems. In our view a uniform description of quantum information for braided systems has not yet emerged. The picture is complicated by a diversity of examples that lacks a unifying framework for proving theorems and discovering new protocols. We use category theory to construct a high-level language that abstracts the quantum mechanical properties of braided systems. We exploit this framework to propose an axiomatic description of braided quantum information intended for topological quantum computation. In this installment we first generalize the primordial Abramsky-Coecke "quantum information flow" paradigm from compact closed categories to right-rigid strict monoidal categories. We then study dagger structures for rigid and/or braided categories and formulate a graphical dagger calculus. We then propose two generalizations of strongly compact closed categories. Finally we study partial traces in the context of dagger categories.

DOI
10.48550/arxiv.0909.0988

Related papers

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

Dagger linear logic for categorical quantum mechanics

Robin Cockett, Cole Comfort, Priyaa Varshinee Srinivasan

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.

arXiv:1809.00275•Logical Methods in Computer Science•Nov 16, 2021•13 citations

Categorical quantum computation

Paquette, Éric Oliver

Quantum computation is a sub-discipline of computer science that studies computation performed using quantum-mechanical phenomena such as entanglement and the principle of quantum superposition. The work presented in this dissertation is part of a program of research initiated by S. Abramsky and B. Coecke that aims to establish a categorical foundation for quantum computation. The usual axiomatisation of quantum computation uses the biproduct structure to express the classical fragment of the theory that comprises, for instance, the result of a measurement or classical control. Following the work of S. Abramsky and B. Coecke, that of P. Selinger for the quantum aspect, and that of B. Coecke and D. Pavlovic for the classical aspect, we will introduce a complete categorical semantics for quantum computation that includes bath the classical and the quantum fragments of the theory. In order to do so, we will introduce the notion of classical-quantum interface, which is sufficiently general to include the two fragments of the theory. Moreover, the classical fragment will be axiomatised exclusively with respect to the tensorial structure, i.e., without using biproducts. In particular, such an approach enables the use of an intuitive and rigorous graphical calculus as a proof technique which is often easier to use than the usual algebraic techniques. Moreover, we will see that the axiomatisation of basis structures from which is derived the notion of classical transformation also enables the definition of many families of classical transformations such as relations, functions, bijections, and stochastic and bistochastic transformations; the latter three being especially suitable in the context of quantum computation. Finally, we will present some quantum protocols and prove some results concerning these, using a graphical calculus developed for the categorical semantics in order to illustrates the usefulness and the well-foundedness of the theory. Key words: Quantum computation. Classical control. Category theory. Compact closed categories. †-monoidal categories. †-compact categories. Classical-quantum interfaces.

•Jan 1, 2008•7 citations

Dagger Compact Closed Categories and Completely Positive Maps

Peter Selinger

Dagger compact closed categories were recently introduced by Abramsky and Coecke, under the name “strongly compact closed categories”, as an axiomatic framework for quantum mechanics. We present a graphical language for dagger compact closed categories, and sketch a proof of its completeness for equational reasoning. We give a general construction, the CPM construction, which associates to each dagger compact closed category its “category of completely positive maps”, and we show that the resulting category is again dagger compact closed. We apply these ideas to Abramsky and Coecke's interpretation of quantum protocols, and to D'Hondt and Panangaden's predicate transformer semantics.

Electronic Notes in Theoretical Computer Science•Mar 1, 2007•425 citations

Relational Quantum Dynamics as a Dagger Compact Category: A Categorical Framework for Awareness Transfer, No-Cloning, and Teleportation

Arash E. Zaghi

We establish a rigorous connection between Relational Quantum Dynamics (RQD) and Categorical Quantum Mechanics (CQM) by formally showing that the category Q of quantum processes in RQD can be endowed with the structure of a dagger compact category. In particular, we demonstrate that Q satisfies the axioms of a dagger symmetric monoidal category with compact closure, mirroring the standard categorical formalism for quantum theory. Within this framework, key physical features of quantum mechanics, such as the transfer of awareness (information) in interactions, the no-cloning theorem, and the quantum teleportation protocol, are naturally expressed and interpreted. We define the categorical structures and illustrate the concepts with examples from quantum computing and quantum information. These examples highlight how RQD’s relational worldview aligns with CQM’s diagrammatic and algebraic characterization of quantum processes, thus providing a robust unified description. The results underscore that the RQD category Q not only has the formal properties of a dagger compact category but also that this structure provides clear insight into quantum informational tasks and no-go theorems, while incorporating the notion of observer-dependent reality in RQD via a functional mapping of awareness.

•Mar 18, 2025•2 citations

Strongly Compact Closed Semantics

Bob Coecke

These lecture notes survey some joint work with Samson Abramsky as it was presented by me at Mathematical Foundations of Programming Semantics XXI in Birmingham (2005).2 It concerns a categorical semantics for quantum mechanics introduced in [Abramsky, S. and Coecke, B. (2004) A categorical semantics of quantum protocols. In: Proceedings of the 19th Annual IEEE Symposium on Logic in Computer Science (LiCS'04), IEEE Computer Science Press. An extended & improved version is available at http://arXiv.org/quant-ph/0402130; Abramsky, S. and Coecke, B. (2005) Abstract physical traces. Theory and Applications of Categories 14, 111–124. Available at www.tac.mta.ca/tac/volumes/14/6/14-06abs.html]. We present this semantics with a particular focus on the connection between categorical diagrams and certain pictures involving typed squares, triangles, diamonds and lines. Along the way we unravel the structural components which come with strong compact closure. We provide pointers to related literature. Keywords: Strong compact closure, semantics, quantum mechanics, quantum logic, quantum informatics.

Electronic Notes in Theoretical Computer Science•May 1, 2006•4 citations
This is the first paper in a series where we generalize the Categorical Quantum Mechanics program (due to Abramsky, Coecke, et al) to braided systems. In our view a uniform description of quantum information for braided systems has not yet emerged. The picture is complicated by a diversity of examples that lacks a unifying framework for proving theorems and discovering new protocols. We use category theory to construct a high-level language that abstracts the quantum mechanical properties of braided systems. We exploit this framework to propose an axiomatic description of braided quantum information intended for topological quantum computation. In this installment we first generalize the primordial Abramsky-Coecke "quantum information flow" paradigm from compact closed categories to right-rigid strict monoidal categories. We then study dagger structures for rigid and/or braided categories and formulate a graphical dagger calculus. We then propose two generalizations of strongly compact closed categories. Finally we study partial traces in the context of dagger categories.
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.
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.
Quantum computation is a sub-discipline of computer science that studies computation performed using quantum-mechanical phenomena such as entanglement and the principle of quantum superposition. The work presented in this dissertation is part of a program of research initiated by S. Abramsky and B. Coecke that aims to establish a categorical foundation for quantum computation. The usual axiomatisation of quantum computation uses the biproduct structure to express the classical fragment of the theory that comprises, for instance, the result of a measurement or classical control. Following the work of S. Abramsky and B. Coecke, that of P. Selinger for the quantum aspect, and that of B. Coecke and D. Pavlovic for the classical aspect, we will introduce a complete categorical semantics for quantum computation that includes bath the classical and the quantum fragments of the theory. In order to do so, we will introduce the notion of classical-quantum interface, which is sufficiently general to include the two fragments of the theory. Moreover, the classical fragment will be axiomatised exclusively with respect to the tensorial structure, i.e., without using biproducts. In particular, such an approach enables the use of an intuitive and rigorous graphical calculus as a proof technique which is often easier to use than the usual algebraic techniques. Moreover, we will see that the axiomatisation of basis structures from which is derived the notion of classical transformation also enables the definition of many families of classical transformations such as relations, functions, bijections, and stochastic and bistochastic transformations; the latter three being especially suitable in the context of quantum computation. Finally, we will present some quantum protocols and prove some results concerning these, using a graphical calculus developed for the categorical semantics in order to illustrates the usefulness and the well-foundedness of the theory. Key words: Quantum computation. Classical control. Category theory. Compact closed categories. †-monoidal categories. †-compact categories. Classical-quantum interfaces.
Dagger compact closed categories were recently introduced by Abramsky and Coecke, under the name “strongly compact closed categories”, as an axiomatic framework for quantum mechanics. We present a graphical language for dagger compact closed categories, and sketch a proof of its completeness for equational reasoning. We give a general construction, the CPM construction, which associates to each dagger compact closed category its “category of completely positive maps”, and we show that the resulting category is again dagger compact closed. We apply these ideas to Abramsky and Coecke's interpretation of quantum protocols, and to D'Hondt and Panangaden's predicate transformer semantics.
We establish a rigorous connection between Relational Quantum Dynamics (RQD) and Categorical Quantum Mechanics (CQM) by formally showing that the category Q of quantum processes in RQD can be endowed with the structure of a dagger compact category. In particular, we demonstrate that Q satisfies the axioms of a dagger symmetric monoidal category with compact closure, mirroring the standard categorical formalism for quantum theory. Within this framework, key physical features of quantum mechanics, such as the transfer of awareness (information) in interactions, the no-cloning theorem, and the quantum teleportation protocol, are naturally expressed and interpreted. We define the categorical structures and illustrate the concepts with examples from quantum computing and quantum information. These examples highlight how RQD’s relational worldview aligns with CQM’s diagrammatic and algebraic characterization of quantum processes, thus providing a robust unified description. The results underscore that the RQD category Q not only has the formal properties of a dagger compact category but also that this structure provides clear insight into quantum informational tasks and no-go theorems, while incorporating the notion of observer-dependent reality in RQD via a functional mapping of awareness.
These lecture notes survey some joint work with Samson Abramsky as it was presented by me at Mathematical Foundations of Programming Semantics XXI in Birmingham (2005).2 It concerns a categorical semantics for quantum mechanics introduced in [Abramsky, S. and Coecke, B. (2004) A categorical semantics of quantum protocols. In: Proceedings of the 19th Annual IEEE Symposium on Logic in Computer Science (LiCS'04), IEEE Computer Science Press. An extended & improved version is available at http://arXiv.org/quant-ph/0402130; Abramsky, S. and Coecke, B. (2005) Abstract physical traces. Theory and Applications of Categories 14, 111–124. Available at www.tac.mta.ca/tac/volumes/14/6/14-06abs.html]. We present this semantics with a particular focus on the connection between categorical diagrams and certain pictures involving typed squares, triangles, diamonds and lines. Along the way we unravel the structural components which come with strong compact closure. We provide pointers to related literature. Keywords: Strong compact closure, semantics, quantum mechanics, quantum logic, quantum informatics.