Parameterized Quantum Circuit Semantics Through Enriched Categories
Logic in Computer Science
Summary
The authors explain how traditional math models describe fixed quantum circuits well but struggle with families of circuits that change based on parameters. They introduce a new mathematical framework using advanced category theory to better handle these parameterized quantum circuits. Their approach offers new insights into quantum controls and communication, and shows how different views of quantum control can be unified. This work helps make the math behind adaptable quantum circuits clearer.
Authors
Neil J. Ross, Scott Wesley
Abstract
It is well-known that combinatorial circuits are modeled mathematically by string diagrams in monoidal categories. Given a gate set $Σ$, the circuits over $Σ$ can be thought of as string diagrams in the free monoidal category generated by $Σ$. In this model, circuit semantics are then given by monoidal functors out of this free category. For quantum circuits, this functor is often valued in the category of unitary matrices. This model suffices for concrete quantum circuits, but fails to describe parameterized families of quantum circuits, such as those which arise in the analysis of ansatz circuits. In this paper, we introduce an approach to parameterized circuit semantics, which is based on enriched category theory. We first introduce an abstract categorical construction, and use this to gain new insights on controlled operations and quantum communication. We then study the special cases of Cartesian monoidal parameters and monoidal closed parameters, both endowing the parameterized semantics with useful constructions.We conclude by showing that the monoidal closed case can be used to unify two perspectives on quantum control.