🤖 AI Summary
This paper addresses the lack of a unified theoretical framework for computational control. We propose a generic algebraic-semantic construction method, whose core innovation is the first introduction of seven naturally interpretable equations that extend base props into a controlled-circuit syntax, with a rigorous proof that its semantics corresponds precisely to the free rig category. The framework uniformly models control structures in both reversible Boolean and quantum circuits, thereby establishing syntactic–semantic consistency. Our approach integrates prop algebra, rig category theory, and models of reversible/quantum computation, employing formal syntax–semantics correspondence techniques. The resulting theory exhibits strong interpretability and extensibility, and provides the first mathematically rigorous yet engineering-intuitive foundation for cross-paradigm circuit control.
📝 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.