Higher-order CPM constructions
From MaRDI portal
Abstract: We define a higher-order generalisation of the CPM construction based on arbitrary finite abelian group symmetries of symmetric monoidal categories. We show that our new construction is functorial, and that its closure under iteration can be characterised by seeing the construction as an algebra for an appropriate monad. We provide several examples of the construction, connecting to previous work on the CPM construction and on categorical probabilistic theories, as well as upcoming work on higher-order interference and hyper-decoherence.
Recommendations
Cites work
- A bestiary of sets and relations
- A graph theoretic perspective on CPM(Rel)
- Ambiguity and incomplete information in categorical models of language
- Axiomatic description of mixed states from Selinger's CPM-construction
- Categorical probabilistic theories
- Completely positive projections and biproducts
- Dagger compact closed categories and completely positive maps (extended abstract)
- Distributional sentence entailment using density matrices
- scientific article; zbMATH DE number 7339575 (Why is no real title available?)
- Open system categorical quantum semantics in natural language processing
- Picturing quantum processes. A first course in quantum theory and diagrammatic reasoning
- The sheaf-theoretic structure of non-locality and contextuality
Cited in
(4)
This page was built for publication: Higher-order CPM constructions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3385633)