This paper was converted on www.awesomepapers.org from LaTeX by an anonymous user.
Want to know more? Visit the Converter page.

Dynamical Resources

Gilad Gour [email protected] Department of Mathematics and Statistics, University of Calgary, AB, Canada T2N 1N4 Institute for Quantum Science and Technology, University of Calgary, AB, Canada T2N 1N4    Carlo Maria Scandolo [email protected] Department of Mathematics and Statistics, University of Calgary, AB, Canada T2N 1N4 Institute for Quantum Science and Technology, University of Calgary, AB, Canada T2N 1N4
Abstract

Quantum channels are quintessential to quantum information, being used in all protocols, and describing how systems evolve in space and time. As such, they play a key role in the manipulation of quantum resources, and they are often resources themselves, called dynamical resources. This forces us to go beyond standard resource theories of quantum states. Here we provide a rigorous foundation for dynamical resource theories, where the resources into play are quantum channels, explaining how to manipulate dynamical resources with free superchannels. In particular, when the set of free superchannels is convex, we present a novel construction of an infinite and complete family of convex resource monotones, giving necessary and sufficient conditions for convertibility under free superchannels. After showing that the conversion problem in convex dynamical resource theories can be solved with conic linear programming, we define various resource-theoretic protocols for dynamical resources. These results serve as the framework for the study of concrete examples of theories of dynamical resources, such as dynamical entanglement theory.

I Introduction

The remarkable success of quantum information stems from the fact that quantum objects provide concrete advantages in several tasks. Think, for instance, of entangled states [1], which can be harnessed to implement protocols that have no classical analogue [2, 3, 4, 5]. Similar to entanglement, other quantum features are resources, such as coherence in quantum superpositions [6]. The idea of entanglement and other quantum features helping in information-theoretic tasks can be made rigorous with the framework of resource theories [7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17]. This framework is so general and powerful that it can be extended even beyond the quantum case [18, 19, 20, 21, 22, 23, 24, 25, 26, 27].

Resource theories have been used to study a great number of physical situations [14], always providing new insights into quantum theory and novel results for quantum information protocols. The basic idea behind them is that an agent operates on a quantum system to perform some task, but they do not have access to the full set of quantum operations. Instead, they can only perform a strict subset of them, called free operations. Similarly, they cannot prepare the full set of quantum states, but only a strict subset of them, the free states. The restriction usually comes from the physical constraints of the task the agent is trying to perform: free operations are those that are easy to implement in the physical scenario the agent operates in. Anything that can help the agent overcome their restriction is regarded as a valuable resource.

The convertibility between two resources under free operations sets up a preorder on the set of resources, whereby a resource is more valuable than another if the former can be converted into the latter by some free operation. In simpler terms, a resource is more valuable than another if, from the former, it is possible to reach a larger set of resources. This allows one to introduce the notion of resource monotone, a real-valued function that assigns a “price” to resources according to their preorder. Monotones often have a very important operational and physical meaning (e.g. the entropy or the free energy in quantum thermodynamics [28, 29, 30]), for they quantify how well a given task can be performed [14]. Two tasks that are particularly relevant in resource theories are extracting the maximum amount of the maximal resource out of a generic resource (distillation), and minimizing the amount of the maximal resource necessary to produce a given resource (cost) [7, 8, 10, 23, 14, 17]. The distillation and cost of a state obey a Carnot-like inequality, with the distillation always less than or equal to the cost [31].

Resource theories have been studied in great detail when the resources involved are states (also known as static resources) [14]. In this case, one wants to study the conversion between states. This is the usual setting in which, e.g., one studies entanglement theory [1, 32].

Nevertheless, if one looks closely at the first examples where entanglement proved to be a resource (e.g. quantum teleportation [2] and dense coding [3]), one notices they involve the conversion of a state into a particular channel, i.e. a static resource into a dynamical one [33, 34]. Therefore the need to go beyond conversion between static resources is built in the very first protocol showing the value of quantum resources. This is supported by the fact that in physics everything, including a state, can be viewed as a dynamical resource [35, 36, 37]. Extending resource theories from states to channels [14, 38, 39, 40] has recently gained considerable attention [18, 21, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64], because of their relevance in a lot of information-theoretic situations [65, 35, 14, 39]. Moreover, since quantum channels represent the most general ways in which a physical system evolves, for a more effective exploitation of quantum resources, it is essential to understand how they are consumed or produced by evolution.

In theories of dynamical resources, the agent converts different channels by means of a restricted set of supermaps [35, 66, 67, 68, 69, 43, 70]. In particular, we focus on supermaps that send quantum channels to quantum channels. They are called superchannels. They are not just abstract entities, but they can be realized in a laboratory with a pre-processing channel and a post-processing channel, connected by a memory system [35, 43]. Clearly, if we take the pre- and the post-processing of a superchannel to be free channels (according to some resource theory of states), we have a free superchannel [18], which sends free channels to free channels (even in a complete sense). This is the most common approach to constructing free superchannels [18, 39].

In this article, which is a companion to Ref. [59], we present the general framework of resource theories of quantum processes, which constitutes the mathematical framework for our treatment of dynamical entanglement announced in Ref. [59]. We note how for the largest class of free superchannels in a resource theory, which are completely resource non-generating superchannels, it is not clear if they can actually be realized in terms of free pre- and post-processing, and we conjecture that this is not the case.

Then we turn to the conversion problem, showing two ways to solve it in convex dynamical resource theories by means of a conic linear program. In the first approach, we construct a complete family of convex dynamical monotones, which give necessary and sufficient conditions for convertibility under free superchannels. In the second approach, solving the conversion problem becomes equivalent to calculating a particular type of distance—the conversion distance—from one channel to another.

Finally, we present the classic resource-theoretic protocols of cost and distillation both in the single-shot and the asymptotic regime. We note that for dynamical resources such protocols take a new twist from their static counterpart, whereby various dynamical resources can also be applied one after another (and not just in parallel) to create an adaptive strategy [71, 72, 42, 73, 47, 58, 59].

The article is organized as follows. In section II, we present basic facts on the formalism of superchannels, including a new result on the uniqueness of a superchannel realization in terms of pre- and post-processing. In the same section we give an overview of quantum resource theories as well. Section III is all devoted to the general formalism of resource theories for quantum processes, with a new construction of a complete set of monotones, and precise definitions of several conversion protocols. Conclusions are drawn in section IV.

II Preliminaries

This section contains some basic notions to understand the rest of this article. First we specify the notation we use, and then we move to give a brief overview of the formalism used to manipulate quantum channels, namely supermaps, superchannels, and combs. Here we also prove a new result (theorem 2), concerning the uniqueness of the realization of a superchannel in terms of quantum channels. Finally we give a brief introduction to resource theories.

II.1 Notation

Physical systems and their corresponding Hilbert spaces will be denoted by AA, BB, CC, etc, where we will use the notation ABAB to mean ABA\otimes B. Dimensions will be denoted with vertical bars; e.g. the dimension of system AA will be denoted by |A|\left|A\right|. The tilde symbol will be reserved to indicate a replica of a system. For example, A~\widetilde{A} denotes a replica of AA, i.e. |A|=|A~|\left|A\right|=\left|\widetilde{A}\right|. Density matrices acting on Hilbert spaces will be denoted by lowercase Greek letter ρ\rho, σ\sigma, etc, with one exception for the maximally mixed state (i.e. the uniform state), which will be denoted by uA:=1|A|IAu_{A}:=\frac{1}{\left|A\right|}I_{A}.

The set of all bounded operators acting on system AA is denoted by 𝔅(A)\mathfrak{B}\left(A\right), the set of all Hermitian matrices acting on AA by Herm(A)\mathrm{Herm}\left(A\right), and the set of all density matrices acting on system AA by 𝔇(A)\mathfrak{D}\left(A\right). Note that 𝔇(A)Herm(A)𝔅(A)\mathfrak{D}\left(A\right)\subset\mathrm{Herm}\left(A\right)\subset\mathfrak{B}\left(A\right). We use the calligraphic letters 𝒟\mathcal{D}, \mathcal{E}, \mathcal{F}, etc. to denote quantum channels, reserving 𝒱\mathcal{V} to represent an isometry map. The identity map on a system AA will be denoted by 𝗂𝖽A\mathsf{id}_{A}. The set of all linear maps from 𝔅(A)\mathfrak{B}\left(A\right) to 𝔅(B)\mathfrak{B}\left(B\right) is denoted by 𝔏(AB)\mathfrak{L}\left(A\to B\right), the set of all completely positive (CP) maps by CP(AB)\mathrm{CP}\left(A\to B\right), and the set of quantum channels by CPTP(AB)\mathrm{CPTP}\left(A\to B\right). Note that CPTP(AB)CP(AB)𝔏(AB)\mathrm{CPTP}\left(A\to B\right)\subset\mathrm{CP}\left(A\to B\right)\subset\mathfrak{L}\left(A\to B\right). Herm(AB)\mathrm{Herm}\left(A\to B\right) will denote the real vector space of all Hermitian-preserving maps in 𝔏(AB)\mathfrak{L}\left(A\to B\right). We will write 𝒩0\mathcal{N}\geq 0 to mean that the map 𝒩Herm(AB)\mathcal{N}\in\mathrm{Herm}\left(A\to B\right) is completely positive.

Since in this paper we focus on dynamical resources in the form of quantum channels, unless otherwise specified, it will be convenient to associate two subsystems A0A_{0} and A1A_{1} with every physical system AA, referring, respectively, to the input and output of the resource. Hence, any physical system will be comprised of two subsystems A=(A0,A1)A=\left(A_{0},A_{1}\right), even those representing a static resource, in which case we simply have |A0|=1\left|A_{0}\right|=1. For simplicity, we will denote a channel with a subscript AA, e.g. 𝒩A\mathcal{N}_{A}, to mean that it is an element of CPTP(A0A1)\mathrm{CPTP}\left(A_{0}\to A_{1}\right). Similarly, a bipartite channel in CPTP(A0B0A1B1)\mathrm{CPTP}\left(A_{0}B_{0}\to A_{1}B_{1}\right) will be denoted by 𝒩AB\mathcal{N}_{AB}. This notation makes the analogy with bipartite states more transparent.

In this setting, when we consider A=(A0,A1)A=\left(A_{0},A_{1}\right), B=(B0,B1)B=\left(B_{0},B_{1}\right), etc. comprised of input and output subsystems, the symbol 𝔏(AB)\mathfrak{L}\left(A\to B\right) refers to all linear maps from the vector space 𝔏(A0A1)\mathfrak{L}\left(A_{0}\to A_{1}\right) to the vector space 𝔏(B0B1)\mathfrak{L}\left(B_{0}\to B_{1}\right). Similarly, Herm(AB)𝔏(AB)\mathrm{Herm}\left(A\to B\right)\subset\mathfrak{L}\left(A\to B\right) is a real vector space consisting of all the linear maps that take elements in Herm(A0A1)\mathrm{Herm}\left(A_{0}\to A_{1}\right) to elements in Herm(B0B1)\mathrm{Herm}\left(B_{0}\to B_{1}\right). In other terms, maps in Herm(AB)\mathrm{Herm}\left(A\to B\right) take Hermitian-preserving maps to Hermitian-preserving maps. Linear maps in 𝔏(AB)\mathfrak{L}\left(A\to B\right) and Herm(AB)\mathrm{Herm}\left(A\to B\right) will be called supermaps, and will be denoted by capital Greek letters Θ\Theta, Υ\Upsilon, Ω\Omega, etc. The identity supermap in 𝔏(AA)\mathfrak{L}\left(A\to A\right) will be denoted by 𝟙A\mathbbm{1}_{A}.

We will use square brackets to denote the action of a supermap ΘAB𝔏(AB)\Theta_{A\to B}\in\mathfrak{L}\left(A\to B\right) on a linear map 𝒩A𝔏(A0A1)\mathcal{N}_{A}\in\mathfrak{L}\left(A_{0}\to A_{1}\right). For example, ΘAB[𝒩A]\Theta_{A\to B}\left[\mathcal{N}_{A}\right] is a linear map in 𝔏(B0B1)\mathfrak{L}\left(B_{0}\to B_{1}\right) obtained from the action of the supermap Θ\Theta on the map 𝒩\mathcal{N}. Moreover, for a simpler notation, the identity supermap will not appear explicitly in equations; e.g. ΘAB[𝒩RA]\Theta_{A\to B}\left[\mathcal{N}_{RA}\right] will mean (𝟙RΘAB)[𝒩RA]\left(\mathbbm{1}_{R}\otimes\Theta_{A\to B}\right)\left[\mathcal{N}_{RA}\right]. Instead, the action of linear map (e.g. quantum channel) 𝒩A𝔏(A0A1)\mathcal{N}_{A}\in\mathfrak{L}\left(A_{0}\to A_{1}\right) on a matrix ρ𝔅(A0)\rho\in\mathfrak{B}\left(A_{0}\right) is written with round brackets, i.e. 𝒩A(ρA0)𝔅(A1)\mathcal{N}_{A}\left(\rho_{A_{0}}\right)\in\mathfrak{B}\left(A_{1}\right).

Finally, we adopt the following convention concerning partial traces: when a system is missing, we take the partial trace over the missing system. This applies to matrices as well as to maps. For example, if MABM_{AB} is a matrix on A0A1B0B1A_{0}A_{1}B_{0}B_{1}, MAB0M_{AB_{0}} denotes the partial trace on the missing system B1B_{1}: MAB0:=TrB1[MAB]M_{AB_{0}}:=\mathrm{Tr}_{B_{1}}\left[M_{AB}\right].

II.2 Supermaps and superchannels

The space 𝔏(A0A1)\mathfrak{L}\left(A_{0}\to A_{1}\right) is equipped with an inner product given by

𝒩A,A:=i,j𝒩A(|ij|A0),A(|ij|A0)HS,\left\langle\mathcal{N}_{A},\mathcal{M}_{A}\right\rangle:=\sum_{i,j}\left\langle\mathcal{N}_{A}\left(\left|i\right\rangle\left\langle j\right|_{A_{0}}\right),\mathcal{M}_{A}\left(\left|i\right\rangle\left\langle j\right|_{A_{0}}\right)\right\rangle_{\mathrm{HS}}, (1)

where X,YHS:=tr[XY]\left\langle X,Y\right\rangle_{\mathrm{HS}}:=\mathrm{tr}\left[X^{\dagger}Y\right] is the Hilbert-Schmidt inner product between matrices X,Y𝔅(A1)X,Y\in\mathfrak{B}\left(A_{1}\right). The inner product above can be expressed in terms of the Choi matrices of 𝒩\mathcal{N} and \mathcal{M}. Denote by JA𝒩:=𝒩A~0A1(ϕA0A~0+)J_{A}^{\mathcal{N}}:=\mathcal{N}_{\widetilde{A}_{0}\to A_{1}}\left(\phi_{A_{0}\widetilde{A}_{0}}^{+}\right) the Choi matrix of 𝒩A\mathcal{N}_{A}, where ϕA0A~0+:=|ϕ+ϕ+|A0A~0\phi_{A_{0}\widetilde{A}_{0}}^{+}:=\left|\phi^{+}\right\rangle\left\langle\phi^{+}\right|_{A_{0}\widetilde{A}_{0}} and |ϕ+A0A~0=i|iiA0A~0\left|\phi^{+}\right\rangle_{A_{0}\widetilde{A}_{0}}=\sum_{i}\left|ii\right\rangle_{A_{0}\widetilde{A}_{0}} is the unnormalized maximally entangled state. With this notation, the inner product between 𝒩A\mathcal{N}_{A} and A\mathcal{M}_{A} can be expressed as [43]

𝒩A,A=JA𝒩,JAHS=tr[(JA𝒩)JA].\left\langle\mathcal{N}_{A},\mathcal{M}_{A}\right\rangle=\left\langle J_{A}^{\mathcal{N}},J_{A}^{\mathcal{M}}\right\rangle_{\mathrm{HS}}=\mathrm{tr}\left[\left(J_{A}^{\mathcal{N}}\right)^{\dagger}J_{A}^{\mathcal{M}}\right].

The canonical orthonormal basis (relative to the above inner product) is given by {Aijk}\left\{\mathcal{E}_{A}^{ijk\ell}\right\}, where

Aijk(ρA0):=i|ρA0|j|k|A1ρ𝔅(A0).\mathcal{E}_{A}^{ijk\ell}\left(\rho_{A_{0}}\right):=\left\langle i\middle|\rho_{A_{0}}\middle|j\right\rangle\left|k\right\rangle\left\langle\ell\right|_{A_{1}}\quad\forall\rho\in\mathfrak{B}\left(A_{0}\right).

The space 𝔏(AB)\mathfrak{L}\left(A\to B\right) with A=(A0,A1)A=\left(A_{0},A_{1}\right) and B=(B0,B1)B=\left(B_{0},B_{1}\right) is also equipped with the following inner product: given Θ,Ω𝔏(AB)\Theta,\Omega\in\mathfrak{L}(A\to B)

ΘAB,ΩAB:=i,j,k,ΘAB[Aijk],ΩAB[Aijk],\left\langle\Theta_{A\to B},\Omega_{A\to B}\right\rangle:=\sum_{i,j,k,\ell}\left\langle\Theta_{A\to B}\left[\mathcal{E}_{A}^{ijk\ell}\right],\Omega_{A\to B}\left[\mathcal{E}_{A}^{ijk\ell}\right]\right\rangle,

where the inner product on the right-hand side is the inner product between maps as defined in Eq. (1). Similarly to the inner product between maps, the inner product between supermaps can also be expressed in terms of Choi matrices. We define the Choi matrix of a supermap Θ𝔏(AB)\Theta\in\mathfrak{L}\left(A\to B\right) to be [43]

𝐉ABΘ:=i,j,k,JAijkJBΘ[Aijk].\mathbf{J}_{AB}^{\Theta}:=\sum_{i,j,k,\ell}J_{A}^{\mathcal{E}^{ijk\ell}}\otimes J_{B}^{\Theta\left[\mathcal{E}_{A}^{ijk\ell}\right]}.

Then, with this notation, the inner product between two supermaps Θ\Theta and Ω\Omega can be expressed as

ΘAB,ΩAB=𝐉ABΘ,𝐉ABΩHS=tr[(𝐉ABΘ)𝐉ABΩ].\left\langle\Theta_{A\to B},\Omega_{A\to B}\right\rangle=\left\langle\mathbf{J}_{AB}^{\Theta},\mathbf{J}_{AB}^{\Omega}\right\rangle_{\mathrm{HS}}=\mathrm{tr}\left[\left(\mathbf{J}_{AB}^{\Theta}\right)^{\dagger}\mathbf{J}_{AB}^{\Omega}\right].

The Choi matrix of a supermap Θ𝔏(AB)\Theta\in\mathfrak{L}\left(A\to B\right) can also be expressed in other three alternative ways [43]. First, from its definition, 𝐉ABΘ\mathbf{J}_{AB}^{\Theta} can be expressed as the Choi matrix of the map

𝒫ABΘ:=ΘA~B[ΦAA~+],\mathcal{P}_{AB}^{\Theta}:=\Theta_{\widetilde{A}\to B}\left[\Phi_{A\widetilde{A}}^{+}\right],

where the map ΦAA~+\Phi_{A\widetilde{A}}^{+} is defined as

ΦAA~+:=i,j,k,AijkA~ijk.\Phi_{A\widetilde{A}}^{+}:=\sum_{i,j,k,\ell}\mathcal{E}_{A}^{ijk\ell}\otimes\mathcal{E}_{\widetilde{A}}^{ijk\ell}.

A simple calculation shows that ΦAA~+\Phi_{A\widetilde{A}}^{+} is completely positive, and acts on ρ𝔅(A0A~0)\rho\in\mathfrak{B}\left(A_{0}\widetilde{A}_{0}\right) as

ΦAA~+(ρA0A~0)=tr[ρA0A~0ϕA0A~0+]ϕA1A~1+.\Phi_{A\widetilde{A}}^{+}\left(\rho_{A_{0}\widetilde{A}_{0}}\right)=\mathrm{tr}\left[\rho_{A_{0}\widetilde{A}_{0}}\phi_{A_{0}\widetilde{A}_{0}}^{+}\right]\phi_{A_{1}\widetilde{A}_{1}}^{+}.

In other terms, the CP map ΦAA~+\Phi_{A\widetilde{A}}^{+} can be viewed as a generalization of the (unnormalized) maximally entangled state ϕA0A~0+\phi_{A_{0}\widetilde{A}_{0}}^{+}.

A supermap Θ𝔏(AB)\Theta\in\mathfrak{L}\left(A\to B\right) can also be characterized by its action on Choi matrices. One can define a linear map Θ:𝔅(A)𝔅(B)\mathcal{R}^{\Theta}:\mathfrak{B}\left(A\right)\to\mathfrak{B}\left(B\right) as

ABΘ(ρA):=trA[𝐉ABΘ(ρATIB)]ρ𝔅(A).\mathcal{R}_{A\to B}^{\Theta}\left(\rho_{A}\right):=\mathrm{tr}_{A}\left[\mathbf{J}_{AB}^{\Theta}\left(\rho_{A}^{T}\otimes I_{B}\right)\right]\quad\forall\rho\in\mathfrak{B}\left(A\right).

With this definition, 𝐉ABΘ\mathbf{J}_{AB}^{\Theta} can be viewed as the Choi matrix of ABΘ\mathcal{R}_{A\to B}^{\Theta}. Note that although 𝒫ABΘ\mathcal{P}_{AB}^{\Theta} and ABΘ\mathcal{R}_{A\to B}^{\Theta} have the same Choi matrix 𝐉ABΘ\mathbf{J}_{AB}^{\Theta}, 𝒫ABΘ\mathcal{P}_{AB}^{\Theta} takes systems A0B0A_{0}B_{0} to A1B1A_{1}B_{1}, whereas the map Θ\mathcal{R}^{\Theta} takes system A=(A0,A1)A=\left(A_{0},A_{1}\right) to system B=(B0,B1)B=\left(B_{0},B_{1}\right). This brings us to the last representation of a supermap in terms of a linear map 𝒬Θ:𝔅(A1B0)𝔅(A0B1)\mathcal{Q}^{\Theta}:\mathfrak{B}\left(A_{1}B_{0}\right)\to\mathfrak{B}\left(A_{0}B_{1}\right), which is defined as the map satisfying

𝐉ABΘ:=𝒬A~1B~0A0B1Θ(ϕA1A~1+ϕB0B~0+),\mathbf{J}_{AB}^{\Theta}:=\mathcal{Q}_{\widetilde{A}_{1}\widetilde{B}_{0}\to A_{0}B_{1}}^{\Theta}\left(\phi_{A_{1}\widetilde{A}_{1}}^{+}\otimes\phi_{B_{0}\widetilde{B}_{0}}^{+}\right), (2)

or as 𝒬Θ:=𝟙AΘAB[𝒮A]\mathcal{Q}^{\Theta}:=\mathbbm{1}_{A}\otimes\Theta_{A\rightarrow B}\left[\mathcal{S}_{A}\right], where 𝒮A\mathcal{S}_{A} is the swap from A1A_{1} to A0A_{0}. All these three representations of a supermap, 𝒫Θ\mathcal{P}^{\Theta}, 𝒬Θ\mathcal{Q}^{\Theta}, and Θ\mathcal{R}^{\Theta}, play a useful role in the study of quantum resource theories, as shown in Ref. [74] in the case of the entanglement of bipartite channels.

A superchannel is a supermap ΘAB𝔏(AB)\Theta_{A\to B}\in\mathfrak{L}\left(A\to B\right) that takes quantum channels to quantum channels even when tensored with the identity supermap [35, 67, 66, 68, 69, 43, 70]. More precisely, ΘAB𝔏(AB)\Theta_{A\to B}\in\mathfrak{L}\left(A\to B\right) is called a superchannel if it satisfies the following two conditions:

  1. 1.

    For any trace-preserving map 𝒩A𝔏(A0A1)\mathcal{N}_{A}\in\mathfrak{L}\left(A_{0}\to A_{1}\right), the map ΘAB[𝒩A]\Theta_{A\to B}\left[\mathcal{N}_{A}\right] is a trace-preserving map in 𝔏(B0B1)\mathfrak{L}\left(B_{0}\to B_{1}\right).

  2. 2.

    For any system R=(R0,R1)R=\left(R_{0},R_{1}\right) and any bipartite CP map 𝒩RACP(R0A0R1A1)\mathcal{N}_{RA}\in\mathrm{CP}\left(R_{0}A_{0}\to R_{1}A_{1}\right), the map ΘAB[𝒩RA]\Theta_{A\to B}\left[\mathcal{N}_{RA}\right] is also CP.

We will also say that a supermap ΘAB𝔏(AB)\Theta_{A\to B}\in\mathfrak{L}\left(A\to B\right), is positive if it takes CP maps to CP maps, and completely positive (CP), if it satisfies the second condition above [35, 43]. Therefore, a superchannel is a CP supermap that takes trace-preserving maps to trace-preserving maps [43, 70]. We will denote the set of superchannels from AA to BB by 𝔖(AB)\mathfrak{S}\left(A\rightarrow B\right). Note that 𝔖(AB)𝔏(AB)\mathfrak{S}\left(A\rightarrow B\right)\subset\mathfrak{L}\left(A\rightarrow B\right).

The above definition is axiomatic and minimalist, in the sense that any physical evolution (or simulation) of a quantum channel must satisfy these two basic conditions. The third part of the following theorem shows that these two conditions are sufficient to ensure that superchannels are indeed physical processes.

Theorem 1 ([35, 43]).

Let Θ𝔏(AB)\Theta\in\mathfrak{L}\left(A\to B\right). The following are equivalent.

  1. 1.

    Θ\Theta is a superchannel.

  2. 2.

    The Choi matrix 𝐉ABΘ0\mathbf{J}_{AB}^{\Theta}\geq 0 of Θ\Theta has marginals

    𝐉A1B0Θ=IA1B0,𝐉AB0Θ=𝐉A0B0ΘuA1,\mathbf{J}_{A_{1}B_{0}}^{\Theta}=I_{A_{1}B_{0}},\qquad\mathbf{J}_{AB_{0}}^{\Theta}=\mathbf{J}_{A_{0}B_{0}}^{\Theta}\otimes u_{A_{1}}, (3)

    where uA1u_{A_{1}} is the maximally mixed state (i.e. the uniform state) on system A1A_{1}.

  3. 3.

    There exists a Hilbert space EE, with |E||A0B0|\left|E\right|\leq\left|A_{0}B_{0}\right|, and two CPTP maps CPTP(B0EA0)\mathcal{F}\in\mathrm{CPTP}\left(B_{0}\to EA_{0}\right) and CPTP(EA1B1)\mathcal{E}\in\mathrm{CPTP}\left(EA_{1}\to B_{1}\right) such that for all 𝒩A𝔏(A0A1)\mathcal{N}_{A}\in\mathfrak{L}\left(A_{0}\to A_{1}\right)

    Θ[𝒩A]=EA1B1𝒩A0A1B0EA0\Theta\left[\mathcal{N}_{A}\right]=\mathcal{E}_{EA_{1}\to B_{1}}\circ\mathcal{N}_{A_{0}\to A_{1}}\circ\mathcal{F}_{B_{0}\to EA_{0}} (4)

    (see Fig. 1).

    Refer to caption
    Figure 1: Realization of a superchannel in terms of a pre-processing channel \mathcal{F} and a post-processing channel \mathcal{E}.

    Furthermore, 𝒬A1B0A0B1Θ=EA1B1B0EA0CPTP(A1B0A0B1)\mathcal{Q}_{A_{1}B_{0}\to A_{0}B_{1}}^{\Theta}=\mathcal{E}_{EA_{1}\to B_{1}}\circ\mathcal{F}_{B_{0}\to EA_{0}}\in\mathrm{CPTP}\left(A_{1}B_{0}\to A_{0}B_{1}\right), and \mathcal{F} can be taken to be an isometry.

  4. 4.

    For every 𝒩CPTP(A0A1)\mathcal{N}\in\mathrm{CPTP}\left(A_{0}\to A_{1}\right), the matrix ABΘ(JA𝒩)\mathcal{R}_{A\to B}^{\Theta}\left(J_{A}^{\mathcal{N}}\right) is a Choi matrix of a quantum channel. That is,

    ABΘ(JA𝒩)0 and trB1[ABΘ(JA𝒩)]=IB0.\mathcal{R}_{A\to B}^{\Theta}\left(J_{A}^{\mathcal{N}}\right)\geq 0\text{ and }\mathrm{tr}_{B_{1}}\left[\mathcal{R}_{A\to B}^{\Theta}\left(J_{A}^{\mathcal{N}}\right)\right]=I_{B_{0}}.

In general, the realization of a superchannel as given in Fig. 1 is not unique. This is due to the presence of a memory system, described in Fig. 1 with the letter EE. To see why, consider an isometry channel 𝒱EE\mathcal{V}_{E\to E^{\prime}} defined for all ρ𝔅(E)\rho\in\mathfrak{B}\left(E\right) by 𝒱EE(ρ)=VρEV\mathcal{V}_{E\to E^{\prime}}\left(\rho\right)=V\rho_{E}V^{\dagger}, where V:EEV:E\to E^{\prime} is an isometry matrix satisfying VV=IEV^{\dagger}V=I_{E}. Then, this isometry channel has many left inverses given by

𝒱EE1(σE)=VσEV+tr[(IEVV)σE]τE,\mathcal{V}_{E^{\prime}\to E}^{-1}\left(\sigma_{E^{\prime}}\right)=V^{\dagger}\sigma_{E^{\prime}}V+\mathrm{tr}\left[\left(I_{E^{\prime}}-VV^{\dagger}\right)\sigma_{E^{\prime}}\right]\tau_{E},

where τ𝔇(E)\tau\in\mathfrak{D}\left(E\right) is an arbitrary fixed density matrix. We can easily check that 𝒱1𝒱=𝗂𝖽\mathcal{V}^{-1}\circ\mathcal{V}=\mathsf{id}. In Fig. 2 we use this map to show that the realization of a superchannel in terms of pre- and post-processing is not unique.

Refer to caption
Figure 2: The realization of a superchannel is not unique. The map 𝒱\mathcal{V} can be any linear map (not even a channel) for which there exists another linear map 𝒱1\mathcal{V}^{-1} such that 𝒱1𝒱=𝗂𝖽\mathcal{V}^{-1}\circ\mathcal{V}=\mathsf{id}. For example, if 𝒱\mathcal{V} is an isometry channel that is not unitary, there are many channels 𝒱1\mathcal{V}^{-1} that satisfy 𝒱1𝒱=𝗂𝖽\mathcal{V}^{-1}\circ\mathcal{V}=\mathsf{id}. Note that one can even take 𝒱=𝒱1=𝒯\mathcal{V}=\mathcal{V}^{-1}=\mathcal{T} to be the transpose map, in which case the resulting pre- and post-processing are not even necessarily CP!

Moreover, there is another way in which the realization of a superchannel can be non-unique, namely by appending a state in the pre-processing, and then discarding it in the post-processing. To see how this works, let B0EA0\mathcal{F}_{B_{0}\to EA_{0}} and EA1B1\mathcal{E}_{EA_{1}\to B_{1}} be the pre-processing and the post-processing in a realization of a superchannel Θ𝔖(AB)\Theta\in\mathfrak{S}\left(A\to B\right), respectively. Now consider the new pre-processing B0EEA0:=ρEB0EA0\mathcal{F}^{\prime}_{B_{0}\to E^{\prime}EA_{0}}:=\rho_{E^{\prime}}\otimes\mathcal{F}_{B_{0}\to EA_{0}}, where ρ𝔇(E)\rho\in\mathfrak{D}\left(E^{\prime}\right), and the new post-processing A1EEB1:=trEEA1B1\mathcal{E}_{A_{1}EE^{\prime}\to B_{1}}:=\mathrm{tr}_{E^{\prime}}\otimes\mathcal{E}_{EA_{1}\to B_{1}}. It is straightforward to check that \mathcal{F}^{\prime} and \mathcal{E}^{\prime} realize exactly the same superchannel Θ\Theta, as \mathcal{F} and \mathcal{E}.

Although the realization of a superchannel is not unique, if we restrict the dimension of system EE to be the smallest possible, and the map \mathcal{F} to be an isometry, we can obtain a new uniqueness result, expressed by the following theorem, which subsumes some of the results in Ref. [75].

Theorem 2 (Uniqueness).

Let Θ𝔖(AB)\Theta\in\mathfrak{S}\left(A\to B\right) be a superchannel, and let r:=Rank(𝐉A0B0Θ)r:=\mathrm{Rank}\left(\mathbf{J}_{A_{0}B_{0}}^{\Theta}\right). Then, there exists a system EE with |E|=r\left|E\right|=r, an isometry CPTP(B0EA0)\mathcal{F}\in\mathrm{CPTP}\left(B_{0}\to EA_{0}\right) and a channel CPTP(EA1B1)\mathcal{E}\in\mathrm{CPTP}\left(EA_{1}\to B_{1}\right) such that Θ\Theta can be realized as in Eq. (4). Furthermore, if there exists a system EE^{\prime} such that |E|r\left|E^{\prime}\right|\leq r, an isometry CPTP(B0EA0)\mathcal{F}^{\prime}\in\mathrm{CPTP}\left(B_{0}\to E^{\prime}A_{0}\right), and a channel CPTP(EA1B1)\mathcal{E}^{\prime}\in\mathrm{CPTP}\left(E^{\prime}A_{1}\to B_{1}\right) such that Θ\Theta can be realized as in Eq. (4) with \mathcal{F}^{\prime} and \mathcal{E}^{\prime} replacing \mathcal{E} and \mathcal{F}, then |E|=|E|\left|E^{\prime}\right|=\left|E\right|, and there exists a unitary channel 𝒰CPTP(EE)\mathcal{U}\in\mathrm{CPTP}\left(E\to E^{\prime}\right) such that

EA1B1=EA1B1𝒰EE1\mathcal{E}^{\prime}_{E^{\prime}A_{1}\to B_{1}}=\mathcal{E}_{EA_{1}\to B_{1}}\circ\mathcal{U}_{E^{\prime}\to E}^{-1}

and

B0EA0=𝒰EEB0EA0.\mathcal{F}^{\prime}_{B_{0}\to E^{\prime}A_{0}}=\mathcal{U}_{E\to E^{\prime}}\circ\mathcal{F}_{B_{0}\to EA_{0}}.
Proof.

The first part of the theorem follows from the proof of Theorem 1 as given in Ref. [43], in which system EE was chosen to be the purifying system of 𝐉A0B0Θ\mathbf{J}_{A_{0}B_{0}}^{\Theta} (see also Ref. [75]). Thus |E|\left|E\right| can always be taken to have dimension |E|=r\left|E\right|=r. We only need to prove the uniqueness part.

First note that by Theorem 1 we have that

𝒬A0B1A1B0Θ\displaystyle\mathcal{Q}_{A_{0}B_{1}\to A_{1}B_{0}}^{\Theta} =EA1B1B0EA0\displaystyle=\mathcal{E}^{\prime}_{E^{\prime}A_{1}\to B_{1}}\circ\mathcal{F}^{\prime}_{B_{0}\to E^{\prime}A_{0}}
=EA1B1B0EA0,\displaystyle=\mathcal{E}_{EA_{1}\to B_{1}}\circ\mathcal{F}_{B_{0}\to EA_{0}},

whose Choi matrix is 𝐉ABΘ\mathbf{J}_{AB}^{\Theta}. Therefore, recalling Eq. (2), the marginal𝐉A0B0Θ\mathbf{J}_{A_{0}B_{0}}^{\Theta} can be expressed as

𝐉A0B0Θ=|A1|B0A0(ϕB0B~0+)=|A1|B0A0(ϕB0B~0+).\mathbf{J}_{A_{0}B_{0}}^{\Theta}=\left|A_{1}\right|\mathcal{F}^{\prime}_{B_{0}\to A_{0}}\left(\phi_{B_{0}\widetilde{B}_{0}}^{+}\right)=\left|A_{1}\right|\mathcal{F}_{B_{0}\to A_{0}}\left(\phi_{B_{0}\widetilde{B}_{0}}^{+}\right).

Now, observe that |A1|B~0EA0(ϕB0B~0+)\left|A_{1}\right|\mathcal{F}^{\prime}_{\widetilde{B}_{0}\to E^{\prime}A_{0}}\left(\phi_{B_{0}\widetilde{B}_{0}}^{+}\right) is a purification of 𝐉A0B0Θ\mathbf{J}_{A_{0}B_{0}}^{\Theta} since by assumption B~0EA0\mathcal{F}^{\prime}_{\widetilde{B}_{0}\to E^{\prime}A_{0}} is an isometry (whence |A1|B~0EA0(ϕB0B~0+)\left|A_{1}\right|\mathcal{F}^{\prime}_{\widetilde{B}_{0}\to E^{\prime}A_{0}}\left(\phi_{B_{0}\widetilde{B}_{0}}^{+}\right) is a pure state). Therefore, |E|r\left|E^{\prime}\right|\geq r so that |E|=r=|E|\left|E^{\prime}\right|=r=\left|E\right|. Moreover, since |A1|B~0EA0(ϕB0B~0+)\left|A_{1}\right|\mathcal{F}^{\prime}_{\widetilde{B}_{0}\to E^{\prime}A_{0}}\left(\phi_{B_{0}\widetilde{B}_{0}}^{+}\right) and |A1|B~0EA0(ϕB0B~0+)\left|A_{1}\right|\mathcal{F}_{\widetilde{B}_{0}\to EA_{0}}\left(\phi_{B_{0}\widetilde{B}_{0}}^{+}\right) are two purifications of 𝐉A0B0Θ\mathbf{J}_{A_{0}B_{0}}^{\Theta}, they must be related by a unitary 𝒰EE\mathcal{U}_{E\to E^{\prime}}, so B0EA0=𝒰EEB0EA0\mathcal{F}^{\prime}_{B_{0}\to E^{\prime}A_{0}}=\mathcal{U}_{E\to E^{\prime}}\circ\mathcal{F}_{B_{0}\to EA_{0}}, as their Choi matrices are the same.

To conclude the proof, set ψEA0B0:=B~0EA0(ϕB0B~0+)\psi_{EA_{0}B_{0}}:=\mathcal{F}_{\widetilde{B}_{0}\to EA_{0}}\left(\phi_{B_{0}\widetilde{B}_{0}}^{+}\right). Recalling that 𝐉ABΘ\mathbf{J}_{AB}^{\Theta} is the Choi matrix of 𝒬Θ\mathcal{Q}^{\Theta}, we get

𝐉ABΘ\displaystyle\mathbf{J}_{AB}^{\Theta} =EA~1B1(ψEA0B0ϕA1A~1+)\displaystyle=\mathcal{E}_{E\widetilde{A}_{1}\to B_{1}}\left(\psi_{EA_{0}B_{0}}\otimes\phi_{A_{1}\widetilde{A}_{1}}^{+}\right)
=EA~1B1𝒰EE(ψEA0B0ϕA1A~1+).\displaystyle=\mathcal{E}^{\prime}_{E^{\prime}\widetilde{A}_{1}\to B_{1}}\circ\mathcal{U}_{E\to E^{\prime}}\left(\psi_{EA_{0}B_{0}}\otimes\phi_{A_{1}\widetilde{A}_{1}}^{+}\right). (5)

Let system E~\widetilde{E} be the support of ψA0B0\psi_{A_{0}B_{0}} (i.e. it is the Hilbert space spanned by the eigenvectors of ψA0B0\psi_{A_{0}B_{0}} that correspond to non-zero eigenvalues). Hence, |E~|=|E|=r\left|\widetilde{E}\right|=\left|E\right|=r. Denoting the restriction of ψEA0B0\psi_{EA_{0}B_{0}} to the space EE~E\widetilde{E} by ψEE~\psi_{E\widetilde{E}}, by Eq. (5) we have that

EA~1B1(ψEE~ϕA1A~1+)\displaystyle\mathcal{E}_{E\widetilde{A}_{1}\to B_{1}}\left(\psi_{E\widetilde{E}}\otimes\phi_{A_{1}\widetilde{A}_{1}}^{+}\right)
=EA~1B1𝒰EE(ψEE~ϕA1A~1+)\displaystyle=\mathcal{E}^{\prime}_{E^{\prime}\widetilde{A}_{1}\to B_{1}}\circ\mathcal{U}_{E\to E^{\prime}}\left(\psi_{E\widetilde{E}}\otimes\phi_{A_{1}\widetilde{A}_{1}}^{+}\right) (6)

By definition, the marginal ψE~\psi_{\widetilde{E}} is invertible, and we have ψEE~=(IEψE~UE~)ϕEE~+(IEUE~ψE~)\psi_{E\widetilde{E}}=\left(I_{E}\otimes\sqrt{\psi_{\widetilde{E}}}U_{\widetilde{E}}\right)\phi_{E\widetilde{E}}^{+}\left(I_{E}\otimes U_{\widetilde{E}}^{\dagger}\sqrt{\psi_{\widetilde{E}}}\right), where UE~U_{\widetilde{E}} is some unitary. Hence, by (Hermite-) conjugating both sides of Eq. (6) above by UE~ψE~12U_{\widetilde{E}}^{\dagger}\psi_{\widetilde{E}}^{-\frac{1}{2}}, we get that the Choi matrix of EA~1B1\mathcal{E}_{E\widetilde{A}_{1}\to B_{1}} equals the Choi matrix of EA~1B1𝒰EE\mathcal{E}^{\prime}_{E^{\prime}\widetilde{A}_{1}\to B_{1}}\circ\mathcal{U}_{E\to E^{\prime}}. Consequently we conclude that the channels must be the same. ∎

II.3 Measurements on quantum channels

A quantum instrument is a collection of CP maps {x}\left\{\mathcal{E}_{x}\right\} such that their sum xx\sum_{x}\mathcal{E}_{x} is a CPTP map. Note that each x\mathcal{E}^{x} is trace non-increasing, and that every CP map that is trace non-increasing can be completed to a full quantum instrument. Quantum instruments are used to characterize the most general measurements that can be performed on a physical system, including, as special cases, projective von Neumann measurements, POVMs, and generalized measurements. Therefore, we discuss the generalization of a quantum instrument to a collection of objects that act on quantum channels. We call this generalization a superinstrument [70].

A superinstrument is a collection of supermaps {Θx}\left\{\Theta_{x}\right\}, where each Θx𝔏(AB)\Theta_{x}\in\mathfrak{L}\left(A\to B\right) is CP (i.e. 𝐉ABΘx0\mathbf{J}_{AB}^{\Theta_{x}}\geq 0), and the sum xΘx\sum_{x}\Theta_{x} is a superchannel. Similar to the state domain, every Θx\Theta_{x} maps quantum channels to CP trace non-increasing maps. However, in the channel domain not every supermap Θ𝔏(AB)\Theta\in\mathfrak{L}\left(A\to B\right) with a positive semi-definite Choi matrix, and that takes channels to CP trace non-increasing maps, can be completed to a superchannel. In Ref. [70] a counterexample was given, and it was also shown that a CP supermap Θ𝔏(AB)\Theta\in\mathfrak{L}\left(A\to B\right) can be completed to a superchannel (i.e. there exists a CP supermap Ω𝔏(AB)\Omega\in\mathfrak{L}\left(A\to B\right) such that Θ+Ω\Theta+\Omega is a superchannel) if and only if for any system RR, the supermap 𝟙RΘ\mathbbm{1}_{R}\otimes\Theta takes quantum channels to CP trace non-increasing maps. In Ref. [70] it was shown that this phenomenon is associated with the existence of signaling bipartite channels.

While the above discussion is subtle, it demonstrates (see details in Ref. [70]) that every element Θx\Theta_{x} of a superinstrument {Θx}\left\{\Theta_{x}\right\} satisfies tr[𝐉AB0ΘxαAB0]1\mathrm{tr}\left[\mathbf{J}_{AB_{0}}^{\Theta_{x}}\alpha_{AB_{0}}\right]\leq 1 for every αAB00\alpha_{AB_{0}}\geq 0 such that αA0B0=IA0ρB0\alpha_{A_{0}B_{0}}=I_{A_{0}}\otimes\rho_{B_{0}}, where ρ𝔇(B0)\rho\in\mathfrak{D}\left(B_{0}\right). Moreover, every superinstrument can be realized as in Fig. 3, with an isometry pre-processing and a quantum instrument as the post-processing [35, 70].

Refer to caption
Figure 3: The realization of a superinstrument. The map \mathcal{F} can be taken to be an isometry and the post-processing is a quantum instrument.

Like quantum instruments, any superinstrument {Θx}\left\{\Theta_{x}\right\} in 𝔏(AB)\mathfrak{L}\left(A\to B\right) can be viewed as a superchannel Θ𝔏(ABX)\Theta\in\mathfrak{L}\left(A\to BX\right), where system X=(X0,X1)X=\left(X_{0},X_{1}\right) has trivial input dimension |X0|=1\left|X_{0}\right|=1, and the output system X1X_{1} is classical. Hence, a superinstrument can be expressed as

ΘABX=xΘABx|xx|X,\Theta_{A\to BX}=\sum_{x}\Theta_{A\to B}^{x}\otimes\left|x\right\rangle\left\langle x\right|_{X},

where XX1X\equiv X_{1}. This characterization of a superinstrument is particularly useful in the context of quantum resource theories, since the above relation demonstrates that the set of free superinstruments can be viewed as a subset of the set of free superchannels.

II.4 Quantum combs

Quantum combs are multipartite channels with a well-defined causal structure (see Fig. 4(a)) [76, 65, 66, 77, 78, 79].

Refer to caption
Figure 4: (a) A quantum comb that can be realized with nn channels. (b) The action of 𝒞n\mathscr{C}_{n} on nn channels 𝒩1,,𝒩n\mathcal{N}_{1},\dots,\mathcal{N}_{n}. Note that the input channels are causally ordered in the slots of the comb from left to right, i.e. from 𝒩1\mathcal{N}_{1} to 𝒩n\mathcal{N}_{n}.

They generalize the notion of superchannels to objects that take several channels as input, and output a channel (see Refs. [65, 66] for more details, and a for a further generalization where the input and the output of combs are combs themselves). A comb acting on nn channels is depicted in Fig. 4(b). We will denote a comb with nn channel-slots as input by 𝒞n\mathscr{C}_{n}, and its action on nn channels by 𝒞n[𝒩1,,𝒩n]\mathscr{C}_{n}\left[\mathcal{N}_{1},\dots,\mathcal{N}_{n}\right]. The causal relation between the different slots ensures that each such comb can be realized with n+1n+1 channels 1,,n+1\mathcal{E}_{1},\dots,\mathcal{E}_{n+1} as in Fig. 4(b). We therefore associate a quantum channel

𝒬𝒞n:=n+1n1\mathcal{Q}^{\mathscr{C}_{n}}:=\mathcal{E}_{n+1}\circ\mathcal{E}_{n}\circ\dots\circ\mathcal{E}_{1}

with every comb. Note that the quantum channel 𝒬𝒞n\mathcal{Q}^{\mathscr{C}_{n}} has a causal structure in the sense that the input to k\mathcal{E}_{k} cannot affect the output of k1\mathcal{E}_{k-1} for any k=2,,n+1k=2,\dots,n+1. The Choi matrix of the comb is defined as the Choi matrix of 𝒬𝒞n\mathcal{Q}^{\mathscr{C}_{n}}. Owing to the causal structure of 𝒬𝒞n\mathcal{Q}^{\mathscr{C}_{n}}, the marginals of the Choi matrix of 𝒞n\mathscr{C}_{n} satisfy similar relations to Eq. (3) (see Refs. [65, 66] for more details).

Note that there are other ways to manipulate multiple quantum channels where we do not require any causal structure on the different channel-slots [67, 80, 81], but we will not use them in our analysis.

II.5 Quantum resource theories

For every pair of physical systems AA and BB, consider a subset of CPTP maps 𝔉(AB)CPTP(AB)\mathfrak{F}\left(A\to B\right)\subset\mathrm{CPTP}\left(A\to B\right). 𝔉\mathfrak{F} identifies a quantum resource theory (QRT) if the following two conditions hold [14]:

  1. 1.

    For every physical system AA, the set 𝔉(AA)\mathfrak{F}\left(A\to A\right) contains the identity map 𝗂𝖽A\mathsf{id}_{A}.

  2. 2.

    For any three systems AA, BB, CC, if 𝔉(AB)\mathcal{M}\in\mathfrak{F}\left(A\to B\right) and 𝒩𝔉(BC)\mathcal{N}\in\mathfrak{F}\left(B\to C\right), then 𝒩𝔉(AC)\mathcal{N}\circ\mathcal{M}\in\mathfrak{F}\left(A\to C\right).

The elements in each set 𝔉(AB)\mathfrak{F}\left(A\to B\right) are called free operations. The set 𝔉(A):=𝔉(1A)\mathfrak{F}\left(A\right):=\mathfrak{F}\left(1\to A\right), where the 11 stands for the trivial (i.e. 1-dimensional) system, will be used to denote the set of free states.

In any QRT we can consider either static or dynamical inter-conversions. In a static inter-conversion we look for conditions under which a conversion from one resource state (i.e. not in 𝔉(A)\mathfrak{F}\left(A\right)) to another is possible by free operations. In a dynamical inter-conversion we are interested in the conditions under which a conversion from one resource channel (i.e. not in 𝔉(AB)\mathfrak{F}\left(A\to B\right)) to another is possible with free superchannels. Clearly, static inter-conversions can be viewed as a special type of dynamical ones.

In this article we will consider QRTs that admit a tensor product structure. That is, the set of free operations 𝔉\mathfrak{F} satisfies the following additional conditions:

  1. 3.

    Free operations are “completely free”: for any three physical systems AA, BB, and CC, if 𝔉(AB)\mathcal{M}\in\mathfrak{F}\left(A\to B\right) then 𝗂𝖽C𝔉(CACB)\mathsf{id}_{C}\otimes\mathcal{M}\in\mathfrak{F}\left(CA\to CB\right).

  2. 4.

    Discarding a system (i.e. the trace) is a free operation: for every system AA, the set 𝔉(A1)\mathfrak{F}\left(A\to 1\right) is not empty.

The above additional conditions are very natural, and satisfied by almost all QRTs studied in literature [14]. These conditions imply that if 1\mathcal{M}_{1} and 2\mathcal{M}_{2} are free channels, then also 12\mathcal{M}_{1}\otimes\mathcal{M}_{2} is free. In addition, they also imply that appending free states is a free operation; i.e. for any given free state σ𝔉(B)\sigma\in\mathfrak{F}\left(B\right), the CPTP map σ(ρ):=ρσ\mathcal{F}_{\sigma}\left(\rho\right):=\rho\otimes\sigma is a free map, i.e. it belongs to 𝔉(AAB)\mathfrak{F}\left(A\to AB\right). This in turn implies that the replacement map σ\mathcal{R}_{\sigma} is free, where σ(ρ)=tr[ρ]σ\mathcal{R}_{\sigma}\left(\rho\right)=\mathrm{tr}\left[\rho\right]\sigma, for every density matrix ρ\rho, and some fixed free state σ\sigma. In the following we will also assume that 𝔉(AB)\mathfrak{F}\left(A\to B\right) is topologically closed for all systems AA and BB, as it is natural to assume that arbitrarily good approximations of free operations are free as well.

III Resource theories of quantum processes

In this section we build resource theories of processes, and we present a new construction of a complete set of monotones for convex resource theories of processes. We also give the precise definition of several resource-theoretic protocols.

Similarly to resource theories of quantum states, free superchannels will be a subset of all physical superchannels. If we already have a QRT of static resources, theorem 1 gives us a sufficient condition for free superchannels: a superchannel is free if both the pre-processing and the post-processing are free in the underlying resource theory of states, i.e. if 𝔉(B0EA0)\mathcal{F}\in\mathfrak{F}\left(B_{0}\to EA_{0}\right) and 𝔉(EA1B1)\mathcal{E}\in\mathfrak{F}\left(EA_{1}\to B_{1}\right). We call these free superchannels “freely realizable”. Since we consider QRTs with a tensor product structure, if a superchannel Θ\Theta is free, then also its map

𝒬A1B0A0B1Θ:=EA1B1B0EA0\mathcal{Q}_{A_{1}B_{0}\to A_{0}B_{1}}^{\Theta}:=\mathcal{E}_{EA_{1}\to B_{1}}\circ\mathcal{F}_{B_{0}\to EA_{0}} (7)

is free: 𝒬A1B0A0B1Θ𝔉(A1B0A0B1)\mathcal{Q}_{A_{1}B_{0}\to A_{0}B_{1}}^{\Theta}\in\mathfrak{F}\left(A_{1}B_{0}\to A_{0}B_{1}\right). Recall that the mapping Θ𝒬A1B0A0B1Θ\Theta\mapsto\mathcal{Q}_{A_{1}B_{0}\to A_{0}B_{1}}^{\Theta} is a bijection, so that a free superchannel Θ\Theta corresponds to a unique free map 𝒬A1B0A0B1Θ\mathcal{Q}_{A_{1}B_{0}\to A_{0}B_{1}}^{\Theta}. However, if 𝒬A1B0A0B1Θ\mathcal{Q}_{A_{1}B_{0}\to A_{0}B_{1}}^{\Theta} is a free CPTP map, it does not necessarily mean that there exists a realization of Θ\Theta in terms of free pre- and post-processing: we only know that their combination is free.

The problem of determining whether a free channel 𝒬\mathcal{Q} can be decomposed as in Eq. (7) with both \mathcal{E} and \mathcal{F} being free can be very hard to solve, even when the resource theory is relatively simple (that is, even if inclusion in 𝔉\mathfrak{F} can be determined with an SDP; e.g. in NPT entanglement, see Ref. [59]). Therefore, typically, resource theories of quantum processes can be very hard to handle, even if the corresponding QRT of states is relatively simple. In Ref. [59], we announced that, for NPT dynamical entanglement, if we enlarge the set of free superchannels to include all superchannels for which 𝒬\mathcal{Q} is a PPT channel, we obtain a resource theory of NPT dynamical entanglement that is much more manageable. The price we pay is that not all such free superchannels may be freely realizable.

In view of this more relaxed definition of free superchannels, let us focus on the minimal requirements for free superchannels. For any two systems AA and BB, we denote by FREE(AB)\mathrm{FREE}\left(A\to B\right) the set of all free superchannels in 𝔖(AB)\mathfrak{S}\left(A\to B\right). The minimal requirements the set FREE\mathrm{FREE} must satisfy are the following (analogous to those satisfied by 𝔉\mathfrak{F}):

  1. 1.

    𝟙AFREE(AA)\mathbbm{1}_{A}\in\mathrm{FREE}\left(A\to A\right), where 𝟙A\mathbbm{1}_{A} is the identity supermap acting on 𝔏(AA)\mathfrak{L}\left(A\to A\right).

  2. 2.

    If Θ1FREE(AB)\Theta_{1}\in\mathrm{FREE}\left(A\to B\right) and Θ2FREE(BC)\Theta_{2}\in\mathrm{FREE}\left(B\to C\right), then Θ2Θ1FREE(AC)\Theta_{2}\circ\Theta_{1}\in\mathrm{FREE}\left(A\to C\right).

In particular, the second condition also implies that the superchannels in FREE\mathrm{FREE} are resource non-generating (RNG) [8, 14]. In other words, for every input channel A𝔉(A0A1)\mathcal{M}_{A}\in\mathfrak{F}\left(A_{0}\to A_{1}\right) and every free superchannel ΘFREE(AB)\Theta\in\mathrm{FREE}\left(A\to B\right), the output channel Θ[A]𝔉(B0B1)\Theta\left[\mathcal{M}_{A}\right]\in\mathfrak{F}\left(B_{0}\to B_{1}\right). Note that we can recover free channels by trivializing the input AA of a free superchannel ΘAB\Theta_{A\rightarrow B}, i.e. by taking A0A_{0} and A1A_{1} to be 1-dimensional.

Moreover, since we consider QRTs that admit a tensor product structure, we require free superchannels to be “completely free”: for any three physical systems A=(A0,A1)A=\left(A_{0},A_{1}\right), B=(B0,B1)B=\left(B_{0},B_{1}\right), and R=(R0,R1)R=\left(R_{0},R_{1}\right), if ΘFREE(AB)\Theta\in\mathrm{FREE}\left(A\to B\right), then 𝟙RΘFREE(RARB)\mathbbm{1}_{R}\otimes\Theta\in\mathrm{FREE}\left(RA\to RB\right).

Note that appending free channels is a free operation: it is the tensor product of the identity superchannel with a free channel. Therefore, for any given free channel B𝔉(B0B1)\mathcal{M}_{B}\in\mathfrak{F}\left(B_{0}\to B_{1}\right), the superchannel Θ[𝒩A]:=𝒩AB\Theta_{\mathcal{M}}\left[\mathcal{N}_{A}\right]:=\mathcal{N}_{A}\otimes\mathcal{M}_{B} is a free superchannel, i.e. it belongs to FREE(AAB)\mathrm{FREE}\left(A\to AB\right).

In some important resource theories, e.g. in entanglement theory [82, 83, 84, 85], the set of natural free operations can be hard to characterize mathematically [86, 87]. For this reason, it can be convenient to enlarge the set of free operations to work with a less complicated set. A standard enlargement is to consider all resource non-generating (RNG) superchannels [8, 14]:

RNG(AB)\displaystyle{\rm RNG}\left(A\to B\right)
:={Θ𝔖(AB):Θ[A]𝔉(B0B1)},\displaystyle:=\left\{\Theta\in\mathfrak{S}\left(A\to B\right):\Theta\left[\mathcal{M}_{A}\right]\in\mathfrak{F}\left(B_{0}\to B_{1}\right)\right\},

for all A𝔉(A0A1)\mathcal{M}_{A}\in\mathfrak{F}\left(A_{0}\to A_{1}\right). Similarly to the case of states, this is the set of superchannels that transform free channels into free channels. In this setting, since we require free superchannels to be completely free, RNG superchannels are also completely resource non-generating (CRNG) (in general, however, they are two distinct sets, with CRNGRNG\mathrm{CRNG}\subseteq\mathrm{RNG}): Θ\Theta is CRNG if and only if 𝟙RΘ\mathbbm{1}_{R}\otimes\Theta is RNG, for all systems R=(R0,R1)R=\left(R_{0},R_{1}\right). In Ref. [59] we consider PPT operations [88, 89] and separable operations [90] as extensions of the LOCC paradigm. Both of these sets are CRNG. Note that, however, a priori, there is no guarantee that CRNG superchannels are freely realizable in terms of CRNG channels in the underlying resource theory of states.

Dynamical resources are quantified by dynamical resource monotones.

Definition 3.

Let 𝔉\mathfrak{F} be a QRT admitting a tensor product structure. Let f:CPTPf:\mathrm{CPTP}\to\mathbb{R} be a function on the set of all channels in all dimensions. Then, ff is called a dynamical resource monotone if, for every channel 𝒩CPTP(A0A1)\mathcal{N}\in\mathrm{CPTP}\left(A_{0}\to A_{1}\right) and every superchannel ΘFREE(AB)\Theta\in\mathrm{FREE}\left(A\to B\right), f(Θ[𝒩A])f(𝒩A).f\left(\Theta\left[\mathcal{N}_{A}\right]\right)\leq f\left(\mathcal{N}_{A}\right).

It is customary, although not essential, to request that, for any system A0A_{0}, the value of ff on the identity channel 𝗂𝖽A0\mathsf{id}_{A_{0}} is zero; i.e. f(𝗂𝖽A0)=0f\left(\mathsf{id}_{A_{0}}\right)=0. This condition implies that ff is non-negative, and satisfies

f(𝒩A)=0𝒩𝔉(A0A1),f\left(\mathcal{N}_{A}\right)=0\quad\forall\mathcal{N}\in\mathfrak{F}\left(A_{0}\to A_{1}\right), (8)

for every system A=(A0,A1)A=\left(A_{0},A_{1}\right). The above property follows from a combination of the monotonicity property of ff with the fact that the replacement superchannel that takes any channel to a fixed free channel is itself a free superchannel, as it can be realized with free pre- and post-processing. Applying the replacement superchannel preparing 𝒩𝔉(A0A1)\mathcal{N}\in\mathfrak{F}\left(A_{0}\to A_{1}\right) to the identity superchannel, we get f(𝒩)f(𝗂𝖽A0)=0f\left(\mathcal{N}\right)\leq f\left(\mathsf{id}_{A_{0}}\right)=0. Applying the replacement superchannel preparing the identity channel to 𝒩\mathcal{N} instead yields f(𝒩)f(𝗂𝖽A0)=0f\left(\mathcal{N}\right)\geq f\left(\mathsf{id}_{A_{0}}\right)=0, whence Eq. (8) follows.

Examples of dynamical monotones that are given in terms of the relative entropy were discussed in Refs. [42, 38, 39, 40, 58]. One such example is defined in terms of the channel divergence [91, 92, 43]. Given two channels 𝒩,CPTP(A0A1)\mathcal{N},\mathcal{E}\in\mathrm{CPTP}\left(A_{0}\to A_{1}\right), the channel divergence is

D(𝒩AA):=supψRA0D(𝒩A(ψRA0)A(ψRA0))D\left(\mathcal{N}_{A}\middle\|\mathcal{E}_{A}\right):=\sup_{\psi_{RA_{0}}}D\left(\mathcal{N}_{A}\left(\psi_{RA_{0}}\right)\middle\|\mathcal{E}_{A}\left(\psi_{RA_{0}}\right)\right)

where D(ρσ):=tr[ρlogρ]tr[ρlogσ]D\left(\rho\middle\|\sigma\right):=\mathrm{tr}\left[\rho\log\rho\right]-\mathrm{tr}\left[\rho\log\sigma\right] is the relative entropy, RR is a reference system, and the supremum is over all |R|\left|R\right| and all density matrices ψRA0𝔇(RA0)\psi_{RA_{0}}\in\mathfrak{D}\left(RA_{0}\right). In Refs. [91, 92, 43] it was argued that the supremum can be replaced with a maximum, RR can be taken to have the same dimension as A0A_{0}, and ψRA0\psi_{RA_{0}} can be taken to be pure. The relative entropy of a dynamical resource 𝒩CPTP(A0A1)\mathcal{N}\in\mathrm{CPTP}\left(A_{0}\to A_{1}\right) is defined as

D𝔉(𝒩A):=min𝔉(A0A1)D(𝒩AA).D_{\mathfrak{F}}\left(\mathcal{N}_{A}\right):=\min_{\mathcal{E}\in\mathfrak{F}\left(A_{0}\to A_{1}\right)}D\left(\mathcal{N}_{A}\middle\|\mathcal{E}_{A}\right).

There is also a way to elevate any static monotone into a dynamical monotone. Given a static monotone EE, define

E(𝒩A):=supσ𝔇(RA0)E(𝒩A(σRA0))E(σRA0),E\left(\mathcal{N}_{A}\right):=\sup_{\sigma\in\mathfrak{D}\left(RA_{0}\right)}E\left(\mathcal{N}_{A}\left(\sigma_{RA_{0}}\right)\right)-E\left(\sigma_{RA_{0}}\right),

for any 𝒩CPTP(A0A1)\mathcal{N}\in\mathrm{CPTP}\left(A_{0}\to A_{1}\right). Then, it can be shown that EE is non-increasing under CRNG superchannels [38, 39, 40]. This was called amortized extension in Ref. [40]. This definition captures the generating power of the channel 𝒩\mathcal{N}, understood as the maximum amount of static resource 𝒩\mathcal{N} can generate.

III.1 A complete family of dynamical monotones

The examples of dynamical monotones presented in the previous subsection are typically very hard to compute due to the optimizations involved. Here for the first time we introduce a family of dynamical resource montones for convex resource theories that in some cases (e.g. NPT entanglement, Ref. [59]) can be computed with SDPs. Furthermore, each member of the family is convex, and the family itself is complete, in the sense that the monotones provide both necessary and sufficient conditions for the conversion of a dynamical resource into another with free superchannels. In this sense, this family of monotones fully captures the resourcefulness of a dynamical resource.

An example of a complete family of static resource monotones is known for pure-state entanglement theory [93, 94, 95]. There, the family of entanglement monotones is given in terms of Ky-Fan norms, and due to Nielsen majorization theorem [93], this family provides both necessary and sufficient conditions for the convertibility of pure bipartite states. The fact that the family consists of a finite number of monotones makes it easy to determine the convertibility of bipartite pure states under LOCC. However, for mixed states it is known that, already in local dimension 4, a finite number of monotones is insufficient to fully determine the exact interconversions between bipartite mixed states [96]. Therefore, in general, one cannot expect to find a finite and complete family for a generic QRT.

Theorem 4.

Let FREE(AB)\mathrm{FREE}\left(A\to B\right) be as above, such that for every two systems A=(A0,A1)A=\left(A_{0},A_{1}\right) and B=(B0,B1)B=\left(B_{0},B_{1}\right), the set FREE(AB)\mathrm{FREE}\left(A\to B\right) is convex and topologically closed. For any quantum channel 𝒫BCPTP(B0B1)\mathcal{P}_{B}\in\mathrm{CPTP}\left(B_{0}\to B_{1}\right) define

f𝒫(𝒩A):=maxΘFREE(AB)𝒫B,Θ[𝒩A],f_{\mathcal{P}}\left(\mathcal{N}_{A}\right):=\max_{\Theta\in\mathrm{FREE}\left(A\to B\right)}\left\langle\mathcal{P}_{B},\Theta\left[\mathcal{N}_{A}\right]\right\rangle,

for every 𝒩ACPTP(A0A1)\mathcal{N}_{A}\in\mathrm{CPTP}\left(A_{0}\to A_{1}\right). Let 𝒩ACPTP(A0A1)\mathcal{N}_{A}\in\mathrm{CPTP}\left(A_{0}\to A_{1}\right) and BCPTP(B0B1)\mathcal{M}_{B}\in\mathrm{CPTP}\left(B_{0}\to B_{1}\right) be two quantum channels. Then, B=ΘAB[𝒩A]\mathcal{M}_{B}=\Theta_{A\to B}\left[\mathcal{N}_{A}\right], for some superchannel ΘFREE(AB)\Theta\in\mathrm{FREE}\left(A\to B\right) if and only if

f𝒫(𝒩A)f𝒫(B)𝒫CPTP(B0B1).f_{\mathcal{P}}\left(\mathcal{N}_{A}\right)\geq f_{\mathcal{P}}\left(\mathcal{M}_{B}\right)\quad\forall\mathcal{P}\in\mathrm{CPTP}\left(B_{0}\to B_{1}\right).
Proof.

Denote

𝒩:={Θ[𝒩]:ΘFREE(AB)}.\mathfrak{C}_{\mathcal{N}}:=\left\{\Theta\left[\mathcal{N}\right]:\Theta\in\mathrm{FREE}\left(A\to B\right)\right\}.

Since we assume that FREE\mathrm{FREE} is convex and closed, so is 𝒩\mathfrak{C}_{\mathcal{N}}. Therefore, by the supporting hyperplane theorem, B𝒩\mathcal{M}_{B}\not\in\mathfrak{C}_{\mathcal{N}} if and only if there exists a Hermitian-preserving map 𝒫BHerm(B0B1)\mathcal{P}_{B}\in\mathrm{Herm}\left(B_{0}\to B_{1}\right) such that

𝒫B,B>maxΘFREE(AB)𝒫B,Θ[𝒩A].\left\langle\mathcal{P}_{B},\mathcal{M}_{B}\right\rangle>\max_{\Theta\in\mathrm{FREE}\left(A\to B\right)}\left\langle\mathcal{P}_{B},\Theta\left[\mathcal{N}_{A}\right]\right\rangle.

Alternatively, B𝒩\mathcal{M}_{B}\in\mathfrak{C}_{\mathcal{N}} if and only if for all Hermitian-preserving maps 𝒫BHerm(B0B1)\mathcal{P}_{B}\in\mathrm{Herm}\left(B_{0}\to B_{1}\right)

𝒫B,BmaxΘFREE(AB)𝒫B,Θ[𝒩A].\left\langle\mathcal{P}_{B},\mathcal{M}_{B}\right\rangle\leq\max_{\Theta\in\mathrm{FREE}\left(A\to B\right)}\left\langle\mathcal{P}_{B},\Theta\left[\mathcal{N}_{A}\right]\right\rangle. (9)

First we show that the above inequality holds for all Hermitian-preserving maps 𝒫Herm(B0B1)\mathcal{P}\in\mathrm{Herm}\left(B_{0}\to B_{1}\right) if and only if

f𝒫(B)=\displaystyle f_{\mathcal{P}}\left(\mathcal{M}_{B}\right)= maxΘFREE(BB)𝒫B,Θ[B]\displaystyle\max_{\Theta^{\prime}\in\mathrm{FREE}\left(B\to B\right)}\left\langle\mathcal{P}_{B},\Theta^{\prime}\left[\mathcal{M}_{B}\right]\right\rangle
maxΘFREE(AB)𝒫B,Θ[𝒩A]\displaystyle\leq\max_{\Theta\in\mathrm{FREE}\left(A\to B\right)}\left\langle\mathcal{P}_{B},\Theta\left[\mathcal{N}_{A}\right]\right\rangle
=f𝒫(𝒩A)\displaystyle=f_{\mathcal{P}}\left(\mathcal{N}_{A}\right) (10)

for all Hermitian-preserving 𝒫BHerm(B0B1)\mathcal{P}_{B}\in\mathrm{Herm}\left(B_{0}\to B_{1}\right). Indeed, if Eq. (10) holds, then take Θ\Theta^{\prime} to be the identity superchannel 𝟙B\mathbbm{1}_{B}; thus we immediately get Eq. (9) because

𝒫B,B\displaystyle\left\langle\mathcal{P}_{B},\mathcal{M}_{B}\right\rangle maxΘFREE(BB)𝒫B,Θ[B]\displaystyle\leq\max_{\Theta^{\prime}\in\mathrm{FREE}\left(B\to B\right)}\left\langle\mathcal{P}_{B},\Theta^{\prime}\left[\mathcal{M}_{B}\right]\right\rangle
maxΘFREE(AB)𝒫B,Θ[𝒩A].\displaystyle\leq\max_{\Theta\in\mathrm{FREE}\left(A\to B\right)}\left\langle\mathcal{P}_{B},\Theta\left[\mathcal{N}_{A}\right]\right\rangle.

Conversely, suppose Eq. (9) holds. Then, for any ΘFREE(BB)\Theta^{\prime}\in\mathrm{FREE}\left(B\to B\right) we have

𝒫B,Θ[B]\displaystyle\left\langle\mathcal{P}_{B},\Theta^{\prime}\left[\mathcal{M}_{B}\right]\right\rangle =Θ[𝒫B],B\displaystyle=\left\langle\Theta^{\prime*}\left[\mathcal{P}_{B}\right],\mathcal{M}_{B}\right\rangle
maxΘFREE(AB)Θ[𝒫B],Θ[𝒩A]\displaystyle\leq\max_{\Theta\in\mathrm{FREE}\left(A\to B\right)}\left\langle\Theta^{\prime*}\left[\mathcal{P}_{B}\right],\Theta\left[\mathcal{N}_{A}\right]\right\rangle
=maxΘFREE(AB)𝒫B,(ΘΘ)[𝒩A]\displaystyle=\max_{\Theta\in\mathrm{FREE}\left(A\to B\right)}\left\langle\mathcal{P}_{B},\left(\Theta^{\prime}\circ\Theta\right)\left[\mathcal{N}_{A}\right]\right\rangle
maxΘFREE(AB)𝒫B,Θ[𝒩A],\displaystyle\leq\max_{\Theta\in\mathrm{FREE}\left(A\to B\right)}\left\langle\mathcal{P}_{B},\Theta\left[\mathcal{N}_{A}\right]\right\rangle,

where the first inequality follows from assuming Eq. (9), and the last inequality from the property that if Θ\Theta and Θ\Theta^{\prime} are both free, then ΘΘ\Theta^{\prime}\circ\Theta is also free. Eq. (10) immediately holds.

It is left to show that it is sufficient to take 𝒫B\mathcal{P}_{B} to be a CPTP map. To this end, it will be convenient to express the inner products in terms of the Choi matrices. Now, for any Hermitian-preserving map 𝒫B\mathcal{P}_{B}, consider a CPTP map 𝒫~B\widetilde{\mathcal{P}}_{B} whose Choi matrix is

JB𝒫~:=(1ε)IB0uB1+ε(JB𝒫+(IB0JB0𝒫)uB1),J_{B}^{\widetilde{\mathcal{P}}}:=\left(1-\varepsilon\right)I_{B_{0}}\otimes u_{B_{1}}+\varepsilon\left(J_{B}^{\mathcal{P}}+\left(I_{B_{0}}-J_{B_{0}}^{\mathcal{P}}\right)\otimes u_{B_{1}}\right),

where ε>0\varepsilon>0 is small enough so that JB𝒫~0J_{B}^{\widetilde{\mathcal{P}}}\geq 0. Note also that JB0𝒫~=IB0J_{B_{0}}^{\widetilde{\mathcal{P}}}=I_{B_{0}} so that 𝒫~B\widetilde{\mathcal{P}}_{B} is a quantum channel. Now, a key observation is that, for any quantum channel 𝒩B\mathcal{N}_{B}, we get

𝒫~B,B=tr[JB𝒫~JB]\displaystyle\left\langle\widetilde{\mathcal{P}}_{B},\mathcal{M}_{B}\right\rangle=\mathrm{tr}\left[J_{B}^{\widetilde{\mathcal{P}}}J_{B}^{\mathcal{M}}\right]
=(1ε)|B0||B1|+εtr[JB𝒫JB]+ε|B0||B1|ε1|B1|tr[JB𝒫].\displaystyle=\left(1-\varepsilon\right)\frac{\left|B_{0}\right|}{\left|B_{1}\right|}+\varepsilon\mathrm{tr}\left[J_{B}^{\mathcal{P}}J_{B}^{\mathcal{M}}\right]+\varepsilon\frac{\left|B_{0}\right|}{\left|B_{1}\right|}-\varepsilon\frac{1}{\left|B_{1}\right|}\mathrm{tr}\left[J_{B}^{\mathcal{P}}\right].

Hence

𝒫~B,B=ε𝒫B,B+c𝒫,\left\langle\widetilde{\mathcal{P}}_{B},\mathcal{M}_{B}\right\rangle=\varepsilon\left\langle\mathcal{P}_{B},\mathcal{M}_{B}\right\rangle+c^{\mathcal{P}},

where

c𝒫:=1|B1|(|B0|εtr[JB𝒫])c^{\mathcal{P}}:=\frac{1}{\left|B_{1}\right|}\left(\left|B_{0}\right|-\varepsilon\mathrm{tr}\left[J_{B}^{\mathcal{P}}\right]\right)

is a constant depending only on 𝒫B\mathcal{P}_{B}. Therefore, Eqs. (9) and (10) hold for 𝒫B\mathcal{P}_{B} if and only if they hold for 𝒫~B\widetilde{\mathcal{P}}_{B}. In other words, it is sufficient to consider CPTP maps 𝒫B\mathcal{P}_{B}. ∎

Remark 5.

The definition of the functions f𝒫f_{\mathcal{P}} makes them convex.

Remark 6.

Similar families of monotones have been given recently in Refs. [11, 97, 98, 43, 99] for static resource theories, and in Ref. [26] in the context of channel discrimination tasks (see also the related discussion in Ref. [16]). The monotones constructed in theorem 4 can be reduced to all the ones introduced in Ref. [11, 97, 98, 43, 99, 26, 16], when restricting some of the input/output subsystems to be trivial or classical.

The functions f𝒫f_{\mathcal{P}} behave monotonically under free superchannels, therefore also under superchannels that replace any input channel with a fixed free channel. This in turn implies that, for every 𝒫\mathcal{P}, f𝒫f_{\mathcal{P}} take the same value on all free channels 𝒩𝔉(A0A1)\mathcal{N}\in\mathfrak{F}\left(A_{0}\to A_{1}\right): if 𝒩𝔉(A0A1)\mathcal{N}\in\mathfrak{F}\left(A_{0}\to A_{1}\right) we have

f𝒫(𝒩A)\displaystyle f_{\mathcal{P}}\left(\mathcal{N}_{A}\right) =maxΘFREE(AB)𝒫B,Θ[𝒩A]\displaystyle=\max_{\Theta\in\mathrm{FREE}\left(A\to B\right)}\left\langle\mathcal{P}_{B},\Theta\left[\mathcal{N}_{A}\right]\right\rangle
=max𝔉(B0B1)𝒫B,B\displaystyle=\max_{\mathcal{M}\in\mathfrak{F}\left(B_{0}\to B_{1}\right)}\left\langle\mathcal{P}_{B},\mathcal{M}_{B}\right\rangle
g(𝒫B).\displaystyle\equiv g\left(\mathcal{P}_{B}\right).

Therefore, if we want monotones that vanish on free channels, for any 𝒫CPTP(B0B1)\mathcal{P}\in\mathrm{CPTP}\left(B_{0}\to B_{1}\right), define

G𝒫(𝒩A):=f𝒫(𝒩A)g(𝒫B).G_{\mathcal{P}}\left(\mathcal{N}_{A}\right):=f_{\mathcal{P}}\left(\mathcal{N}_{A}\right)-g\left(\mathcal{P}_{B}\right).

In this way, {G𝒫}\left\{G_{\mathcal{P}}\right\} is a complete set of non-negative resource monotones that vanish on free channels.

The way f𝒫f_{\mathcal{P}} were constructed means that they can be expressed in terms of resource witnesses. To see why, denote the set of (free) Choi matrices by

𝔍AB:={𝐉ABΘ:ΘFREE(AB)}.\mathfrak{J}_{AB}:=\left\{\mathbf{J}_{AB}^{\Theta}:\Theta\in\mathrm{FREE}\left(A\to B\right)\right\}. (11)

Since FREE(AB)\mathrm{FREE}\left(A\to B\right) is closed and convex, so is 𝔍AB\mathfrak{J}_{AB}. The monotones f𝒫f_{\mathcal{P}} can be expressed as

f𝒫(𝒩A)\displaystyle f_{\mathcal{P}}\left(\mathcal{N}_{A}\right) =maxΘFREE(AB)𝒫B,Θ[𝒩A]\displaystyle=\max_{\Theta\in\mathrm{FREE}\left(A\to B\right)}\left\langle\mathcal{P}_{B},\Theta\left[\mathcal{N}_{A}\right]\right\rangle
=maxΘFREE(AB)tr[JB𝒫JBΘ[𝒩A]]\displaystyle=\max_{\Theta\in\mathrm{FREE}\left(A\to B\right)}\mathrm{tr}\left[J_{B}^{\mathcal{P}}J_{B}^{\Theta\left[\mathcal{N}_{A}\right]}\right]
=maxΘFREE(AB)tr[𝐉ABΘ((JA𝒩)TJB𝒫)]\displaystyle=\max_{\Theta\in\mathrm{FREE}\left(A\to B\right)}\mathrm{tr}\left[\mathbf{J}_{AB}^{\Theta}\left(\left(J_{A}^{\mathcal{N}}\right)^{T}\otimes J_{B}^{\mathcal{P}}\right)\right]
=max𝐉AB𝔍ABtr[𝐉AB((JA𝒩)TJB𝒫)].\displaystyle=\max_{\mathbf{J}_{AB}\in\mathfrak{J}_{AB}}\mathrm{tr}\left[\mathbf{J}_{AB}\left(\left(J_{A}^{\mathcal{N}}\right)^{T}\otimes J_{B}^{\mathcal{P}}\right)\right].

In other terms, f𝒫(𝒩A)f_{\mathcal{P}}\left(\mathcal{N}_{A}\right) is the support function of 𝔍AB\mathfrak{J}_{AB} evaluated at (JA𝒩)TJB𝒫\left(J_{A}^{\mathcal{N}}\right)^{T}\otimes J_{B}^{\mathcal{P}}. Let 𝔎\mathfrak{K} be the (convex) cone obtained from 𝔍AB\mathfrak{J}_{AB} by multiplying its elements by a non-negative number, i.e. 𝔎:=+𝔍AB\mathfrak{K}:=\mathbb{R}_{+}\mathfrak{J}_{AB}. With this definition we can write

f𝒫(𝒩A)=max𝐉AB𝔎tr[𝐉AB]=|A1B0|tr[𝐉AB((JA𝒩)TJB𝒫)].f_{\mathcal{P}}\left(\mathcal{N}_{A}\right)=\max_{\begin{subarray}{c}\mathbf{J}_{AB}\in\mathfrak{K}\\ \mathrm{tr}\left[\mathbf{J}_{AB}\right]=\left|A_{1}B_{0}\right|\end{subarray}}\mathrm{tr}\left[\mathbf{J}_{AB}\left(\left(J_{A}^{\mathcal{N}}\right)^{T}\otimes J_{B}^{\mathcal{P}}\right)\right].

The above optimization problem is a conic linear program. As such, using duality, f𝒫f_{\mathcal{P}} can be equivalently expressed as

f𝒫(𝒩A)=|A1B0|min{x:xIAB(JA𝒩)TJB𝒫𝔎},f_{\mathcal{P}}\left(\mathcal{N}_{A}\right)=\left|A_{1}B_{0}\right|\min\left\{x:xI_{AB}-\left(J_{A}^{\mathcal{N}}\right)^{T}\otimes J_{B}^{\mathcal{P}}\in\mathfrak{K}^{*}\right\},

where xx\in\mathbb{R} and 𝔎\mathfrak{K}^{*} is the dual cone

𝔎={WHerm(AB):tr[WM]0M𝔎}.\mathfrak{K}^{*}=\left\{W\in\mathrm{Herm}\left(AB\right):\mathrm{tr}\left[WM\right]\geq 0\quad\forall M\in\mathfrak{K}\right\}. (12)

Since the cone 𝔎\mathfrak{K} consists of only positive semi-definite matrices, it follows that any positive semi-definite matrix belongs to 𝔎\mathfrak{K}^{*}. Note also that we must have x>0x>0 in the equation above, otherwise M:=xIAB(JA𝒩)TJB𝒫<0M:=xI_{AB}-\left(J_{A}^{\mathcal{N}}\right)^{T}\otimes J_{B}^{\mathcal{P}}<0, and therefore MM would not belong to 𝔎\mathfrak{K}^{*}.

The cone 𝔎\mathfrak{K} is convex and closed. Therefore, as a consequence of the hyperplane separation theorem, 𝔎=𝔎\mathfrak{K}^{**}=\mathfrak{K}. This in particular implies that M𝔎M\in\mathfrak{K} if and only if tr[MW]0\mathrm{tr}\left[MW\right]\geq 0 for all W𝔎W\in\mathfrak{K}^{*}. Hence the Hermitian matrices (observables) in 𝔎\mathfrak{K}^{*} that are not positive semi-definite can be viewed as witnesses of supermaps that are not free. However, among them, some will only witness whether or not a matrix MM corresponds to a valid superchannel, while others will witness if it corresponds to a non-free superchannel.

III.2 Single-shot interconversions with conic linear programming

Here we consider single-shot interconversions between resources. For this purpose, following similar ideas to [100], we define the conversion distance for any two channels 𝒩A\mathcal{N}_{A} and B\mathcal{M}_{B} as

d𝔉(𝒩AB):=12minΘFREE(AB)ΘAB[𝒩A]B.d_{\mathfrak{F}}\left(\mathcal{N}_{A}\to\mathcal{M}_{B}\right):=\frac{1}{2}\min_{\Theta\in\mathrm{FREE}\left(A\to B\right)}\left\|\Theta_{A\to B}\left[\mathcal{N}_{A}\right]-\mathcal{M}_{B}\right\|_{\diamond}.

If d𝔉(𝒩AB)εd_{\mathfrak{F}}\left(\mathcal{N}_{A}\to\mathcal{M}_{B}\right)\leq\varepsilon, for some small ε>0\varepsilon>0, we will say that 𝒩A\mathcal{N}_{A} can be converted to B\mathcal{M}_{B} by free superchannels up to a small error ε\varepsilon. When ε=0\varepsilon=0, the conversion is exact.

Therefore, calculating the conversion distance between two channels becomes equivalent to determining if the former channel can be converted into the latter. As such, an important question is whether the conversion distance can be computed efficiently. First of all, recall that, as far as the diamond norm is concerned, the answer is positive, because it can be expressed as the SDP [101]

12BB=minωB0;ωBJBωB0,\frac{1}{2}\left\|\mathcal{E}_{B}-\mathcal{F}_{B}\right\|_{\diamond}=\min_{\omega_{B}\geq 0;\thinspace\omega_{B}\geq J_{B}^{\mathcal{E}-\mathcal{F}}}\left\|\omega_{B_{0}}\right\|_{\infty},

for all ,CPTP(B0B1)\mathcal{E},\mathcal{F}\in\mathrm{CPTP}\left(B_{0}\to B_{1}\right). Now, in Ref. [40], it was shown that it can be written also as

12BB=min{λ:λ𝒬BBB},\frac{1}{2}\left\|\mathcal{E}_{B}-\mathcal{F}_{B}\right\|_{\diamond}=\min\left\{\lambda:\lambda\mathcal{Q}_{B}\geq\mathcal{E}_{B}-\mathcal{F}_{B}\right\},

where 𝒬BCPTP(B0B1)\mathcal{Q}_{B}\in\mathrm{CPTP}\left(B_{0}\rightarrow B_{1}\right). Now take B:=ΘAB[𝒩A]\mathcal{E}_{B}:=\Theta_{A\to B}\left[\mathcal{N}_{A}\right] and B:=B\mathcal{F}_{B}:=\mathcal{M}_{B}; d𝔉(𝒩AB)d_{\mathfrak{F}}\left(\mathcal{N}_{A}\to\mathcal{M}_{B}\right) becomes

d𝔉(𝒩AB)=min{λ:λ𝒬BΘAB[𝒩A]B},d_{\mathfrak{F}}\left(\mathcal{N}_{A}\to\mathcal{M}_{B}\right)=\min\left\{\lambda:\lambda\mathcal{Q}_{B}\geq\Theta_{A\to B}\left[\mathcal{N}_{A}\right]-\mathcal{M}_{B}\right\}, (13)

where ΘFREE(AB)\Theta\in\mathrm{FREE}\left(A\to B\right) and 𝒬CPTP(B0B1)\mathcal{Q}\in\mathrm{CPTP}\left(B_{0}\to B_{1}\right). This can be phrased as a conic linear program, so it has a dual (see appendix A for details), by which d𝔉(𝒩AB)d_{\mathfrak{F}}\left(\mathcal{N}_{A}\to\mathcal{M}_{B}\right) can also be expressed as

d𝔉(𝒩AB)=max{t|A1B0|+tr[ζBJB]},d_{\mathfrak{F}}\left(\mathcal{N}_{A}\to\mathcal{M}_{B}\right)=\max\left\{t\left|A_{1}B_{0}\right|+\mathrm{tr}\left[\zeta_{B}J_{B}^{\mathcal{M}}\right]\right\}, (14)

subject to the constraints 0ζBηB0IB10\leq\zeta_{B}\leq\eta_{B_{0}}\otimes I_{B_{1}}, tr[ηB0]=1\mathrm{tr}\left[\eta_{B_{0}}\right]=1, and (JA𝒩)TζBtIAB𝔎\left(J_{A}^{\mathcal{N}}\right)^{T}\otimes\zeta_{B}-tI_{AB}\in\mathfrak{K}^{*}, where the cone 𝔎\mathfrak{K}^{*} is the dual of the cone generated by the Choi matrices of free superchannels (see Eq. (12)). If this cone has a simple characterization, as it happens e.g. in NPT entanglement [59], the problem of computing d𝔉(𝒩AB)d_{\mathfrak{F}}\left(\mathcal{N}_{A}\to\mathcal{M}_{B}\right) becomes solving an SDP. However, for LOCC entanglement, determining whether or not a superchannel is free is in general NP-hard [86, 87], and consequently, so is the computation of d𝔉(𝒩AB)d_{\mathfrak{F}}\left(\mathcal{N}_{A}\to\mathcal{M}_{B}\right).

In entanglement theory there is a maximally entangled state [32, 1], which, with high enough dimension, can be converted to all other static and dynamical resources by LOCC. An analogous situation also occurs, e.g. in the resource theories of coherence [6] and of purity [102], but, in general, not in all resource theories. Such a maximal resource is most desirable and, consequently, it is natural to consider the task of distilling a maximal resource (i.e. resource distillation) and the task of forming a resource from such a “golden” resource (i.e. resource cost) [10, 14, 16].

More precisely, let ΦB+\Phi_{B}^{+} be such a maximal resource on system BB, and fix ε>0\varepsilon>0. In the single-shot regime, the ε\varepsilon-resource cost of a channel 𝒩CPTP(A0A1)\mathcal{N}\in\mathrm{CPTP}\left(A_{0}\to A_{1}\right) is defined as

COST𝔉,ε(1)(𝒩A)\displaystyle\mathrm{COST}_{\mathfrak{F},\varepsilon}^{\left(1\right)}\left(\mathcal{N}_{A}\right)
:=log2min{|B|:d𝔉(ΦB+𝒩A)ε}\displaystyle:=\log_{2}\min\left\{\left|B\right|:d_{\mathfrak{F}}\left(\Phi_{B}^{+}\to\mathcal{N}_{A}\right)\leq\varepsilon\right\}
=log2min{|B|:ε𝒬AΘBA[ΦB+]𝒩A},\displaystyle=\log_{2}\min\left\{\left|B\right|:\varepsilon\mathcal{Q}_{A}\geq\Theta_{B\to A}\left[\Phi_{B}^{+}\right]-\mathcal{N}_{A}\right\}, (15)

where ΘFREE(BA)\Theta\in\mathrm{FREE}\left(B\to A\right) and 𝒬CPTP(A0A1)\mathcal{Q}\in\mathrm{CPTP}\left(A_{0}\to A_{1}\right). The second equality in Eq. (15) follows from Eq. (13). The ε\varepsilon-resource distillation of a channel 𝒩CPTP(A0A1)\mathcal{N}\in\mathrm{CPTP}\left(A_{0}\to A_{1}\right) is, instead, defined as

DISTILL𝔉,ε(1)(𝒩A)\displaystyle\mathrm{DISTILL}_{\mathfrak{F},\varepsilon}^{\left(1\right)}\left(\mathcal{N}_{A}\right)
:=log2max{|B|:d𝔉(𝒩AΦB+)ε}\displaystyle:=\log_{2}\max\left\{\left|B\right|:d_{\mathfrak{F}}\left(\mathcal{N}_{A}\to\Phi_{B}^{+}\right)\leq\varepsilon\right\}
=logmax{|B|:ε𝒬BΘAB[𝒩A]ΦB+},\displaystyle=\log\max\left\{\left|B\right|:\varepsilon\mathcal{Q}_{B}\geq\Theta_{A\to B}\left[\mathcal{N}_{A}\right]-\Phi_{B}^{+}\right\},

where, again, ΘFREE(AB)\Theta\in\mathrm{FREE}\left(A\to B\right), 𝒬CPTP(B0B1)\mathcal{Q}\in\mathrm{CPTP}\left(B_{0}\to B_{1}\right), and the second equality follows from Eq. (13).

III.3 Definitions of various rates in the asymptotic regime

In the asymptotic regime, we are interested in the asymptotic rates of converting one resource into another by means of the set of free superchannels. The asymptotic rate of conversion from a channel 𝒩CPTP(A0A1)\mathcal{N}\in\mathrm{CPTP}\left(A_{0}\to A_{1}\right) to a channel CPTP(B0B1)\mathcal{M}\in\mathrm{CPTP}\left(B_{0}\to B_{1}\right) is defined as

R𝔉(𝒩AB)\displaystyle R_{\mathfrak{F}}\left(\mathcal{N}_{A}\to\mathcal{M}_{B}\right)
:=limε0+inf{nm:d𝔉(𝒩AnBm)ε;m,n}.\displaystyle:=\lim_{\varepsilon\to 0^{+}}\inf\left\{\frac{n}{m}:d_{\mathfrak{F}}\left(\mathcal{N}_{A}^{\otimes n}\to\mathcal{M}_{B}^{\otimes m}\right)\leq\varepsilon;\,m,n\in\mathbb{N}\right\}.

If a maximal resource exists, we can also define the asymptotic resource cost and distillation (see also Ref. [38]) respectively as

COST𝔉(𝒩A):=limε0+lim infn1nCOST𝔉,ε(1)(𝒩An)\mathrm{COST}_{\mathfrak{F}}\left(\mathcal{N}_{A}\right):=\lim_{\varepsilon\to 0^{+}}\liminf_{n}\frac{1}{n}\mathrm{COST}_{\mathfrak{F},\varepsilon}^{\left(1\right)}\left(\mathcal{N}_{A}^{\otimes n}\right)

and

DISTILL𝔉(𝒩A):=limε0+lim supn1nDISTILL𝔉,ε(1)(𝒩An).\mathrm{DISTILL}_{\mathfrak{F}}\left(\mathcal{N}_{A}\right):=\lim_{\varepsilon\to 0^{+}}\limsup_{n}\frac{1}{n}\mathrm{DISTILL}_{\mathfrak{F},\varepsilon}^{\left(1\right)}\left(\mathcal{N}_{A}^{\otimes n}\right).

Finally, one can also define the exact resource cost and distillation respectively as

COST𝔉exact(𝒩A):=lim infn1nCOST𝔉,ε=0(1)(𝒩An)\mathrm{COST}_{\mathfrak{F}}^{{\rm exact}}\left(\mathcal{N}_{A}\right):=\liminf_{n}\frac{1}{n}\mathrm{COST}_{\mathfrak{F},\varepsilon=0}^{\left(1\right)}\left(\mathcal{N}_{A}^{\otimes n}\right)

and

DISTILL𝔉exact(𝒩A):=lim supn1nDISTILL𝔉,ε=0(1)(𝒩An).\mathrm{DISTILL}_{\mathfrak{F}}^{{\rm exact}}\left(\mathcal{N}_{A}\right):=\limsup_{n}\frac{1}{n}\mathrm{DISTILL}_{\mathfrak{F},\varepsilon=0}^{\left(1\right)}\left(\mathcal{N}_{A}^{\otimes n}\right).

All the quantities above are typically very hard to compute. These definitions mirror the analogous ones in resource theories of states [7, 10, 23, 14, 17], in which nn copies of a resource 𝒩\mathcal{N} are given in parallel, and therefore they are described by the tensor product 𝒩n\mathcal{N}^{\otimes n}. This is the only possibility for multiple static resources, which can only be composed in parallel, i.e. with tensor product.

However, with dynamical resources, the time in which they are applied starts playing a role. This is because dynamical resources have a natural temporal ordering between input and output, and therefore they can also be composed in non-parallel ways, e.g. in sequence. Therefore when manipulating dynamical resources, it is not enough to specify the CPTP maps involved but also when (and how) they can be used (see also Ref. [39]). This opens up the possibility of using adaptive schemes when we have several dynamical resources [71, 72, 42, 73, 47, 58, 59]. For example, if we have nn resources 𝒩1,,𝒩n\mathcal{N}_{1},\dots,\mathcal{N}_{n} that are available, respectively, at times t1t2tnt_{1}\leq t_{2}\leq\dots\leq t_{n}, then the most general channel that can be simulated by free operations using these resources is depicted in Fig. 4, where the channels 1,,n+1\mathcal{E}_{1},\dots,\mathcal{E}_{n+1} are all free. We use the notation 𝒞n[𝒩1,,𝒩n]\mathscr{C}_{n}\left[\mathcal{N}_{1},\dots,\mathcal{N}_{n}\right] to describe the resulting channel, and 𝒞n[𝒩n]:=𝒞n[𝒩,,𝒩]\mathscr{C}_{n}\left[\mathcal{N}^{n}\right]:=\mathscr{C}_{n}\left[\mathcal{N},\dots,\mathcal{N}\right] when all the resources 𝒩1,,𝒩n\mathcal{N}_{1},\dots,\mathcal{N}_{n} are the same, and equal to 𝒩\mathcal{N}. Note that this scheme includes the two cases in which the nn resources are composed in parallel (i.e. 𝒩1𝒩n\mathcal{N}_{1}\otimes\dots\otimes\mathcal{N}_{n}) and in sequence (i.e. 𝒩n𝒩1\mathcal{N}_{n}\circ\dots\circ\mathcal{N}_{1}).

Remark 7.

Note that, since the nn slots of a quantum comb are causally ordered [65, 66, 67], it is important to know the order in which the resources are inserted. If the nn channels 𝒩1,,𝒩n\mathcal{N}_{1},\dots,\mathcal{N}_{n} are all available at the initial time, and we do not know which to plug first into the comb, then we must pick a particular ordering of them. More formally, we need to pick a permutation πSn\pi\in S_{n} that fixes the causal ordering between the nn resources, whereby their most general manipulation is 𝒞n[𝒩π(1),,𝒩π(n)]\mathscr{C}_{n}\left[\mathcal{N}_{\pi\left(1\right)},\dots,\mathcal{N}_{\pi\left(n\right)}\right].

With this in mind, when a maximal resource exists, we define the single-shot adaptive ε\varepsilon-resource cost of a channel 𝒩CPTP(A0A1)\mathcal{N}\in\mathrm{CPTP}\left(A_{0}\to A_{1}\right) as

COST𝔉,ε(n),Ad(𝒩A)\displaystyle\mathrm{COST}_{\mathfrak{F},\varepsilon}^{\left(n\right),{\rm Ad}}\left(\mathcal{N}_{A}\right)
:=logmin{|B|n:d𝔉(𝒞n[ΦB+n]𝒩A)ε}.\displaystyle:=\log\min\left\{\left|B\right|^{n}:d_{\mathfrak{F}}\left(\mathscr{C}_{n}\left[\Phi_{B}^{+n}\right]\to\mathcal{N}_{A}\right)\leq\varepsilon\right\}.

The single-shot adaptive ε\varepsilon-resource distillation of a channel 𝒩CPTP(A0A1)\mathcal{N}\in\mathrm{CPTP}\left(A_{0}\to A_{1}\right) is, instead, defined as

DISTILL𝔉,ε(n),Ad(𝒩A)\displaystyle\mathrm{DISTILL}_{\mathfrak{F},\varepsilon}^{\left(n\right),{\rm Ad}}\left(\mathcal{N}_{A}\right)
:=logmax{|B|:d𝔉(𝒞n[𝒩An]ΦB+)ε}.\displaystyle:=\log\max\left\{\left|B\right|:d_{\mathfrak{F}}\left(\mathscr{C}_{n}\left[\mathcal{N}_{A}^{n}\right]\to\Phi_{B}^{+}\right)\leq\varepsilon\right\}.

The asymptotic adaptive rate of conversion from a channel 𝒩CPTP(A0A1)\mathcal{N}\in\mathrm{CPTP}\left(A_{0}\to A_{1}\right) to a channel CPTP(B0B1)\mathcal{M}\in\mathrm{CPTP}\left(B_{0}\to B_{1}\right) by free operations is given by

R𝔉Ad(𝒩AB)\displaystyle R_{\mathfrak{F}}^{{\rm Ad}}\left(\mathcal{N}_{A}\to\mathcal{M}_{B}\right)
:=limε0+inf{nm:d𝔉(𝒞n[𝒩n]Bm)ε;m,n}.\displaystyle:=\lim_{\varepsilon\to 0^{+}}\inf\left\{\frac{n}{m}:d_{\mathfrak{F}}\left(\mathscr{C}_{n}\left[\mathcal{N}^{n}\right]\to\mathcal{M}_{B}^{m}\right)\leq\varepsilon;\thinspace m,n\in\mathbb{N}\right\}.

Here by Bm\mathcal{M}_{B}^{m} we denote the channel 𝒟m[Bm]\mathscr{D}_{m}\left[\mathcal{M}_{B}^{m}\right], i.e. the action of a (possibly non-free) comb 𝒟m\mathscr{D}_{m} on mm copies of B\mathcal{M}_{B} inserted in its mm slots. Again, this also includes the case in which the target resource B\mathcal{M}_{B} arises in mm parallel copies, i.e. Bm\mathcal{M}_{B}^{\otimes m}. If a maximal resource exists, we can also define the asymptotic adaptive resource cost and adaptive resource distillation respectively as

COST𝔉Ad(𝒩A):=limε0+lim infn1mCOST𝔉,ε(n),Ad(𝒩Am)\mathrm{COST}_{\mathfrak{F}}^{{\rm Ad}}\left(\mathcal{N}_{A}\right):=\lim_{\varepsilon\to 0^{+}}\liminf_{n}\frac{1}{m}\mathrm{COST}_{\mathfrak{F},\varepsilon}^{\left(n\right),{\rm Ad}}\left(\mathcal{N}_{A}^{m}\right)

and

DISTILL𝔉Ad(𝒩A):=limε0+limn+1nDISTILL𝔉,ε(n),Ad(𝒩A),\mathrm{DISTILL}_{\mathfrak{F}}^{{\rm Ad}}\left(\mathcal{N}_{A}\right):=\lim_{\varepsilon\to 0^{+}}\lim_{n\to+\infty}\frac{1}{n}\mathrm{DISTILL}_{\mathfrak{F},\varepsilon}^{\left(n\right),{\rm Ad}}\left(\mathcal{N}_{A}\right),

where, as above 𝒩Am\mathcal{N}_{A}^{m} denotes the action of a (possibly non-free) comb on mm copies of 𝒩A\mathcal{N}_{A} (note that mm depends on nn). The adaptive exact resource distillation and resource cost are defined similarly as above.

IV Conclusions

In this article we presented the general framework for resource theories of quantum processes. In particular, we introduced a new construction of a complete family of monotones governing the simulation of channels by free superchannels, which is valid in all convex resource theories of quantum processes. We showed that the problem of resource interconversion can be turned into a conic linear program, whose hardness depends on the particular resource theory under consideration.

Moreover, we also showed that shifting our focus from states to processes introduces a richer landscape of protocols that can be implemented for resource conversions. This stems from the fact that channels, unlike states, have an input and an output, therefore they can be composed in a variety of ways. Hence the most general manipulation of multiple copies of a resource follows an adaptive scheme, in which the various copies are inserted into the slots of a free circuit (a free comb). This scheme is most general, as it includes the well-known case of the tensor product of many copies. This added layer of complexity makes resource theories of processes far more complicated to study than resource theories of states.

However, this is not the only extra complication. A further difficulty concerns the realization of free superchannels. We saw that a priori there is no guarantee that all free superchannels are also freely realizable, i.e. they can be implemented with free pre-processing and post-processing channels. We conjecture that in fact there exist free superchannels that are not freely realizable. In general, it is hard to determine if a given free superchannel admits a free realization, so we were not able to provide a conclusive answer to this issue. However, the results we announced in Ref. [59] suggest that focusing only on freely realizable superchannels makes the issue of studying resource interconversion much more complicated than considering generic free superchannels.

A further possible generalization is to relax the hypothesis of causal manipulation of multiple dynamical resources. Indeed, when multiple resources are plugged into a free quantum comb to be converted, the order in which they are inserted matters, for the slots of the comb are causally ordered, and a resource cannot be used to “influence” the others that causally precede it. In this case, not restricting to combs, but also considering superpositions of causal orders in resource processing [80, 81] might help us get an advantage on resource manipulation, as we already know this to happen in the case of the quantum switch [67, 103, 104, 105, 106].

Acknowledgements.
G. G. would like to thank Francesco Buscemi, Eric Chitambar, Mark Wilde, and Andreas Winter for many useful discussions related to the topic of this paper. The authors acknowledge support from the Natural Sciences and Engineering Research Council of Canada (NSERC) through grant RGPIN-2020-03938, from the Pacific Institute for the Mathematical Sciences (PIMS), and a from Faculty of Science Grand Challenge award at the University of Calgary.

References

Appendix A How to calculate the dual of d𝔉(𝒩)d_{\mathfrak{F}}\left(\mathcal{N}\to\mathcal{M}\right)

The first step to determine the dual of the conic linear program associated with Eq. (13) is to express d𝔉(𝒩)d_{\mathfrak{F}}\left(\mathcal{N}\to\mathcal{M}\right) using Choi matrices and the characterization of the diamond norm in Ref. [101]. We have

d𝔉(𝒩AB)\displaystyle d_{\mathfrak{F}}\left(\mathcal{N}_{A}\to\mathcal{M}_{B}\right) =min{λ:ωBtrA[𝐉ABΘ((JA𝒩)TIB)]JB;λIB0ωB0;ΘFREE(AB);ωB0}\displaystyle=\min\left\{\lambda:\omega_{B}\geq\mathrm{tr}_{A}\left[\mathbf{J}_{AB}^{\Theta}\left(\left(J_{A}^{\mathcal{N}}\right)^{T}\otimes I_{B}\right)\right]-J_{B}^{\mathcal{M}};\thinspace\lambda I_{B_{0}}\geq\omega_{B_{0}};\thinspace\Theta\in\mathrm{FREE}\left(A\to B\right);\thinspace\omega_{B}\geq 0\right\}
=min{λ:ωBtrA[αAB((JA𝒩)TIB)]JB;λIB0ωB0;ωB0;αAB𝔍AB},\displaystyle=\min\left\{\lambda:\omega_{B}\geq\mathrm{tr}_{A}\left[\alpha_{AB}\left(\left(J_{A}^{\mathcal{N}}\right)^{T}\otimes I_{B}\right)\right]-J_{B}^{\mathcal{M}};\thinspace\lambda I_{B_{0}}\geq\omega_{B_{0}};\thinspace\omega_{B}\geq 0;\thinspace\alpha_{AB}\in\mathfrak{J}_{AB}\right\}, (16)

where 𝔍AB\mathfrak{J}_{AB} is the set of the Choi matrices of free superchannels (cf. Eq. (11)). We want to work with the dual problem using conic linear programming, but 𝔍AB\mathfrak{J}_{AB}, albeit convex, is not a cone. Therefore we consider the cone 𝔎\mathfrak{K} generated by 𝔍AB\mathfrak{J}_{AB} (see subsection III.1). Now Eq. (16) can be rewritten as

d𝔉(𝒩AB)\displaystyle d_{\mathfrak{F}}\left(\mathcal{N}_{A}\to\mathcal{M}_{B}\right)
=min{λ:ωBtrA[αAB((JA𝒩)TIB)]JB;λIB0ωB0;ωB0;αAB𝔎;tr[αAB]=|A1B0|}.\displaystyle=\min\left\{\lambda:\omega_{B}\geq\mathrm{tr}_{A}\left[\alpha_{AB}\left(\left(J_{A}^{\mathcal{N}}\right)^{T}\otimes I_{B}\right)\right]-J_{B}^{\mathcal{M}};\thinspace\lambda I_{B_{0}}\geq\omega_{B_{0}};\thinspace\omega_{B}\geq 0;\thinspace\alpha_{AB}\in\mathfrak{K};\thinspace\mathrm{tr}\left[\alpha_{AB}\right]=\left|A_{1}B_{0}\right|\right\}.

Now, following Ref. [107], consider the two convex cones

𝔎1:={(λ,ωB,αAB):λ+;ωB0;αAB𝔎}\mathfrak{K}_{1}:=\left\{\left(\lambda,\omega_{B},\alpha_{AB}\right):\lambda\in\mathbb{R}_{+};\,\omega_{B}\geq 0;\thinspace\alpha_{AB}\in\mathfrak{K}\right\}
𝔎2:={(RB0,PB,0):RB00;PB0}.\mathfrak{K}_{2}:=\left\{\left(R_{B_{0}},P_{B},0\right):R_{B_{0}}\geq 0;\thinspace P_{B}\geq 0\right\}.

𝔎1\mathfrak{K}_{1} is a subset of the vector space Herm(B)Herm(AB)\mathbb{R}\oplus\mathrm{Herm}\left(B\right)\oplus\mathrm{Herm}\left(AB\right), whereas 𝔎2\mathfrak{K}_{2} is a subset of Herm(B0)Herm(B)\mathrm{Herm}\left(B_{0}\right)\oplus\mathrm{Herm}\left(B\right)\oplus\mathbb{R}. These two vector spaces carry an inner product. For Herm(B)Herm(AB)\mathbb{R}\oplus\mathrm{Herm}\left(B\right)\oplus\mathrm{Herm}\left(AB\right) it is

(λ,ωB,αAB),(λ,ωB,αAB)=λλ+tr[ωBωB]+tr[αABαAB];\left\langle\left(\lambda,\omega_{B},\alpha_{AB}\right),\left(\lambda^{\prime},\omega^{\prime}_{B},\alpha^{\prime}_{AB}\right)\right\rangle=\lambda\lambda^{\prime}+\mathrm{tr}\left[\omega_{B}\omega^{\prime}_{B}\right]+\mathrm{tr}\left[\alpha_{AB}\alpha^{\prime}_{AB}\right];

for Herm(B0)Herm(B)\mathrm{Herm}\left(B_{0}\right)\oplus\mathrm{Herm}\left(B\right)\oplus\mathbb{R} it is

(ηB0,ζB,t),(ηB0,ζB,t)=tr[ηB0ηB0]+tr[ζBζB]+tt.\left\langle\left(\eta_{B_{0}},\zeta_{B},t\right),\left(\eta^{\prime}_{B_{0}},\zeta^{\prime}_{B},t^{\prime}\right)\right\rangle=\mathrm{tr}\left[\eta_{B_{0}}\eta^{\prime}_{B_{0}}\right]+\mathrm{tr}\left[\zeta_{B}\zeta^{\prime}_{B}\right]+tt^{\prime}.

Now consider the linear map :Herm(B)Herm(AB)Herm(B0)Herm(B)\mathcal{L}:\mathbb{R}\oplus\mathrm{Herm}\left(B\right)\oplus\mathrm{Herm}\left(AB\right)\rightarrow\mathrm{Herm}\left(B_{0}\right)\oplus\mathrm{Herm}\left(B\right)\oplus\mathbb{R}. Its action on a generic element X=(λ,ωB,αAB)X=\left(\lambda,\omega_{B},\alpha_{AB}\right) of 𝔎1\mathfrak{K}_{1} is

(X):=(λIB0ωB0,ωBtrA[αAB((JA𝒩)TIB)],tr[αAB]).\mathcal{L}\left(X\right):=\left(\lambda I_{B_{0}}-\omega_{B_{0}},\omega_{B}-\mathrm{tr}_{A}\left[\alpha_{AB}\left(\left(J_{A}^{\mathcal{N}}\right)^{T}\otimes I_{B}\right)\right],\mathrm{tr}\left[\alpha_{AB}\right]\right).

Notice that this specifies \mathcal{L} completely because 𝔎1\mathfrak{K}_{1} spans the whole domain of \mathcal{L}. Now consider

H1=(1,0B,0AB)Herm(B)Herm(AB)H_{1}=\left(1,0_{B},0_{AB}\right)\in\mathbb{R}\oplus\mathrm{Herm}\left(B\right)\oplus\mathrm{Herm}\left(AB\right)

and

H2=(0B0,JB,|A1B0|)Herm(B0)Herm(B).H_{2}=\left(0_{B_{0}},J_{B}^{\mathcal{M}},\left|A_{1}B_{0}\right|\right)\in\mathrm{Herm}\left(B_{0}\right)\oplus\mathrm{Herm}\left(B\right)\oplus\mathbb{R}.

With this notation we can write [107]

d𝔉(𝒩AB)\displaystyle d_{\mathfrak{F}}\left(\mathcal{N}_{A}\to\mathcal{M}_{B}\right) =min{X,H1:(X)H2𝔎2;X𝔎1}\displaystyle=\min\left\{\left\langle X,H_{1}\right\rangle:\mathcal{L}\left(X\right)-H_{2}\in\mathfrak{K}_{2};\thinspace X\in\mathfrak{K}_{1}\right\}
=max{Y,H2:H1(Y)𝔎1;Y𝔎2},\displaystyle=\max\left\{\left\langle Y,H_{2}\right\rangle:H_{1}-\mathcal{L}^{*}\left(Y\right)\in\mathfrak{K}_{1}^{*};\thinspace Y\in\mathfrak{K}_{2}^{*}\right\},

where the second equality follows from strong duality. We only need to calculate (Y)\mathcal{L}^{*}\left(Y\right), where Y=(ηB0,ζB,t)Y=\left(\eta_{B_{0}},\zeta_{B},t\right) is in Herm(B0)Herm(B)\mathrm{Herm}\left(B_{0}\right)\oplus\mathrm{Herm}\left(B\right)\oplus\mathbb{R}. We have

(Y)=(tr[ηB0],ζBηB0IB1,tIAB(JA𝒩)TζB).\mathcal{L}^{*}\left(Y\right)=\left(\mathrm{tr}\left[\eta_{B_{0}}\right],\zeta_{B}-\eta_{B_{0}}\otimes I_{B_{1}},tI_{AB}-\left(J_{A}^{\mathcal{N}}\right)^{T}\otimes\zeta_{B}\right).

Hence,

d𝔉(𝒩AB)\displaystyle d_{\mathfrak{F}}\left(\mathcal{N}_{A}\to\mathcal{M}_{B}\right) =max{t|A1B0|+tr[ζBJB]:tr[ηB0]1; 0ζBηB0IB1;(JA𝒩)TζBtIAB𝔎}\displaystyle=\max\left\{t\left|A_{1}B_{0}\right|+\mathrm{tr}\left[\zeta_{B}J_{B}^{\mathcal{M}}\right]:\mathrm{tr}\left[\eta_{B_{0}}\right]\leq 1;\thinspace 0\leq\zeta_{B}\leq\eta_{B_{0}}\otimes I_{B_{1}};\thinspace\left(J_{A}^{\mathcal{N}}\right)^{T}\otimes\zeta_{B}-tI_{AB}\in\mathfrak{K}^{*}\right\}
=max{t|A1B0|+tr[ζBJB]:tr[ηB0]=1; 0ζBηB0IB1;(JA𝒩)TζBtIAB𝔎},\displaystyle=\max\left\{t\left|A_{1}B_{0}\right|+\mathrm{tr}\left[\zeta_{B}J_{B}^{\mathcal{M}}\right]:\mathrm{tr}\left[\eta_{B_{0}}\right]=1;\thinspace 0\leq\zeta_{B}\leq\eta_{B_{0}}\otimes I_{B_{1}};\,\left(J_{A}^{\mathcal{N}}\right)^{T}\otimes\zeta_{B}-tI_{AB}\in\mathfrak{K}^{*}\right\},

where 𝔎\mathfrak{K}^{*} is the dual of the cone generated by the Choi matrices of free superchannels. We have obtained Eq. (14).