2000 character limit reached
One rig to control them all
Published 6 Oct 2025 in cs.LO, math.CT, and quant-ph | (2510.05032v1)
Abstract: We introduce a theory for computational control, consisting of seven naturally interpretable equations. Adding these to a prop of base circuits constructs controlled circuits, borne out in examples of reversible Boolean circuits and quantum circuits. We prove that this syntactic construction semantically corresponds to taking the free rig category on the base prop.
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.