Higher-order CPM Constructions
arXiv:1805.12079 · doi:10.4204/EPTCS.287.8
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.
arXiv commentIn Proceedings QPL 2018, arXiv:1901.09476
References in corpus (10)
- The Sheaf-Theoretic Structure Of Non-Locality and Contextuality
- Completely positive projections and biproducts
- Categorical Probabilistic Theories
- Graded Entailment for Compositional Distributional Semantics
- Fantastic Quantum Theories and Where to Find Them
- A Graph Theoretic Perspective on CPM(Rel)
- A Bestiary of Sets and Relations
- Dual Density Operators and Natural Language Meaning
- Double Dilation Double Mixing (extended abstract)
- Ambiguity and Incomplete Information in Categorical Models of Language