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:2602.23865

Supermaps on generalised theories

Matt Wilson, James Hefford, Timothée Hoffreumon

quant-phcs.LOmath.CTSubmitted Feb 27, 2026• Announced Mar 2, 2026• 0 citations• Revised Apr 28, 2026 (v2)
v1 · Feb 27, 2026v2 · Apr 28, 2026v3 · Jun 21, 2026
arXivHTMLPDF

Abstract

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 recently proposed higher-order processes on boxworld can be obtained as a particular instance of categorical supermaps, and put forward a stable definition of higher-order real quantum theory.

Related papers

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•1 citation

Process matrices on generalised theories

Matt Wilson, James Hefford, Timothée Hoffreumon

We extend the process-matrix framework for defining indefinite causal orders to a broad class of generalised physical theories. We give a simple re-axiomatisation of spacetime contexts in terms of naturality over classical probes, which precisely captures non-contextual assignment together with compatibility with convexity and coarse-graining within local laboratories. Using this compositional perspective, we give a clean characterisation of theories in which abstract spacetime contexts admit a process-matrix representation, and we pin down the precise conditions (satisfied by classical theory, quantum theory, and a Boxworld-like theory) under which the supermap and process-matrix perspectives on higher-order processes coincide.

quant-pharXiv:2610.40448•Oct 30, 2026•0 citations

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•5 citations

COMPLETELY POSITIVE TRANSFORMATIONS OF QUANTUM OPERATIONS

Giulio Chiribella, Alessandro Toigo, Veronica Umanità

Quantum supermaps are higher-order maps transforming quantum operations into quantum operations and satisfying suitable requirements of normality and complete positivity. Here we present the extension of the theory of quantum supermaps, originally formulated in the finite dimensional setting, to the case of higher-order maps transforming quantum operations on generic von Neumann algebras. In this setting, we provide two dilation theorems for quantum supermaps that are the analogues of the Stinespring and Radon-Nikodym theorems for quantum operations. A structure theorem for probability measures with values in the set of quantum supermaps is also illustrated. Finally, some applications are given, and in particular it is shown that all the supermaps defined in this paper can be implemented by connecting quantum devices in quantum circuits.

QP-PQ, quantum probability and white noise analysis•Jan 1, 2013•0 citations

Causality in Higher Order Process Theories

Matt Wilson, Giulio Chiribella

Quantum supermaps provide a framework in which higher order quantum processes can act on lower order quantum processes. In doing so, they enable the definition and analysis of new quantum protocols and causal structures. Recently, key features of quantum supermaps were captured through a general categorical framework, which led to a framework of higher order process theories (HOPT). The HOPT framework models lower and higher order transformations in a single unified theory, with its mathematical structure shown to coincide with the notion of a closed symmetric monoidal category. Here we provide an equivalent construction of the HOPT framework from four simple axioms of process-theoretic nature. We then use the HOPT framework to establish connections between foundational features such as causality, determinism and signalling, alongside exploring their interaction with the mathematical structure of *-autonomy.

arXiv:2107.14581•Electronic Proceedings in Theoretical Computer Science•Sep 9, 2021•3 citations

The Structure of Higher-Order Quantum Resources with an Application to Coherence

Felix Ahnefeld, Thomas Theurer, Martin B. Plenio

We develop a general framework for higher-order quantum resources that treats the resourcefulness of quantum states, channels, and supermaps (also called processes) in a unified manner. By generalizing well-established concepts from resource theories of states and channels, we introduce and study supermap resource monotones and supermap distillation and dilution. As free supermaps, we consider free networks (supermaps that can be implemented with free channels), compatible supermaps (sets of supermaps closed under arbitrary composition), and maximally free superchannels. Specializing to approximate channel-to-channel conversions, we show that under mild assumptions, the conversion error with respect to the diamond distance and the worst-case infidelity coincide. We then apply the general framework to resource theories of dynamical coherence, where we establish the existence of largest sets of compatible supermaps. By characterizing these sets with semidefinite constraints, we show that they are strictly larger than the corresponding free networks but do not contain all maximally free superchannels. We finish by investigating the operational differences of these sets in one-shot channel distillation and dilution, providing solutions for both tasks in the parallel setting and for dilution in the adaptive setting.

quant-pharXiv:2609.40186•Oct 1, 2026•0 citations
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 recently proposed higher-order processes on boxworld can be obtained as a particular instance of categorical supermaps, and put forward a stable definition of higher-order real quantum theory.
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 extend the process-matrix framework for defining indefinite causal orders to a broad class of generalised physical theories. We give a simple re-axiomatisation of spacetime contexts in terms of naturality over classical probes, which precisely captures non-contextual assignment together with compatibility with convexity and coarse-graining within local laboratories. Using this compositional perspective, we give a clean characterisation of theories in which abstract spacetime contexts admit a process-matrix representation, and we pin down the precise conditions (satisfied by classical theory, quantum theory, and a Boxworld-like theory) under which the supermap and process-matrix perspectives on higher-order processes 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.
Quantum supermaps are higher-order maps transforming quantum operations into quantum operations and satisfying suitable requirements of normality and complete positivity. Here we present the extension of the theory of quantum supermaps, originally formulated in the finite dimensional setting, to the case of higher-order maps transforming quantum operations on generic von Neumann algebras. In this setting, we provide two dilation theorems for quantum supermaps that are the analogues of the Stinespring and Radon-Nikodym theorems for quantum operations. A structure theorem for probability measures with values in the set of quantum supermaps is also illustrated. Finally, some applications are given, and in particular it is shown that all the supermaps defined in this paper can be implemented by connecting quantum devices in quantum circuits.
Quantum supermaps provide a framework in which higher order quantum processes can act on lower order quantum processes. In doing so, they enable the definition and analysis of new quantum protocols and causal structures. Recently, key features of quantum supermaps were captured through a general categorical framework, which led to a framework of higher order process theories (HOPT). The HOPT framework models lower and higher order transformations in a single unified theory, with its mathematical structure shown to coincide with the notion of a closed symmetric monoidal category. Here we provide an equivalent construction of the HOPT framework from four simple axioms of process-theoretic nature. We then use the HOPT framework to establish connections between foundational features such as causality, determinism and signalling, alongside exploring their interaction with the mathematical structure of *-autonomy.
We develop a general framework for higher-order quantum resources that treats the resourcefulness of quantum states, channels, and supermaps (also called processes) in a unified manner. By generalizing well-established concepts from resource theories of states and channels, we introduce and study supermap resource monotones and supermap distillation and dilution. As free supermaps, we consider free networks (supermaps that can be implemented with free channels), compatible supermaps (sets of supermaps closed under arbitrary composition), and maximally free superchannels. Specializing to approximate channel-to-channel conversions, we show that under mild assumptions, the conversion error with respect to the diamond distance and the worst-case infidelity coincide. We then apply the general framework to resource theories of dynamical coherence, where we establish the existence of largest sets of compatible supermaps. By characterizing these sets with semidefinite constraints, we show that they are strictly larger than the corresponding free networks but do not contain all maximally free superchannels. We finish by investigating the operational differences of these sets in one-shot channel distillation and dilution, providing solutions for both tasks in the parallel setting and for dilution in the adaptive setting.