2000 character limit reached
Purity through Factorisation
Published 22 May 2017 in quant-ph and cs.LO | (1705.07652v2)
Abstract: We give a construction that identifies the collection of pure processes (i.e. those which are deterministic, or without randomness) within a theory containing both pure and mixed processes. Working in the framework of symmetric monoidal categories, we define a pure subcategory. This definition arises elegantly from the categorical notion of a weak factorisation system. Our construction gives the expected result in several examples, both quantum and classical.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.