Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:2207.09180

Polycategorical Constructions for Unitary Supermaps of Arbitrary Dimension

Matt Wilson, Giulio Chiribella

Published Jul 19, 2022• 13 citations
arXivHTMLPDF

Abstract

We provide a construction for holes into which morphisms of abstract symmetric monoidal categories can be inserted, termed the polyslot construction pslot[C], and identify a sub-class srep[C] of polyslots that are single-party representable. These constructions strengthen a previously introduced notion of locally-applicable transformation used to characterize quantum supermaps in a way that is sufficient to re-construct unitary supermaps directly from the monoidal structure of the category of unitaries. Both constructions furthermore freely reconstruct the enriched polycategorical semantics for quantum supermaps which allows to compose supermaps in sequence and in parallel whilst forbidding the creation of time-loops. By freely constructing key compositional features of supermaps, and characterizing supermaps in the finite-dimensional case, polyslots are proposed as a suitable generalization of unitary-supermaps to infinite dimensions and are shown to include canonical examples such as the quantum switch. Beyond specific applications to quantum-relevant categories, a general class of categorical structures termed path-contraction groupoids are defined on which the srep[C] and pslot[C] constructions are shown to coincide.

DOI
10.48550/arxiv.2207.09180

Related papers

Quantum Supermaps are Characterized by Locality

Matt Wilson, Giulio Chiribella, Aleks Kissinger

We provide a new characterisation of quantum supermaps in terms of an axiom that refers only to sequential and parallel composition. Consequently, we generalize quantum supermaps to arbitrary monoidal categories and operational probabilistic theories. We do so by providing a simple definition of locally-applicable transformation on a monoidal category. The definition can be rephrased in the language of category theory using the principle of naturality, and can be given an intuitive diagrammatic representation in terms of which all proofs are presented. In our main technical contribution, we use this diagrammatic representation to show that locally-applicable transformations on quantum channels are in one-to-one correspondence with deterministic quantum supermaps. This alternative characterization of quantum supermaps is proven to work for more general multiple-input supermaps such as the quantum switch and on arbitrary normal convex spaces of quantum channels such as those defined by satisfaction of signaling constraints.

arXiv:2205.09844•Quantum•Mar 9, 2026•26 citations

A Profunctorial Semantics for Quantum Supermaps

James Hefford, Matthew Wilson

We identify morphisms of strong profunctors as a categorification of quantum supermaps. These black-box generalisations of diagrams-with-holes are hence placed within the broader field of profunctor optics, as morphisms in the category of copresheaves on concrete networks. This enables the first construction of abstract logical connectives such as tensor products and negations for supermaps in a totally theory-independent setting. These logical connectives are found to be all that is needed to abstractly model the key structural features of the quantum theory of supermaps: black-box indefinite causal order, black-box definite causal order, and the factorisation of definitely causally ordered supermaps into concrete circuit diagrams. We demonstrate that at the heart of these factorisation theorems lies the Yoneda lemma and the notion of representability.

arXiv:2402.02997•ACM/IEEE Symposium on Logic in Computer Science (LICS)•Jun 21, 2024•16 citations

A Mathematical Framework for Transformations of Physical Processes

Matt Wilson, Giulio Chiribella

We observe that the existence of sequential and parallel composition supermaps in higher order theories of transformations can be formalised using enriched category theory. Encouraged by relevant examples such as unitary supermaps and layers within higher order causal categories (HOCCs), we treat the modelling of higher order physical theories with enriched monoidal categories in analogy with the modelling of physical theories with monoidal categories. We use the enriched monoidal setting to construct a suitable definition of structure preserving map between higher order physical theories via the Grothendieck construction. We then show that the convenient feature of currying in higher order physical theories can be seen as a consequence of combining the primitive assumption of the existence of parallel and sequential composition supermaps with an additional feature of linking. We then use our definition of structure preserving map to show that categories containing infinite towers of enriched monoidal categories with full and faithful structure preserving maps between them inevitably lead to closed monoidal structures. The aim of the proposed definitions is to step towards providing a broad framework for the study and comparison of novel causal structures in quantum theory, and, more broadly, a paradigm of physical theory where static and dynamical features are treated in a unified way.

arXiv:2204.04319•Apr 8, 2022•16 citations

Supermaps on generalised theories

Matt Wilson, James Hefford, Timothée Hoffreumon

Categorical supermaps generalise higher-order quantum operations from finite-dimensional quantum theory to arbitrary circuit theories. In this paper, we establish the Yoneda lemma for categorical supermaps, which states that whenever a physical theory has a suitable notion of channel-state duality, then categorical supermaps on that theory can be concretely represented in terms of that duality. This lemma eliminates any guesswork or ambiguity when defining the appropriate notion of supermap for these theories. As a concrete application, we show that the categorical supermaps on Boxworld are in general characterised by a physically well-motivated weaking of the recently proposed NSWSE principle for higher-order processes on boxworld. Furthermore, via the same Yoneda lemma we put forward a stable definition for supermaps in real quantum theory.

quant-pharXiv:2602.23865•Mar 2, 2026•4 citations

Complete Positivity for Mixed Unitary Categories

Robin Cockett, Priyaa Varshinee Srinivasan

Coecke and Heunen described completely positive maps in dagger monoidal categories and the {\sf CP}-infinity construction on these categories in order to construct a category of arbitrary dimensional quantum processes. This article generalizes the ${\sf CP}$-infinity construction of dagger monoidal categories to mixed unitary categories. Mixed unitary categories, on the one hand, generalize the (compact) dagger monoidal categories, and on the other hand, accommodate arbitrary dimensional quantum processes, both without sacrificing the notion of dual objects. This means that the ${\sf CP}$-infinity construction for mixed unitary categories provides a suitable semantics for higher-order quantum programming languages which employ arbitrary dimensional structures. The existing results for the ${\sf CP}$-infinity construction are shown to generalize to the new setting. In particular, the notion of environment structures generalizes to mixed unitary categories and it is shown that the ${\sf CP}$-infinity construction for mixed unitary categories is characterized by this generalized environment structure.

arXiv:1905.08877•May 21, 2019•4 citations

Parameterized Quantum Circuit Semantics Through Enriched Categories

Neil J. Ross, Scott Wesley

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.

quant-pharXiv:2607.16114•Jul 20, 2026•0 citations
We provide a construction for holes into which morphisms of abstract symmetric monoidal categories can be inserted, termed the polyslot construction pslot[C], and identify a sub-class srep[C] of polyslots that are single-party representable. These constructions strengthen a previously introduced notion of locally-applicable transformation used to characterize quantum supermaps in a way that is sufficient to re-construct unitary supermaps directly from the monoidal structure of the category of unitaries. Both constructions furthermore freely reconstruct the enriched polycategorical semantics for quantum supermaps which allows to compose supermaps in sequence and in parallel whilst forbidding the creation of time-loops. By freely constructing key compositional features of supermaps, and characterizing supermaps in the finite-dimensional case, polyslots are proposed as a suitable generalization of unitary-supermaps to infinite dimensions and are shown to include canonical examples such as the quantum switch. Beyond specific applications to quantum-relevant categories, a general class of categorical structures termed path-contraction groupoids are defined on which the srep[C] and pslot[C] constructions are shown to coincide.
We provide a new characterisation of quantum supermaps in terms of an axiom that refers only to sequential and parallel composition. Consequently, we generalize quantum supermaps to arbitrary monoidal categories and operational probabilistic theories. We do so by providing a simple definition of locally-applicable transformation on a monoidal category. The definition can be rephrased in the language of category theory using the principle of naturality, and can be given an intuitive diagrammatic representation in terms of which all proofs are presented. In our main technical contribution, we use this diagrammatic representation to show that locally-applicable transformations on quantum channels are in one-to-one correspondence with deterministic quantum supermaps. This alternative characterization of quantum supermaps is proven to work for more general multiple-input supermaps such as the quantum switch and on arbitrary normal convex spaces of quantum channels such as those defined by satisfaction of signaling constraints.
We identify morphisms of strong profunctors as a categorification of quantum supermaps. These black-box generalisations of diagrams-with-holes are hence placed within the broader field of profunctor optics, as morphisms in the category of copresheaves on concrete networks. This enables the first construction of abstract logical connectives such as tensor products and negations for supermaps in a totally theory-independent setting. These logical connectives are found to be all that is needed to abstractly model the key structural features of the quantum theory of supermaps: black-box indefinite causal order, black-box definite causal order, and the factorisation of definitely causally ordered supermaps into concrete circuit diagrams. We demonstrate that at the heart of these factorisation theorems lies the Yoneda lemma and the notion of representability.
We observe that the existence of sequential and parallel composition supermaps in higher order theories of transformations can be formalised using enriched category theory. Encouraged by relevant examples such as unitary supermaps and layers within higher order causal categories (HOCCs), we treat the modelling of higher order physical theories with enriched monoidal categories in analogy with the modelling of physical theories with monoidal categories. We use the enriched monoidal setting to construct a suitable definition of structure preserving map between higher order physical theories via the Grothendieck construction. We then show that the convenient feature of currying in higher order physical theories can be seen as a consequence of combining the primitive assumption of the existence of parallel and sequential composition supermaps with an additional feature of linking. We then use our definition of structure preserving map to show that categories containing infinite towers of enriched monoidal categories with full and faithful structure preserving maps between them inevitably lead to closed monoidal structures. The aim of the proposed definitions is to step towards providing a broad framework for the study and comparison of novel causal structures in quantum theory, and, more broadly, a paradigm of physical theory where static and dynamical features are treated in a unified way.
Categorical supermaps generalise higher-order quantum operations from finite-dimensional quantum theory to arbitrary circuit theories. In this paper, we establish the Yoneda lemma for categorical supermaps, which states that whenever a physical theory has a suitable notion of channel-state duality, then categorical supermaps on that theory can be concretely represented in terms of that duality. This lemma eliminates any guesswork or ambiguity when defining the appropriate notion of supermap for these theories. As a concrete application, we show that the categorical supermaps on Boxworld are in general characterised by a physically well-motivated weaking of the recently proposed NSWSE principle for higher-order processes on boxworld. Furthermore, via the same Yoneda lemma we put forward a stable definition for supermaps in real quantum theory.
Coecke and Heunen described completely positive maps in dagger monoidal categories and the {\sf CP}-infinity construction on these categories in order to construct a category of arbitrary dimensional quantum processes. This article generalizes the CP{\sf CP}CP-infinity construction of dagger monoidal categories to mixed unitary categories. Mixed unitary categories, on the one hand, generalize the (compact) dagger monoidal categories, and on the other hand, accommodate arbitrary dimensional quantum processes, both without sacrificing the notion of dual objects. This means that the CP{\sf CP}CP-infinity construction for mixed unitary categories provides a suitable semantics for higher-order quantum programming languages which employ arbitrary dimensional structures. The existing results for the CP{\sf CP}CP-infinity construction are shown to generalize to the new setting. In particular, the notion of environment structures generalizes to mixed unitary categories and it is shown that the CP{\sf CP}CP-infinity construction for mixed unitary categories is characterized by this generalized environment structure.
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.