Dagger symmetric monoidal category
This article needs additional citations for verification. (July 2022) |
In the mathematical field of category theory, a dagger symmetric monoidal category is a monoidal category that also possesses a dagger structure. That is, this category comes equipped not only with a tensor product in the category theoretic sense but also with a dagger structure, which is used to describe unitary morphisms and self-adjoint morphisms in : abstract analogues of those found in FdHilb, the category of finite-dimensional Hilbert spaces. This type of category was introduced by Peter Selinger[1] as an intermediate structure between dagger categories and the dagger compact categories that are used in categorical quantum mechanics, an area that now also considers dagger symmetric monoidal categories when dealing with infinite-dimensional quantum mechanical concepts.
Formal definition
[edit]A dagger symmetric monoidal category is a symmetric monoidal category that also has a dagger structure such that for all , and all and in ,
- ;
- ;
- ;
- and
- .
Here, and are the natural isomorphisms that form the symmetric monoidal structure.
Examples
[edit]The following categories are examples of dagger symmetric monoidal categories:
- The category Rel of sets and relations where the tensor is given by the product and where the dagger of a relation is given by its relational converse.
- The category FdHilb of finite-dimensional Hilbert spaces is a dagger symmetric monoidal category where the tensor is the usual tensor product of Hilbert spaces and where the dagger of a linear map is given by its Hermitian adjoint.
A dagger symmetric monoidal category that is also compact closed is a dagger compact category; both of the above examples are in fact dagger compact.
See also
[edit]References
[edit]- ^ Selinger, Peter (2007). "Dagger compact closed categories and completely positive maps: (Extended Abstract)". Electronic Notes in Theoretical Computer Science. 170 (Proceedings of the 3rd International Workshop on Quantum Programming Languages (QPL 2005)): 139–163. CiteSeerX 10.1.1.84.8476. doi:10.1016/j.entcs.2006.12.018.