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:1912.07085 · Compositionality

Monotones in General Resource Theories

Tomáš Gonda, Robert W. Spekkens

Published Aug 9, 2023• 20 citations
arXivHTMLPDF

Abstract

A central problem in the study of resource theories is to find functions that are nonincreasing under resource conversions — termed monotones — in order to quantify resourcefulness. Various constructions of monotones appear in many different concrete resource theories. How general are these constructions? What are the necessary conditions on a resource theory for a given construction to be applicable? To answer these questions, we introduce a broad scheme for constructing monotones. It involves finding an order-preserving map from the preorder of resources of interest to a distinct preorder for which nontrivial monotones are previously known or can be more easily constructed; these monotones are then pulled back through the map. In one of the two main classes we study, the preorder of resources is mapped to a preorder of sets of resources, where the order relation is set inclusion, such that monotones can be defined via maximizing or minimizing the value of a function within these sets. In the other class, the preorder of resources is mapped to a preorder of tuples of resources, and one pulls back monotones that measure the amount of distinguishability of the different elements of the tuple (hence its information content). Monotones based on contractions arise naturally in the latter class, and, more surprisingly, so do weight and robustness measures. In addition to capturing many standard monotone constructions, our scheme also suggests significant generalizations of these. In order to properly capture the breadth of applicability of our results, we present them within a novel abstract framework for resource theories in which the notion of composition is independent of the types of the resources involved (i.e., whether they are states, channels, combs, etc.).

DOI
10.32408/compositionality-5-7

Related papers

Resource Theories as Quantale Modules

Tomáš Gonda

We aim to counter the tendency for specialization in science by advancing a language that can facilitate the translation of ideas and methods between disparate contexts. The focus is on questions of "resource-theoretic nature". In a resource theory, one identifies resources and allowed manipulations that can be used to transform them. Some of the main questions are: How to optimize resources? What are the trade-offs between them? Can a given resource be converted to another one via the allowed manipulations? Because of their ubiquity, methods used to answer them in one context can be used to tackle corresponding questions in new contexts. The translation occurs in two stages. Firstly, methods are generalized to the abstract language. Then, one can determine whether potentially novel contexts can accommodate them. We focus on the first stage, by introducing two variants of an abstract framework in which existing and yet unidentified resource theories can be represented. Using these, the task of generalizing concrete methods is tackled in chapter 4 by studying the ways in which meaningful measures of resources may be constructed. One construction expresses a notion of cost (or yield) of a resource. Among other applications, it may be used to extend measures from a subset of resources to a larger domain. Another construction allows the translation of resource measures from one resource theory to another. Special cases include resource robustness and weight measures, as well as relative entropy based measures quantifying minimal distinguishability from freely available resources. We instantiate some of these ideas in a resource theory of distinguishability in chapter 5. It describes the utility of systems with probabilistic behavior for the task of distinguishing between hypotheses, which said behavior may depend on.

arXiv:2112.02349•Dec 4, 2021•4 citations

Undecidability in Resource Theory: Can You Tell Resource Theories Apart?

Matteo Scandi, Jacopo Surace

A central question in resource theory is whether one can construct a set of monotones that completely characterize the allowed transitions dictated by a set of free operations. A similar question is whether two distinct sets of free operations generate the same class of transitions. These questions are part of the more general problem of whether it is possible to pass from one characterization of a resource theory to another. In the present Letter, we prove that in the context of quantum resource theories this class of problem is undecidable in general. This is done by proving the undecidability of the membership problem for completely positive trace preserving maps, which subsumes all the other results.

Physical Review Letters•Dec 27, 2021•7 citations

Resource theories of quantum channels and the universal role of resource erasure

Zi-Wen Liu, Andreas Winter

We initiate the systematic study of resource theories of quantum channels, i.e. of the dynamics that quantum systems undergo by completely positive maps, in abstracto: Resources are in principle all maps from one quantum system to another, but some maps are deemed free. The free maps are supposed to satisfy certain axioms, among them closure under tensor products, under composition and freeness of the identity map (the latter two say that the free maps form a monoid). The free maps act on the resources simply by tensor product and composition. This generalizes the much-studied resource theories of quantum states, and abolishes the distinction between resources (states) and the free maps, which act on the former, leaving only maps, divided into resource-full and resource-free ones. We discuss the axiomatic framework of quantifying channel resources, and show two general methods of constructing resource monotones of channels. Furthermore, we show that under mild regularity conditions, each resource theory of quantum channels has a distinguished monotone, the robustness (and its smoothed version), generalizing the analogous concept in resource theories of states. We give an operational interpretation of the log-robustness as the amount of heat dissipation (randomness) required for resource erasure by random reversible free maps, valid in broad classes of resource theories of quantum channels. Technically, this is based on an abstract version of the recent convex-split lemma, extended from its original domain of quantum states to ordered vector spaces with sufficiently well-behaved base norms (which includes the case of quantum channels with diamond norm or variants thereof). Finally, we remark on several key issues concerning the asymptotic theory.

arXiv:1904.04201•Apr 8, 2019•33 citations

Resource theories of quantum channels and the universal role of resource erasure

Andreas Winter

We initiate the systematic study of resource theories of quantum channels, i.e. of the dynamics that quantum systems undergo by completely positive maps, in abstracto: Resources are in principle all maps from one quantum system to another, but some maps are deemed free. The free maps are supposed to satisfy certain axioms, among them closure under tensor products, under composition and freeness of the identity map (the latter two say that the free maps form a monoid). The free maps act on the resources simply by tensor product and composition. This generalizes the much-studied resource theories of quantum states, and abolishes the distinction between resources (states) and the free maps, which act on the former, leaving only maps, divided into resource-full and resource-free ones. We discuss the axiomatic framework of quantifying channel resources, and show two general methods of constructing resource monotones of channels. Furthermore, we show that under mild regularity conditions, each resource theory of quantum channels has a distinguished monotone, the robustness (and its smoothed version), generalizing the analogous concept in resource theories of states. We give an operational interpretation of the log-robustness as the amount of heat dissipation (randomness) required for resource erasure by random reversible free maps, valid in broad classes of resource theories of quantum channels. Technically, this is based on an abstract version of the recent convex-split lemma, extended from its original domain of quantum states to ordered vector spaces with sufficiently well-behaved base norms (which includes the case of quantum channels with diamond norm or variants thereof). Finally, we remark on several key issues concerning the asymptotic theory.

•Jan 1, 2020•46 citations

The resource theory of causal influence and knowledge of causal influence

Marina Maciel Ansanelli, Beata Zjawin, David Schmid +5 more

Understanding and quantifying causal relationships between variables is essential for reasoning about the physical world. In this work, we develop a resource-theoretic framework to do so. Here, we focus on the simplest nontrivial setting -- two variables that are causally ordered, meaning that the first has the potential to influence the second, without hidden confounding. First, we introduce the resource theory that directly quantifies causal influence of a functional dependence in this setting and show that the problem of deciding convertibility of resources and identifying a complete set of monotones has a relatively straightforward solution. Following this, we introduce the resource theory that arises naturally when one has uncertainty about the functional dependence. We describe a linear program for deciding the question of whether one resource (i.e., state of knowledge about the functional dependence) can be converted to another. Then, we focus on the case where the variables are binary. In this case, we identify a triple of monotones that are complete in the sense that they capture the partial order over the set of all resources, and we provide an interpretation of each.

math.STCross-listedarXiv:2512.11209•New Journal of Physics•Dec 15, 2025•0 citations

Undecidability in resource theory: can you tell theories apart?

Matteo Scandi, Jacopo Surace

A central question in resource theory is whether one can construct a set of monotones that completely characterise the allowed transitions dictated by a set of free operations. A similar question is whether two distinct sets of free operations generate the same class of transitions. These questions are part of the more general problem of whether it is possible to pass from one characterisation of a resource theory to another. In the present letter we prove that in the context of quantum resource theories this class of problems is undecidable in general. This is done by proving the undecidability of the membership problem for CPTP maps, which subsumes all the other results.

arXiv:2105.09341•May 19, 2021•2 citations
A central problem in the study of resource theories is to find functions that are nonincreasing under resource conversions — termed monotones — in order to quantify resourcefulness. Various constructions of monotones appear in many different concrete resource theories. How general are these constructions? What are the necessary conditions on a resource theory for a given construction to be applicable? To answer these questions, we introduce a broad scheme for constructing monotones. It involves finding an order-preserving map from the preorder of resources of interest to a distinct preorder for which nontrivial monotones are previously known or can be more easily constructed; these monotones are then pulled back through the map. In one of the two main classes we study, the preorder of resources is mapped to a preorder of sets of resources, where the order relation is set inclusion, such that monotones can be defined via maximizing or minimizing the value of a function within these sets. In the other class, the preorder of resources is mapped to a preorder of tuples of resources, and one pulls back monotones that measure the amount of distinguishability of the different elements of the tuple (hence its information content). Monotones based on contractions arise naturally in the latter class, and, more surprisingly, so do weight and robustness measures. In addition to capturing many standard monotone constructions, our scheme also suggests significant generalizations of these. In order to properly capture the breadth of applicability of our results, we present them within a novel abstract framework for resource theories in which the notion of composition is independent of the types of the resources involved (i.e., whether they are states, channels, combs, etc.).
We aim to counter the tendency for specialization in science by advancing a language that can facilitate the translation of ideas and methods between disparate contexts. The focus is on questions of "resource-theoretic nature". In a resource theory, one identifies resources and allowed manipulations that can be used to transform them. Some of the main questions are: How to optimize resources? What are the trade-offs between them? Can a given resource be converted to another one via the allowed manipulations? Because of their ubiquity, methods used to answer them in one context can be used to tackle corresponding questions in new contexts. The translation occurs in two stages. Firstly, methods are generalized to the abstract language. Then, one can determine whether potentially novel contexts can accommodate them. We focus on the first stage, by introducing two variants of an abstract framework in which existing and yet unidentified resource theories can be represented. Using these, the task of generalizing concrete methods is tackled in chapter 4 by studying the ways in which meaningful measures of resources may be constructed. One construction expresses a notion of cost (or yield) of a resource. Among other applications, it may be used to extend measures from a subset of resources to a larger domain. Another construction allows the translation of resource measures from one resource theory to another. Special cases include resource robustness and weight measures, as well as relative entropy based measures quantifying minimal distinguishability from freely available resources. We instantiate some of these ideas in a resource theory of distinguishability in chapter 5. It describes the utility of systems with probabilistic behavior for the task of distinguishing between hypotheses, which said behavior may depend on.
A central question in resource theory is whether one can construct a set of monotones that completely characterize the allowed transitions dictated by a set of free operations. A similar question is whether two distinct sets of free operations generate the same class of transitions. These questions are part of the more general problem of whether it is possible to pass from one characterization of a resource theory to another. In the present Letter, we prove that in the context of quantum resource theories this class of problem is undecidable in general. This is done by proving the undecidability of the membership problem for completely positive trace preserving maps, which subsumes all the other results.
We initiate the systematic study of resource theories of quantum channels, i.e. of the dynamics that quantum systems undergo by completely positive maps, in abstracto: Resources are in principle all maps from one quantum system to another, but some maps are deemed free. The free maps are supposed to satisfy certain axioms, among them closure under tensor products, under composition and freeness of the identity map (the latter two say that the free maps form a monoid). The free maps act on the resources simply by tensor product and composition. This generalizes the much-studied resource theories of quantum states, and abolishes the distinction between resources (states) and the free maps, which act on the former, leaving only maps, divided into resource-full and resource-free ones. We discuss the axiomatic framework of quantifying channel resources, and show two general methods of constructing resource monotones of channels. Furthermore, we show that under mild regularity conditions, each resource theory of quantum channels has a distinguished monotone, the robustness (and its smoothed version), generalizing the analogous concept in resource theories of states. We give an operational interpretation of the log-robustness as the amount of heat dissipation (randomness) required for resource erasure by random reversible free maps, valid in broad classes of resource theories of quantum channels. Technically, this is based on an abstract version of the recent convex-split lemma, extended from its original domain of quantum states to ordered vector spaces with sufficiently well-behaved base norms (which includes the case of quantum channels with diamond norm or variants thereof). Finally, we remark on several key issues concerning the asymptotic theory.
We initiate the systematic study of resource theories of quantum channels, i.e. of the dynamics that quantum systems undergo by completely positive maps, in abstracto: Resources are in principle all maps from one quantum system to another, but some maps are deemed free. The free maps are supposed to satisfy certain axioms, among them closure under tensor products, under composition and freeness of the identity map (the latter two say that the free maps form a monoid). The free maps act on the resources simply by tensor product and composition. This generalizes the much-studied resource theories of quantum states, and abolishes the distinction between resources (states) and the free maps, which act on the former, leaving only maps, divided into resource-full and resource-free ones. We discuss the axiomatic framework of quantifying channel resources, and show two general methods of constructing resource monotones of channels. Furthermore, we show that under mild regularity conditions, each resource theory of quantum channels has a distinguished monotone, the robustness (and its smoothed version), generalizing the analogous concept in resource theories of states. We give an operational interpretation of the log-robustness as the amount of heat dissipation (randomness) required for resource erasure by random reversible free maps, valid in broad classes of resource theories of quantum channels. Technically, this is based on an abstract version of the recent convex-split lemma, extended from its original domain of quantum states to ordered vector spaces with sufficiently well-behaved base norms (which includes the case of quantum channels with diamond norm or variants thereof). Finally, we remark on several key issues concerning the asymptotic theory.
Understanding and quantifying causal relationships between variables is essential for reasoning about the physical world. In this work, we develop a resource-theoretic framework to do so. Here, we focus on the simplest nontrivial setting -- two variables that are causally ordered, meaning that the first has the potential to influence the second, without hidden confounding. First, we introduce the resource theory that directly quantifies causal influence of a functional dependence in this setting and show that the problem of deciding convertibility of resources and identifying a complete set of monotones has a relatively straightforward solution. Following this, we introduce the resource theory that arises naturally when one has uncertainty about the functional dependence. We describe a linear program for deciding the question of whether one resource (i.e., state of knowledge about the functional dependence) can be converted to another. Then, we focus on the case where the variables are binary. In this case, we identify a triple of monotones that are complete in the sense that they capture the partial order over the set of all resources, and we provide an interpretation of each.
A central question in resource theory is whether one can construct a set of monotones that completely characterise the allowed transitions dictated by a set of free operations. A similar question is whether two distinct sets of free operations generate the same class of transitions. These questions are part of the more general problem of whether it is possible to pass from one characterisation of a resource theory to another. In the present letter we prove that in the context of quantum resource theories this class of problems is undecidable in general. This is done by proving the undecidability of the membership problem for CPTP maps, which subsumes all the other results.