Abstract
Recent understanding of the thermodynamics of small-scale systems have enabled the characterization of the thermodynamic requirements of implementing quantum processes for fixed input states. Here, we extend these results to construct optimal universal implementations of a given process, that is, implementations that are accurate for any possible input state even after many independent and identically distributed (i.i.d.) repetitions of the process. We find that the optimal work cost rate of such an implementation is given by the thermodynamic capacity of the process, which is a single-letter and additive quantity defined as the maximal difference in relative entropy to the thermal state between the input and the output of the channel. Beyond being a thermodynamic analogue of the reverse Shannon theorem for quantum channels, our results introduce a new notion of quantum typicality and present a thermodynamic application of convex-split methods.
Introduction
In the information-theoretic approach to thermodynamics, a careful analysis of the resources required to perform thermodynamic tasks has allowed to consistently and systematically describe the thermodynamic behaviour of quantum systems at the nano-scale [1]. In particular, thermodynamics can be phrased as a resource theory [2–4]. In a resource theory, one specifies which operations can be carried out at no cost—the free operations—and then one studies how much of external resources (e.g., thermodynamic work) one needs to provide to carry out operations that are not free. Two established resource theories for quantum thermodynamics are thermal operations [2, 3] and Gibbs-preserving maps [5, 6]. In the former, the free operations consist of energy-conserving interactions of the system with a heat bath, while in the latter, the free operations are any quantum operation that preserves the thermal state. It is reasonable to assume that thermal operations can be realized in an idealized setting, making them a good choice of framework for constructing explicit protocols, whereas Gibbs-preserving maps encompass a broader class of operations, allowing us to derive stronger fundamental limits.
The resource theory approach to thermodynamics has revealed close connections with measures of information known from quantum information theory [7, 8]. Namely, single-shot thermodynamic and information-theoretic tasks are both quantified by relevant entropy measures [9–11]. Consequently, tools from quantum Shannon theory can be used to characterize tasks in thermodynamics, for instance to derive second-order asymptotics of the work cost of state transformations [12]. Recently, focus was shifted to understand the resource costs of quantum processes, rather than state transformations [13–16]. The information measure associated with quantum processes is the quantum capacity, along with its many variants [17]. A natural question arises: What is the thermodynamic analogue of the quantum capacity?
Here, we ask how much work is required to implement a given quantum process, with the requirement that the implementation is accurate for any possible input state. In the single-instance regime, we find that the answer is a variation of the results obtained in Ref. [16]. However, in the regime where we consider many independent and identically distributed (i.i.d.) copies of the process, important differences arise due to typicality. We find that the optimal work cost of such an implementation in the i.i.d. regime is given by the thermodynamic capacity, defined as the maximal difference between the input and output free energy of the process over all possible input states. The fact that no implementation can perform better than the thermodynamic capacity follows fairly straightforwardly from the results of Ref. [16]. The technically challenging part of the present paper is to show that there exist protocols that achieve this limit.
We provide three different constructions of such protocols, each valid in different settings. In the first construction, we make the simplifying assumption that Hamiltonian of the system is trivial as in Ref. [13]. We then show that simple properties of one-shot entropy measures, coupled with the post-selection technique [18], provide an existence proof of the required implementation. The implementation is given in terms of thermal operations. In our second construction, we develop novel quantum typicality tools which we use along with the post-selection technique to explicitly construct an implementation in terms of Gibbs-preserving maps for any i.i.d. process and for any system Hamiltonian. In our third construction, we assume that the i.i.d. process is time-covariant, i.e., commutes with the time evolution. We then use recent results on the convex-split lemma and position-based decoding [19] to construct an implementation of a time-covariant i.i.d. process with thermal operations.
Our results imply that the thermodynamic resource theory of channels becomes reversible in the i.i.d. limit [20]. Namely, invoking the results in Ref. [21], we see that the work rate that is required to implement a given i.i.d. process is the same as what can be extracted if the i.i.d. process is provided to us as a black box. This provides a thermodynamic analogue of the reverse Shannon theorem from quantum information theory. This theorem states that the quantum mutual information of the channel uniquely characterizes the resources required to simulate the channel with noiseless channel uses and shared entanglement, as well as to distil a noiseless channel from many uses of the channel and shared entanglement [22, 23]. Indeed, our proof techniques are inspired by Refs. [22, 24–26].
The remainder of this paper is structured as follows. Section 2 gives the necessary preliminaries and fixes some notation. Section 3 introduces two resource theories for thermodynamics, thermal operations and Gibbs-preserving maps. In Sect. 4 we introduce the thermodynamic capacity and present some elementary properties. In Sect. 5, we provide our first construction for a trivial Hamiltonian. In Sect. 6 we provide our second construction, which is valid in the general setting and provides an implementation in terms of Gibbs-preserving maps. Section 7 provides our third construction, valid for time-covariant i.i.d. processes, and built with thermal operations. Our conclusions are presented in Sect. 8. Various more technical proof details are deferred to “Appendices A–F”.
Preliminaries
Quantum states, quantum processes, and distance measures
Each quantum system considered lives in a finite-dimensional Hilbert space. A quantum state is a positive semi-definite operator satisfying . A sub-normalized quantum state is a positive semi-definite operator satisfying . To each system S is associated a standard basis, usually denoted by . For any two systems , we denote by the fact that they are isometric. In that case, we consider a representation in which the isometry maps the standard basis onto the standard basis, i.e., for all k, where denotes the identity process. For any two systems , we define the non-normalized maximally entangled reference ket . Matrix inequalities are with respect to the positive semi-definite cone: signifies that is positive semi-definite. A completely positive map is a linear mapping that maps Hermitian operators on X to Hermitian operators on and that satisfies , where . The adjoint of a completely positive map is the unique completely positive map that satisfies for all operators Y, Z. A completely positive map is trace-preserving if and trace non-increasing if .
Proximity of quantum states can be measured by the fidelity , where the one-norm of an operator is defined as . The fidelity is extended to sub-normalized states as the generalized fidelity, , noting that whenever at least one of the states is normalized. An associated metric can be defined for any sub-normalized states as , called the purified distance [10, 11, 27], or root infidelity, and is closely related to the Bures distance and the quantum angle [28]. The proximity of two sub-normalized quantum states may also be measured in the trace distance . We note that the one-norm of a Hermitian operator A can be expressed as
| 1 |
where the first optimization ranges over Hermitian Z operators and where the second over positive semi-definite operators . For any two states (one can even be sub-normalized), the purified distance and the trace distance are related via
| 2 |
Similarly, we may define a distance measure for channels: For two completely positive, trace non-increasing maps and , the diamond norm distance is defined as
| 3 |
where the optimization ranges over all bipartite quantum states over X and a reference system . The optimization may be restricted to pure states without loss of generality.
Entropy measures
The von Neumann entropy of a quantum state is . In this work, all entropies are defined in units of nats, using the natural logarithm , instead of units of (qu)bits. A number of nats is equal to times the corresponding number of qubits. The conditional von Neumann entropy of a bipartite state is given by
| 4 |
The quantum relative entropy is defined as
| 5 |
where is a quantum state and where is any positive semi-definite operator whose support contains the support of .
Schur–Weyl duality
Consider a Hilbert space and . The group acts naturally on , where acts as and where the permutation group permutes the tensor factors. We follow closely the notation of Refs. [24, 25]. Schur–Weyl tells us that the full Hilbert space decomposes as
| 6 |
where are Young diagrams with n boxes and (at most) d rows, and where , are irreducible representations of and , respectively. The number of Young diagrams in the decomposition above is at most , if is kept constant. We write in big O notation for terms whose absolute value is upper bounded by some polynomial for in the asymptotic limit .
We denote by the projector in onto the term labelled by in the decomposition above. We denote by a representing matrix of in the irreducible representation labelled by ; the operator lives in . We furthermore introduce the following notation, for any ,
| 7 |
which represents the canonical embedding of an operator Y on into the space , i.e., mapping Y onto the corresponding block in (6). In particular,
| 8 |
Any operator acting on the n copies which commutes with all the permutations admits a decomposition of the form
| 9 |
for some set of operators . In particular, . We can make this more precise for i.i.d. states. For any , we have that
| 10 |
| 11 |
For a given , it is often useful to consider the corresponding normalized probability distribution . The entropy of this distribution is given by
| 12 |
where is the number of boxes in the i-th row of the diagram.
If we have n copies of a bipartite system , then we may Schur–Weyl decompose , and under the respective actions of , and . A useful property we will need here is that the projectors onto the respective Schur–Weyl blocks commute between these decompositions.
Lemma 2.1
Consider two spaces and let and be the projectors onto Schur–Weyl blocks of and , respectively, with and . Then, we have
| 13 |
Proof
is invariant under the action of permuting the copies of , and so it admits a decomposition of the form (9) and commutes with .
The following is another lemma about how much overlap Schur–Weyl blocks have on a bipartite system versus on one of the two systems. This lemma forms the basis of our universal typical subspace.
Lemma 2.2
Consider copies of a bipartite system . Then, for any and , we have
| 14 |
noting that .
The proof is provided in “Appendix A”.
Estimating entropy
Measuring the Young diagram —that is, performing the projective measurement with operators —yields a good estimation of the spectrum of a state when given [25]. An estimate for the entropy of is thus obtained by calculating the entropy corresponding to the probability distribution .
Proposition 2.1
(Spectrum and entropy estimation [22, 24, 25]). Consider copies of a system . Then, the family of projectors given by Schur–Weyl duality forms a POVM obeying the following property: For any , there exists an such that for any state , we have
| 15 |
The proof is provided in “Appendix A”.
Estimating energy
Proposition 2.2
Consider any observable on and write . Then, the set of projectors onto the eigenspaces of forms a POVM satisfying the following properties:
-
(i)
There are at most POVM elements, with the label k running over a set ;
-
(ii)
We have and ;
-
(iii)For any and for any state ,
and where for any we define16 17 -
(iv)For any , we have
18
The proof is provided in “Appendix A”.
Post-selection technique
The post-selection technique is useful for bounding the diamond norm of a candidate smoothed channel to a target ideal i.i.d. channel.
Theorem 2.1
(Post-selection technique [18]). Let be quantum systems, be a completely positive, trace-preserving map, and be a completely positive, trace non-increasing map. Furthermore, let ,
| 19 |
where denotes the Haar-induced measure on the pure states on , and its induced measure on X after partial trace, and let be a purification of . Then, we have
| 20 |
Moreover, for all there exists a set of at most states, and a probability distribution , providing a purification of as
| 21 |
with a register of size .
The first part of the theorem is [18, Eq. (4)] and the second part is, e.g., found as [23, Cor. D.6]. The following proposition shows that a given channel is close to an i.i.d. channel, if it behaves as expected on all i.i.d. states with exponentially good accuracy.
Proposition 2.3
For three systems , let be an isometry and be an isometry which commutes with the permutations of the n systems. Furthermore, assume that there exists independent of n such that for all pure states with a reference system , we have
| 22 |
For and we then have
| 23 |
The proof is provided in “Appendix A”.
Resource Theory of Thermodynamics
Gibbs-preserving maps
We consider the framework of Ref. [16], where for each system S considered a positive semi-definite operator is associated. A trace non-increasing, completely positive map is allowed for free if it satisfies . In the case of a system S with Hamiltonian , and in the presence of a single heat bath at inverse temperature , the relevant thermodynamic framework is given by setting . In the remainder of this paper, when using the present framework, it is convenient to work with the operators on an abstract level. The results then also apply to situations where several different thermodynamic baths are considered, or in more general settings where a specific operator needs to be conserved by the spontaneous evolution of the system [16].
The resources required to enable non-free operations are counted using an explicit system that provides these resources, such as an information battery. An information battery is a large register W whose associated operator is simply (i.e., ). The information battery is required to be in a state of the special form where is a projector of rank . That is, has uniform eigenvalues over a given rank . We denote the charge or resource value of a battery state by , where d is the dimension of the information battery. The value measures the amount of purity present in the state , which is the basic resource required to implement maps that are not already Gibbs-preserving maps. We choose to measure in units of number of pure nats, equal to times a number of pure qubits. A Gibbs-preserving map that acts jointly on a system and an information battery, and which maps the input battery state to the output battery state , is deemed to consume an amount of work .
The resources can be counted in terms of thermodynamic work in units of energy if we are given a heat bath at inverse temperature T. Recall that a pure qubit can be converted to work using a Szilárd engine, where k is Boltzmann’s constant [29]. By counting purity in nats instead of qubits, we get rid of the factor: A number of pure nats can be converted into thermodynamic work using a Szilárd-type engine. We count work exclusively in equivalent of pure nats, for simplicity, as opposed to units of energy. The two are directly related by a factor . Furthermore, this eliminates the factor from otherwise essentially information-theoretic expressions, and our theorems thus directly apply to cases where are any abstract positive semi-definite operators which are not necessarily defined via a Hamiltonian.
Let be a Gibbs-preserving map acting on an information battery W, and let , be two information battery states. An implementation running the operation with the given input and output battery states is tasked to (a) make available the input battery state, (b) apply the operation , and (c) check that the output battery state is appropriate (e.g., for possible future re-use). For the verification in Point (c) it is sufficient to measure the two-outcome POVM ; as long as the first outcome is observed, it is always possible to bring the state to by applying a completely thermalizing operation on the support of (here, this is a completely randomizing or completely symmetrizing operation). In the constructions presented in the present paper, we allow this verification measurement to fail with a small fixed probability .
A convenient mathematical object to characterize what the operation does on the system is the following. The effective work process associated with and is the trace non-increasing map defined as
| 24 |
The question of implementing a process becomes the issue of finding a Gibbs-preserving map along with battery states such that the associated effective work process is close to . Specifically, if , then we can assert that the failure probability in Point (c) above is bounded by for all possible inputs on X; the operation therefore implements accurately with high success probability.
A useful characterization of which processes can be implemented using an information battery is given by the following proposition.
Proposition 3.1
( [16, Proposition I]). Let , be a completely positive, trace non-increasing map, and . Then, the following are equivalent:
-
(i)
We have ;
-
(ii)
For all there exists an information battery W and two battery states such that , and there exists a Gibbs-preserving map with the effective work process associated with and .
Therefore, to show that one can implement with Gibbs-preserving maps while expending work w, it suffices to exhibit a map that is -close to in diamond distance and that satisfies . From the proof in [16] we know in Point (ii) above that W, and can be chosen freely as long as and that the corresponding Gibbs-preserving map is given by
| 25 |
In Ref. [16], the resource cost w of implementing a process (any completely positive, trace-preserving map) up to an accuracy in terms of proximity of the process matrix given a fixed input state , counted in pure nats, was shown to be given by the coherent relative entropy
| 26 |
where is the purification of on a system given by , and where the optimization ranges over completely positive, trace non-increasing maps . The coherent relative entropy enjoys a collection of properties in relation to the conditional min- and max-entropy, and to the min- and max-relative entropy. It satisfies the following asymptotic equipartition property: For a completely positive, trace-preserving map and quantum state we have for that
| 27 |
Thermal operations
The framework of Gibbs-sub-preserving maps is technically convenient, but it is unclear whether any Gibbs-sub-preserving operation can be implemented at no work cost using other frameworks. This includes for example thermal operations that might be considered more operational
Here, we consider the alternative framework of thermal operations [2, 3, 8]. Each system S of interest has an associated Hamiltonian and is not interacting with the other systems. For a given fixed inverse temperature , we allow the following operations to be carried out for free:
-
(i)
Apply any unitary operation that commutes with the total Hamiltonian;
-
(ii)
Bring in any ancillary system in its Gibbs state at inverse temperature ; and
-
(iii)
Discard any system.
The most general transformation a system S can undergo under this set of rules is a thermal operation. A thermal operations is any process that can be implemented using an additional system B with any Hamiltonian and with any unitary satisfying , resulting in the completely positive, trace-preserving map
| 28 |
where is the Gibbs state of the bath system B. Observe that any concatenation of thermal operations is again a thermal operation.
Clearly, any thermal operation leaves the thermal state on S invariant. Hence, any lower bound on the work cost of an implementation derived in the framework of Gibbs-preserving maps also applies to thermal operations. We use the same definitions of work and the effective work process for thermal operations as we defined for Gibbs-preserving maps earlier: an information battery is used to account for work, and the effective work process associated with a thermal operation with respect to battery states is also defined by (24).
When considering only states that commute with the Hamiltonian, a powerful tool to characterize possible state transformations is the notion of thermomajorization [8]. In the fully quantum regime, there is in contrast no known simple mathematical characterization of the work required to implement a quantum process with thermal operations. In fact, because thermal operations are time-covariant, it is impossible to implement processes that are not time-covariant, even if the latter might admit an implementation with a Gibbs-preserving map [6].
We will later use a primitive that transforms a thermal state into a pure energy eigenstate. The next statement follows directly from [8, Eq. (8) and Suppl. Note 4].
Proposition 3.2
Let be the thermal state on a system X with Hamiltonian , and let be a pure energy eigenstate of . There exists a thermal operation on an information battery with battery states such that and such that can be chosen arbitrarily close to .
Thermodynamic Capacity
Definition
Let be quantum systems, be a quantum process, and . We seek a free thermodynamic operation (either a thermal operation or a Gibbs preserving map) that acts on and a battery W, with output on and W, as well as information battery states and , such that:
-
(i)
The effective work process of with respect to is -close in diamond distance to ;
-
(ii)We seek to minimize the work consumption per copy w given by
29
Our main result is a collection of three independent constructions of such implementations in different regimes, using either Gibbs-preserving maps or thermal operations. In each case, the amount of work consumed per copy is given by a quantity which we call the thermodynamic capacity of the process, and which turns out to be the minimal work cost an implementation satisfying the above conditions can achieve. The thermodynamic capacity of a completely positive, trace-preserving map relative to operators is defined as
| 30 |
In a fully thermodynamic context where and , one can choose to express the thermodynamic capacity in units of energy rather than in nats, in which case a pre-factor may be included in the definition above such that the thermodynamic capacity is a difference of free energies
| 31 |
Construction for trivial Hamiltonians First, in Sect. 5 we consider the special case where and corresponding to trivial Hamiltonians and show that simple considerations based on properties of known entropy measures guarantee the existence of a universal implementation of with either thermal operations or Gibbs-preserving maps.
Construction using Gibbs-preserving maps Second, in Sect. 6 we consider the case of general and we construct a universal implementation of with Gibbs-preserving maps, based on new typicality considerations.
Construction using thermal operations Third, for arbitrary Hamiltonians we construct in Sect. 7 a universal implementation of with thermal operations, assuming that is time-covariant, i.e., that it commutes with the time evolution operation.
Properties
The thermodynamic capacity is a convex optimization program. Namely, the objective function of the optimization in (30) can be written as
| 32 |
where we defined the state using a Stinespring dilation of into an environment system E, satisfying . The conditional entropy is concave in the quantum state as and the quantum relative entropy is jointly convex. The other terms in (32) are linear. Hence, the optimization (30) is a convex optimization that can be carried out efficiently for small system sizes [30]. Indeed, we have successfully computed the thermodynamic capacity of simple example quantum channels acting on few qubits with Python code, using the QuTip framework [31, 32] and the CVXOPT optimization software [33] (see also [34] for a direct algorithm).
The thermodynamic capacity is additive [21]. As a consequence of this property, it is not necessary to include a stabilization over a reference system in the definition of the thermodynamic capacity. That is, had we optimized over bipartite states with a reference system R for any , on which the process acts as the identity process, we would be effectively computing . However, additivity implies that .
Proposition 4.1
(Additivity of thermodynamic capacity [21]). For and quantum channels , we have
| 33 |
For completeness we provide an independent proof of additivity, to ensure validity in the general setting of abstract operators.
Proof
Let be states achieving the thermodynamic capacity of and , respectively. Then, is a candidate for , yielding
| 34 |
Now, let achieve the optimum for . Let , be Stinespring isometries of and respectively, such that and . Let . Then, we have
| 35 |
since . Invoking the chain rule of the von Neumann entropy, and then strong sub-additivity of the entropy, we see that . Hence, we have
| 36 |
where the last inequality holds because the reduced states are optimization candidates for and , respectively.
A special case worth mentioning is when , , which corresponds to the situation where the Hamiltonians of X and are trivial. For any quantum channel , let be a Stinespring dilation isometry with . Then, we have
| 37 |
That is, the thermodynamic capacity characterizes by how much the channel is capable of reducing the entropy of its input, or equivalently, how much entropy the channel is capable of dumping into the environment when conditioned on the output. We note that the quantity has previously been studied in the information theory literature as the entropy gain of quantum channels [35–42]. Our work can be seen as giving a precise operational interpretation to this quantity.
Optimality
Here, we show that any universal implementation that obeys our stated conditions in Sect. 4.1 must necessarily consume an amount of work that is lower bounded by the thermodynamic capacity. That is, any universal implementation that consumes an amount of work equal to the thermodynamic capacity is optimal. This lower bound is simple to prove, because a universal implementation of a process must necessarily be a good implementation for any individual i.i.d. input state, a situation where the optimal work cost is known [16]. Furthermore, any scheme that satisfies the requirements of Sect. 4 at work cost w per copy counted with standard battery states of Ref. [16], has an effective process on the systems that obeys . This is because any thermal operation is in particular a Gibbs-preserving map, and the work cost is characterized by Proposition 3.1. The following shows that for any such implementation, the work consumed w per copy cannot be less than the thermodynamic capacity of the process.
Proposition 4.2
Let , , a completely positive, trace-preserving map, and a completely positive, trace non-increasing map such that we have . For such that , we have in the limit that .
Proof
Let with , be a quantum state, and . Then, by definition of the diamond norm it must hold that , which implies that . We have that is a valid optimization candidate for the definition of the coherent relative entropy and thus
| 38 |
For , we can employ the asymptotic equipartition of the coherent relative entropy (27) to see that
| 39 |
Since this inequality holds for all , we deduce that .
Construction #1: Trivial Hamiltonians
Statement and proof sketch
Instead of constructing explicitly an implementation that satisfies the requirements of Sect. 4, one might hope that the implementation could be given implicitly as the solution of a semi-definite program representing an entropy measure. This proof idea was indeed exploited in other contexts in Refs. [23, 43]. Here, we define the one-shot entropy-like quantity
| 40 |
where ranges over all trace non-increasing, completely positive maps. The proof strategy would then be to relate this entropy measure to the coherent relative entropy, and to exploit known properties of the latter in the i.i.d. regime to provide an upper bound to the expression
| 41 |
Should this upper bound behave like to leading order, then the equal to the optimal solution to (40) defines an implementation in terms of Gibbs-preserving maps thanks to Proposition 3.1. It turns out that this proof strategy works well in the special case of trivial Hamiltonians, but fails in the general case.
The core technical statement that underlies our Construction #1 is summarized in the following theorem.
Theorem 5.1
Let be a completely positive, trace-preserving map, and . Then we have
| 42 |
where .
This implementation is constructed by taking the implicit optimal solution in the semi-definite program (40) for , and using Proposition 3.1 to construct an associated Gibbs-preserving map acting on battery states via (25). In summary, for any , for n large enough and choosing any such that , the full implementation map in terms of becomes
| 43 |
We emphasise that Theorem 5.1 exactly covers the entropy gain of quantum channels as studied in [35–42].
Proof
(Theorem 5.1) By using the post-selection technique (Theorem 2.1) and recalling that the fixed-input state case is given by the coherent relative entropy, we find
| 44 |
In the case of trivial Hamiltonians, the coherent relative entropy reduces to the smooth max-entropy (cf. [16, Props. 28 and 26] and also Ref. [44]). More precisely, we have
| 45 |
where is a pure state, where , , are universal and do not depend on the state or the dimensions of the systems, and the smooth max-entropy is defined as
| 46 |
Thus, we have
| 47 |
where and is a Stinespring dilation isometry of as . At this point we invoke two facts. First, note that the de Finetti state can be written as a mixture of only i.i.d. states, instead of a continuous average (Theorem 2.1): There exists a set of at most states and a distribution such that . Second, we invoke the property that the conditional max-entropy is quasi-convex up to a penalty term, namely, that the conditional max-entropy of is less than or equal to the maximum over the set of max-entropies corresponding to each , plus a term proportional to the logarithm of the number of terms in the sum [45, Lemma 11]. Hence, with , we get
| 48 |
Now, we are in business because the max-entropy is evaluated on an i.i.d. state, and we know that it asymptotically goes to the von Neumann entropy in this regime [46]. Also, and hence
| 49 |
noting that .
Challenges for extension to non-trivial Hamiltonians
Naturally, one might ask whether it is possible to extend this proof to the case of non-trivial operators. Interestingly, this is not possible, at least not in a naive way. The problem is that we need a quasi-convexity property of the form
| 50 |
where and , , and where the term scales in a favourable way in n, say of order where M is the number of terms in the convex decomposition as for the max-entropy. In fact, Eq. (51) is false, as can be shown using an explicit counterexample on a two-level system which we present below. As this example is based on physical reasons, the coherent relative entropy is not even approximately quasi-convex. We note that a priori we cannot rule out a quasi-convexity property that might have a penalty term that depends on properties of the operators, yet such a term is likely to scale unfavourably with n.
Our example is as follows. Consider a two-level system with a Hamiltonian H with energy levels at corresponding energies and . The corresponding operator is with , . Consider the process consisting in erasing the input and creating the output state , where we define . That is, we consider the process . Suppose the input state is maximally mixed, , such that . If and , then this process requires a lot of work; intuitively, with probability 1/2 we start in the ground state and need to prepare the output state which has high energy.
For , we can see this because the input state is full rank, hence ; then and the smallest such that is given by
| 51 |
Noting that , we have , and hence the energy cost of the transformation is
| 52 |
Clearly, this work cost can become arbitrarily large if . On the other hand, we can perform the transformation obviously at no work cost; similarly, can be carried out by letting the system time-evolve under its own Hamiltonian for exactly the time interval required to pick up a relative phase between the and states. This also costs no work because it is a unitary operation that commutes with the Hamiltonian. We thus have our counter-example to the quasi-convexity of the coherent relative entropy. The transformation is very hard, but the individual transformations are trivial, noting that .
We show in “Appendix D” how to make the above claim robust against an accuracy tolerance .
Construction #2: Gibbs-Preserving Maps
Statement and proof sketch
Here, we present a general construction of a universal implementation of an i.i.d. process using Gibbs-preserving maps according to the requirements of Sect. 4.1. The idea is to explicitly construct an implementation using a novel notion of quantum typicality. We introduce notions of quantum typicality that apply to quantum processes and universally capture regions of the Hilbert space where the conditional entropy (respectively the relative entropy difference) has a given value. This generalizes existing notions of typical projectors to a quantum typical operator that applies to bipartite states, is relative to a operator, and universal.
The main result behind the construction in this section is the following theorem.
Theorem 6.1
Let , be a completely positive, trace-preserving map, and . Then, for and large enough there exists a completely positive map such that:
-
(i)
is trace non-increasing;
-
i(ii)
;
-
(iii)
.
Note that we have as , and that we can take after taking . Thanks to Proposition 3.1, the mapping defines an implementation of the i.i.d. process in terms of Gibbs-preserving maps and a battery, whose work cost rate is given to leading order by the thermodynamic capacity after taking .
As for Construction #1, the full Gibbs-preserving map implementing the required process is assembled in two steps, first constructing the map in Theorem 6.1 and then using Proposition 3.1 to obtain the full Gibbs-preserving map. Let be a Stinespring dilation isometry of . For , we introduce a universal conditional and relative typical smoothing operator (see later Definition 6.1 and Proposition 6.1) with and relative to and . The map is then constructed as
| 53 |
Finally, we employ Proposition 3.1 to construct an associated Gibbs-preserving map acting on battery states via (25). For any , for n large enough and choosing any such that , the full implementation map in terms of becomes
| 54 |
Construction via universal conditional and relative typicality
The main ingredient of our proof is a notion of a universal conditional and relative typical smoothing operator that enables us to discard events that are very unlikely to appear in the process while accounting for how much they contribute to the overall work cost. This operator is inspired by similar constructions in Refs. [47, 48]. However, in additional to being “relative” as in [47] our smoothing operator is also simultaneously “conditional” and “universal”.
Definition 6.1
Let and . A universal conditional and relative typical smoothing operator with parameter is an operator on that satisfies the following conditions:
-
(i)
;
-
(ii)There exists independent of n with the following property: For any pure state with (respectively ) in the support of (respectively ) and such that , it holds that
55 -
(iii)
.
Note that the smoothing operator is defined as a general operator of norm bounded by one, as opposed to the usual definition of typical subspaces or typical projectors. The main reason is that it is not known to us in general if such an object can be chosen to be a projector. By using the real part in Point (ii) above, we ensure that a process that applies the operator preserves coherences when it is applied to a superposition of several states . This property would not have been ensured if instead, we had merely asserted that and have high absolute value overlap or are close in fidelity. If is a projector then the expression reduces to as one usually considers for projectors on typical subspaces.
The core technical statement of Construction #2 is to show the existence of a universal conditional and relative smoothing operator, which is as follows.
Proposition 6.1
Let , , as well as and . There exists a universal conditional and relative typical smoothing operator that is furthermore permutation-invariant. Moreover, if , then can be chosen to be a projector satisfying and .
In the following, we present the proof of Theorem 6.1 based on the existence of such the smoothing operator from Proposition 6.1. The more technical proof of Proposition 6.1 is then given in Sect. 6.3.
Proof
(Theorem 6.1). Let be a Stinespring dilation of into an environment system . For we need to find a suitable candidate implementation . Let
| 56 |
For any let be the operator constructed by Proposition 6.1, with the system E playing the role of the system A, with as and with as . Now, define
| 57 |
noting that is trace non-increasing by construction thanks to Property (i) of Definition 6.1.
Let be any pure state, and define . By construction, . Then Property (ii) of Proposition 6.1 tells us that there exists a independent of both and n such that
| 58 |
The conditions of Proposition 2.3 are fulfilled, with , thanks furthermore to the fact that is permutation-invariant as guaranteed by Proposition 6.1. Hence, we have
| 59 |
For large enough this becomes smaller than any fixed . Furthermore, by Property (iii) of Definition 6.1, we have that
| 60 |
as required.
Universal conditional and relative typical smoothing operator
We now turn to the proof of Proposition 6.1, giving an explicit construction of a universal conditional and relative typical smoothing operator. As the proof of Proposition 6.1 is quite lengthy, it can be instructive to consider a simpler version of our typical smoothing operator which applies in the case where the Hamiltonians are trivial. We carry out this analysis in “Appendix E”.
Proof
(Proposition 6.1). First, we claim that we can assume and without loss of generality. Indeed, if either operator is not positive definite, then we can first construct the operator associated with modified operators and where all the zero eigenvalues of and are replaced by some arbitrary fixed strictly positive constant (e.g., one); we can then set , where (respectively ) is the projector onto the support of (respectively ). The operator constructed in this way satisfies all of the required properties. For the remainder of this proof we thus assume that and .
Let be the POVM constructed by Proposition 2.2 for . Similarly, let be the corresponding POVM constructed in Proposition 2.2 for . Also, as before, we denote by and by the projectors on the Schur–Weyl blocks labelled by the Young diagrams and . Let
| 61 |
Note that because is permutation-invariant, and because is permutation-invariant. Recall also that for the same reason. The operator is permutation-invariant by construction. Then, we have
| 62 |
recalling that the operators form a commuting set of projectors, and where in the third line the inner sum is taken to be the zero operator if no triplet satisfies the given constraints. This shows Property (i).
Now, consider any state , where R is any reference system, and assume that . Rewrite this condition as
| 63 |
We write
| 64 |
where we define
| 65 |
| 66a |
further noting that the conditions in the sum defining indeed imply that . We first consider . Define the projectors
| 66b |
| 67a |
| 67b |
| 67c |
and observe that
| 67d |
Thanks to Proposition 2.2, we have , recalling that , and hence
| 68 |
using Cauchy–Schwarz to assert that . Similarly, using Proposition 2.1, we have . Also, we have , and , yielding
| 69 |
| 70 |
| 71 |
We take all these ’s to be the same, by choosing if necessary the minimum of the four possibly different s. Hence, we have
| 72 |
Now we consider the term . We know that
| 73 |
| 74a |
| 74b |
| 74c |
recalling that . So, for each term in the sum (66b), we have
| 74d |
using the Cauchy–Schwarz inequality and because at least one of the four conditions is violated, causing at least one of the two the norms to decay exponentially (noting also that all commute). Because there are only at most terms, we have
![]() |
75 |
Hence, we have
| 76 |
proving Property (ii) for . Note that does not depend on the state . Now, we prove Property (iii). Using Lemma B.1 and dropping some subsystem indices for readability, we have
| 77 |
Recall that, using Proposition 2.2 and Lemma 2.2,
| 78 |
| 79 |
| 80 |
further recalling that and . Combining these together yields
| 81 |
Finally, suppose that , meaning that we can choose a simultaneous eigenbasis for and . Then the operator is a projector, as can be seen in (62) since in that case are all complete sets of projectors all elements of which commute pairwise between different sets. Furthermore, and both commute with all of these projectors and therefore also with .
Construction #3: Thermal Operations
Statement and proof sketch
We now present a construction of a universal thermodynamic implementation of a time-covariant i.i.d. process, using the framework of thermal operations instead of Gibbs-preserving maps.
Theorem 7.1
Let X be a quantum system, a Hermitian operator, , a completely positive, trace-preserving map satisfying
| 82 |
Let . Let be small enough and be large enough. Then, there exists an information battery W, a thermal operation , and battery states and such that:
-
(i)The effective work process associated with and satisfies
83 -
(ii)The work cost per copy satisfies
84
The main idea in the present construction is to first carry out a Stinespring dilation unitary explicitly using suitable ancillas as the environment system, and then to apply a conditional erasure process that resets the ancillas to a standard state while using the output of the process as side information. The idea of implementing a process in this fashion was also employed in Ref. [13].
Our core technical contribution for Construction #3 is to show how to build a thermodynamic protocol for universal conditional erasure, using the idea of position-based decoding [19, 49–55]. The assembly of the full thermal operation is slightly more involved than Constructions #1 and #2, because we cannot use Proposition 3.1. The construction will be illustrated in Figure 2, using a conditional erasure primitive whose construction is illustrated in Figure 1.
Fig. 2.
The conditional erasure procedure in Figure 1 can be used to construct an i.i.d. implementation of a given time-covariant process (Theorem 7.1). First we apply an energy-conserving Stinespring dilation of the process on all input copies, using a zero-initialized ancilla as environment system E for each copy. We then invoke the conditional erasure procedure to reset to the thermal state using as a memory, while extracting work using an information battery J. Here, the projector that can distinguish from is the universal conditional typical projector given by Proposition E.2. The fact that preserves the correlations between the memory (output systems ) and the reference ensures that the process is implemented accurately. The amount of work extracted by is but work has to be paid to prepare the initially pure ancillas, where . The overall work extracted is per copy
Fig. 1.
Construction of the thermal operation for universal conditional erasure using position-based decoding [19], illustrating the construction in the proof of Proposition 7.1 and Lemma 7.1. We define a map that acts on a system S to reset, a quantum memory M and a register J, which is promised to be initialized in the uniformly mixed state of rank for a fixed and known value of m. A state of the system and the memory is purified by a reference system R (not pictured). The map outputs the system S in a state close to the thermal state and the register J in a state close to the pure state , all while ensuring that remains unchanged (up to small errors), for all states in a given class of states . The routine is provided a POVM effect whose task is to distinguish from in a hypothesis test for all . As long as m is not too large (as determined by how well can perform this distinguishing), the procedure completes successfully. To implement (shaded region) we involve ancillas with , each initialized in the thermal state . Then S and are coherently swapped () conditioned on the value stored in J. If m is not too large, a POVM can infer the value j stored in J, up to a small error; the POVM is constructed from . We then coherently reset the J register to zero by conditioning on this outcome (up to a small error). The full procedure is a thermal operation where the ancillas are the heat bath and J is an information battery such that m work has been extracted in units of pure nats (see main text)
Universal conditional erasure
Conditional erasure is a task that is of independent interest because it generalizes Landauer’s erasure principle to situations where a quantum memory is available. A protocol for thermodynamic conditional erasure of a system using a memory as quantum side information was given in ref. [56] for trivial Hamiltonians. Here, we study the problem of finding a universal protocol for conditional erasure, whose accuracy is guaranteed for any input state on n copies of a system, and where the system and memory Hamiltonians can be arbitrary.
Definition 7.1
(Universal conditional erasure). Consider two systems S, M. Let be a fixed state, let be an arbitrary set of states on , and let . A universal conditional -erasure process of S using M as side information is a completely positive, trace non-increasing map such that for all , and writing a purification of , we have
| 85 |
We provide a thermodynamic protocol for universal conditional erasure.
Proposition 7.1
Let S, M be systems with Hamiltonians and let refer to the thermal state on S. Let be an arbitrary set of states on . Let such that is integer. Let be a Hermitian operator satisfying and , and assume that there exists such that for all we have
| 86 |
| 87a |
Then, there exists a thermal operation acting on the systems SM and an information battery J, such that the effective work process of with respect to the battery states is a universal conditional -erasure process with for the set of states , where is the convex hull of .
The proof of Proposition 7.1 is developed in the rest of this section. We start by reformulating the ideas of the convex-split lemma, the position-based decoding, and the catalytic decoupling schemes [19, 49–55] to form a protocol for universal conditional erasure. The underlying ideas of the following proposition are the same as, e.g., in Ref. [19]. Yet, our technical statement differs in some aspects and that is why we provide a proof for completeness. The setting is depicted in Fig. 1.
Lemma 7.1
(Conditional erasure unitary using position-based decoding). Consider two systems S, M and fix such that is integer. Let J be a large register of dimension at least , and choose a fixed basis . Now, let be any state, an arbitrary set of quantum states on , a Hermitian operator satisfying , and assume that there exists such that for all the conditions (87) hold. Furthermore, let be a collection of ancilla systems with each , and let be a copy of the full collection of ancilla systems. We write a purification of on as . Let be the convex hull of . Then, there exists a unitary operator satisfying the following property: For any reference system R, for any pure tripartite state with , and for any with , we have
| 87b |
where we have defined
| 88 |
and by the notation we refer to all systems except . Moreover, for any observables , such that , the unitary may be chosen such that , where .
Intuitively, we absorb the initial randomness present in the register J, e.g., given to us by the environment in a mixed state, and return it in a pure state; J can therefore be identified as an information battery. Similarly, A can be identified as a heat bath.
Proof
First observe that we can assume to be a convex set, because any convex combination of states in also satisfies the conditions (87). For the rest of the proof we assume without loss of generality that .
The operator W is defined in two steps. The first operation simply consists on conditionally swapping S with , depending on the value stored in J. Then, we infer again from MA which j we swapped S with, in order to coherently reset the register J back to the zero state (approximately). We define the first unitary operation as , acting on systems SAJ
| 89 |
where denotes the swap operator between the two designated systems. Observe that maps onto according to
| 90 |
The second step is more tricky. We need to infer from the systems MA alone which j was stored in J. Fortunately the answer is provided in the form of position-based decoding [19], using a pretty good measurement. Define
| 91 |
such that is a set of positive operators. We can form a POVM by normalizing the ’s as follows:
| 92 |
We would now like to lower bound . Following the proof of [19, Theorem 2], we first invoke the Hayashi–Nagaoka inequality [57], which states that for any operators , , we have
| 93 |
Applying this inequality with and we obtain
| 94 |
Now, let denote the SHIFT operation on the J register, modulo ; note that . We define
| 95 |
and we see that thanks to Proposition B.3. Then, we have
| 96 |
Thanks to Proposition C.1, the operator can be completed to a full unitary by using an extra qubit in the J register, and such that for all (with the convention that for forces the extra qubit to be in the zero state). So, recalling (95),
| 97 |
To prove the last part of the claim, let be observables such that and . Let and we write . For all j, we have
| 98 |
This implies that , and in turn , and thus also . Hence, we have
| 99 |
Clearly, , and hence . Using Proposition C.2 instead of Proposition C.1, we may further enforce , as required.
We now give the proof of Proposition 7.1.
Proof
(Proposition 7.1). Let be the energy-conserving unitary as in Lemma 7.1 and define the thermal operation
| 100 |
Identifying J as an information battery, the associated effective work process of with respect to is
| 101 |
Let and let be a purification of . We have that the state vector
| 102 |
is a purification of , where is an additional register. Similarly, the state vector
| 103 |
is a purification of . Then, with Uhlmann’s theorem we find
| 104 |
making use of (88).
Construction via universal conditional erasure
This section is devoted to the proof of Theorem 7.1. The strategy is to exploit the fact that time-covariant processes admit a Stinespring dilation with an energy-conserving unitary using an environment system with a separate Hamiltonian. This property enables us to map the problem of implementing such a process directly to a conditional erasure problem with a system and memory that are non-interacting.
The following lemma formalizes the property of time-covariant processes we make use of. Various proofs of this lemma can be found in [58, 59, Appendix B] and [60, Theorem 25].
Lemma 7.2
(Stinespring dilation of covariant processes [58–60]). Let X be a quantum system with Hamiltonian , and be a completely positive, trace-preserving map that is covariant with respect to time evolution. That is, for all t we have
| 105 |
Then, there exists a system E with Hamiltonian including an eigenstate of zero energy, as well as a unitary such that
| 106 |
as well as .
We provide an additional proof in “Appendix A”. The main idea behind the construction in the following proof of Theorem 7.1 is depicted in Fig. 2.
Proof
(Theorem 7.1) Thanks to Lemma 7.2, there exists an environment system E with Hamiltonian , as well as an energy-conserving unitary and a state of zero energy such that (107) holds. Let with . We define
| 107 |
Writing , we have that . By , we see that
| 108 |
Observe that for any such , we have
| 109 |
using the sub-additivity of the von Neumann entropy and the fact that relative entropy is positive for normalized states. Hence, we have .
Let
| 110 |
noting that for all , we have . Let be the universal typical and relative conditional operator furnished by Proposition 6.1, where and with . Since commutes with , Proposition 6.1 guarantees that is a projector which furthermore commutes with and . We proceed to show that can perform a hypothesis test between and . Recalling Definition 6.1 we have
| 111 |
with for some independent of and n. By construction we have , and so thanks to Point (iii) of Definition 6.1 we can compute
| 112 |
where we furthermore used the fact that commutes with and with . We therefore see using that
| 113 |
Let
| 114 |
such that by choosing .
Now let J be a register of dimension at least and let be the thermal operation furnished by Proposition 7.1 for , , , , m, , and as defined above. Here, we have assumed that , and that furthermore are small enough such that ; if instead then we can set and (which is a thermal operation) in the following.
We proceed to show that the effective work process of with respect to is close to the partial trace map in diamond distance. We invoke the post-selection technique (Theorem 2.1) to show this. Let be the de Finetti state which via (21) can be written as the convex combination of a finite number of i.i.d. states
| 115 |
Hence lies in the convex hull of , and from Proposition 7.1 and Definition 7.1 we see that for a purification of we have
| 116 |
Using along with Theorem 2.1 we find
| 117 |
We can start piecing together the full process. Our overall protocol needs to (a) bring in a heat bath , i.e., ancillas initialized in their thermal state, (b) prepare the states on the ancillas using an auxiliary information battery (denoted by below), (c) apply the energy-conserving unitary , (d) apply using an information battery J initialized in the state , and (e) discard the ancillas.
As explained in Sect. 3, there exists a thermal operation on the ancillas and an information battery along with battery states such that and with arbitrarily close to . Now let , , , and define
| 118 |
The map is a thermal operation because it is a concatenation of thermal operations. The overall heat bath is formed of the systems , the ancillas used in the implementation of , as well as the implicit heat bath used in the implementation of . The system is the information battery. We can verify that the associated effective work process with respect to is
| 119 |
where satisfies . Therefore for any fixed and for n large enough we have .
The associated work cost per copy satisfies
| 120 |
recalling (115), where accounts for the rounding error in (115) and a possible arbitrarily small difference between and , and recalling that as .
Discussion
Our results fits in the line of research extending results in thermodynamics from state-to-state transformations to quantum processes. Implementations of quantum processes are difficult to construct because they need to reproduce the correct correlations between the output and the reference system, and not only produce the correct output state. Here, we have seen that it is nevertheless possible to implement any quantum process at an optimal work cost: Any implementation that would use less work would violate the second law of thermodynamics on a macroscopic scale. As a special case this also provides an operational interpretation of the minimal entropy gain of a channel [35–42].
Our three constructions of optimal implementations of processes are valid in different settings, and it remains unclear if they can be unified in a single protocol that presents the advantages of all three constructions. Namely, is it possible to use a physically well-justified framework, e.g. thermal operations, to universally implement any i.i.d. process? We expect this to be possible only if an arbitrary amount of coherence is allowed, in analogy with the entanglement embezzling state required in the reverse Shannon theorem [22, 23].
Finally, the notion of quantum typicality that we have introduced in Definition 6.1 and Proposition 6.1 might be interesting in its own right. We anticipate that similar considerations might provide pathways to smooth other information-theoretic quantities [54, 61, 62] and to study the joint typicality conjecture [26, 63–66].
Acknowledgements
The authors thank Álvaro Alhambra, David Ding, Patrick Hayden, Rahul Jain, David Jennings, Martí Perarnau-Llobet, Mark Wilde, and Andreas Winter for discussions. PhF acknowledges support from the Swiss National Science Foundation (SNSF) through the Early PostDoc.Mobility Fellowship No. P2EZP2_165239 hosted by the Institute for Quantum Information and Matter (IQIM) at Caltech, from the IQIM which is a National Science Foundation (NSF) Physics Frontiers Center (NSF Grant PHY-1733907), from the Department of Energy Award DE-SC0018407, from the Swiss National Science Foundation (SNSF) through the NCCR QSIT and through Project No. 200020_16584, and from the Deutsche Forschungsgemeinschaft (DFG) Research Unit FOR 2724. FB is supported by the NSF. This work was completed prior to MB and FB joining the AWS Center for Quantum Computing. Funding Open Access funding enabled and organized by Projekt DEAL.
Appendix
A Missing proofs
Proof
(Lemma 2.2). A useful expression for may be obtained following [25, Section V]
| 121 |
recalling that commutes with any i.i.d. state, with and using bounds on and derived in Ref. [25]. Here, denotes the Haar measure over all unitaries acting on , normalized such that . We then have
| 122 |
Observe that for any state , we have
| 123 |
as derived e.g. in [25, Eq. (9)], and thus for any state ,
| 124 |
Hence, we get
| 125 |
as required.
Proof
(Proposition 2.1) The Fannes–Audenaert continuity bound [67, 68] of the entropy states that for any there exists such that for any quantum states with we have
| 126 |
and furthermore is monotonically strictly decreasing and if . Now, let , let be the inverse function of , and let . Consider the set of Young diagrams . For all , we have that thanks to the Fannes–Audenaert inequality. Then, we have
| 127 |
because all terms in the sum in the right hand side are included in the sum on the left hand side. We may now invoke [24, Eq. (6.23)] to see that
| 128 |
where .
Proof
(Proposition 2.2). The fact that there are only elements follows because there are only so many types. Property (ii) holds by definition. Property (iv) holds because is the minimum / maximum eigenvalue of in the subspace spanned by . Finally, we need to show Property (iii): This follows from a large deviation analysis. More precisely, let for be random variables where represents the measurement outcome of on the j-th system of the i.i.d. state . By Hoeffding’s inequality, we have that
| 129 |
where is the difference between the maximum and minimum eigenvalue of , and . Thus, the event consisting of the outcomes k satisfying happens with probability at least , proving (16).
Proof
(Proposition 2.3) We use the post-selection technique (Theorem 2.1) to bound the diamond norm distance between and . Let be the purification of the de Finetti state given by (21). Calculate
| 130 |
which implies, recalling that and that ,
| 131 |
and hence
| 132 |
Recalling the relations between the trace distance and the purified distance, and noting that these distance measures cannot increase under the partial trace, we obtain
| 133 |
The post-selection technique then asserts that
| 134 |
as claimed.
Proof
(Lemma 7.2). Let be any Stinespring dilation isometry of , such that . For the input state , consider the output state corresponding to first time-evolving by some time t, and then applying
| 135 |
Now, let us define . By the covariance property of both and have the same reduced state on . Hence, they are related by some unitary on the system E which in general depends on t
| 136 |
We have
| 137 |
so must define a representation of time evolution, at least on the support of the operator . Hence, we may write for some Hamiltonian , and from (137), we have for all t
| 138 |
Expanding for infinitesimal t we obtain
| 139 |
Let be an eigenvector of corresponding to the eigenvalue zero; if does not contain an eigenvector with eigenvalue equal to zero, we may trivially add a dimension to the system E to accommodate this vector. Then, the operator maps each state of a subset of energy levels of XE to a corresponding energy level of same energy on XE; it may thus be completed to a fully energy-preserving unitary . More precisely, let be a complete set of eigenvectors of with energies . Then is an eigenvector of of energy thanks to (140). We have two orthonormal sets and in which the j-th vector of each set has the same energy; we can thus complete these sets into two bases , of eigenvectors of , where the i-th element of either basis has exactly the same energy. This defines a unitary that is an extension of , and that satisfies all the conditions of the claim.
B. Technical Lemmas
Lemma B.1
(Pinching-like operator inequality). Let be a collection of M operators and . Then, we have
| 140 |
Proof
Call our system S and consider an additional register C of dimension , and let . Then, we have
| 141 |
using .
Lemma B.2
(Gentle measurement). Let be a sub-normalized quantum state and . For we then have
| 142 |
This is a cruder statement than that of, e.g., [69, Lemma 7], allowing for a more straightforward proof.
Proof
We have
| 143 |
Then, we get .
Proposition B.3
(Controlled-unitary using a POVM). Let be a set of positive semi-definite operators on a system X satisfying , be a collection of unitaries on a system Y, and
| 144 |
Then, we have .
Proof
Using an additional register K, define
| 145 |
Then, we have . Clearly, because and have the same non-zero eigenvalues. Now, let
| 146 |
Because the middle term in parentheses is unitary, we manifestly have .
C. Dilation of Energy-Conserving Operators to Unitaries
This appendix collects a few technical lemmas on constructing an energy-conserving unitary that extends a given operator of norm less than one.
Proposition C.1
Let be an operator on a system X, such that . Then, there exists a unitary operator acting on X and a qubit Q such that for any ,
| 147 |
That is, any operator W with can be dilated to a unitary, with a post-selection on the output.
Proof
Setting , we see that , and hence is an isometry. We can complete this isometry to a unitary that acts as V on the support of and that maps the the support of onto the complementary space to the image of V. It then follows that for any , we have , and the claim follows.
Proposition C.2
Let X be a quantum system with Hamiltonian and be an operator with as well as . Then, there exists a unitary operator acting on X and a qubit Q with , that satisfies such that
| 148 |
That is, any energy-preserving operator W with can be dilated to an energy-preserving unitary on an ancilla with a post-selection on the output.
Proof
First we calculate . This implies that , as and have the same eigenspaces. We define
| 149 |
The operator is an isometry, because . Furthermore, we have
| 150 |
| 151 |
and thus we find . Let be an eigenbasis of , and let , noting that both and have the same energy. The two collections of vectors and can thus be completed into two bases and of eigenvectors of where the i-th element of both bases have the same energy. Define finally , noting that by construction and .
D. Robust Counterexample Against Extensions of Construction #1
In this appendix we show that the counterexample of Sect. 5.2 is robust to small errors on the process. The process is , where with energy eigenstates of respective energies , ; we write and . The initial state on X and a reference system is the maximally entangled state .
We seek a map such that
| 152 |
for a that is independent of . Here we have and .
Let . From (153) we find , which in turn implies that , and hence that for some Hermiticity preserving map satisfying .
Let be the positive and negative parts of , noting that , defining as the transpose of onto the system , and continuing the computation we obtain , using the fact that .
To complete this argument we define the hypothesis testing relative entropy [70–74] in its form as presented in [75]. For any sub-normalized quantum state and for any positive semi-definite operator whose support contains the support of , we define it via the following equivalent optimizations, which are semi-definite programs [76] in terms of the primal variable and the dual variables :
| 153 |
The condition implies that . Hence, we have that . Hence, for any to be fixed later, is feasible for the dual problem (154) defining the hypothesis testing entropy , and . Thus, we have . Choosing yields .
On the other hand, by definition we have for any satisfying ; with we obtain and thus .
Then, . Now let be the optimal candidate in the coherent relative entropy . We finally see that the transformation may require arbitrarily much energy if , even for a small , since
| 154 |
E. Universal Conditional Typical Projector for Trivial Hamiltonians
In the case of trivial Hamiltonians, Definition 6.1 can be simplified. We call the corresponding object a universal conditional typical projector
Definition E.1
Consider two systems with Hilbert spaces and let . We define a universal conditional typical projector with parameter as a projector acting on such that:
-
(i)There exists independent of n such that for any quantum state with , we have
155 -
(ii)
.
Observe that we choose to define the object in Definition E.1 as a projector whereas we only require the object in Definition 6.1 to be an operator of norm at most 1. The reason is that while we can prove that a projector satisfying the conditions of Definition E.1 exists, we are currently not able to guarantee the existence of a projector satisfying the criteria of Definition 6.1.
Proposition E.2
Consider two systems A, B and let . For any and there exists a universal conditional typical projector that is permutation-invariant.
The proof of Proposition E.2 is developed in the rest of this appendix. To understand why the projector of Definition E.1 is conditional—as well as for a simple illustration of its use—consider the smooth Rényi-zero conditional max-entropy, also known as the smooth alternative max-entropy [11]. It is defined for a bipartite state as
| 156 |
where is the projector onto the support of , and where the optimization ranges over sub-normalized states which are -close to in purified distance. We may understand the i.i.d. behaviour of this quantity as follows. For and let be a universal conditional typical projector with . We define . Then, we have for large enough, thanks to Property (i) and the gentle measurement lemma (Lemma B.2). On the other hand, using Property (ii) we have
| 157 |
such that taking the limits and , we get that the smooth Rényi-zero conditional entropy is asymptotically upper bounded by the von Neumann conditional entropy in the i.i.d. regime.
We proceed to construct a universal conditional typical projector based on ideas from Schur–Weyl duality. The construction presented here is similar to, and inspired by, techniques put forward in earlier work [22, 24–26, 47, 48].
Proof
(Proposition E.2) Let
| 158 |
where the respective projectors , refer to Schur–Weyl decompositions of and of , respectively, and . Observe that is a projector: Each term in the sum is a projector as a product of two commuting projectors (Lemma 2.1), and each term of the sum acts on a different subspace of . The projector corresponds to the measurement of the two commuting POVMs and , and testing whether or not the event is satisfied. Also by construction is permutation-invariant.
For any with , the probability that the measurement of fails on can be upper bounded as follows. The passing event is implied in particular by the two events (a) and (b) happening simultaneously, recalling that . The probability of event (a) failing is
| 159 |
as given by Proposition 2.1, and similarly for event (b)
| 160 |
We can use the same in both cases by picking the lesser of the two values given by Proposition 2.1, if necessary. Note furthermore that does not depend on . Hence with this , for any we have
| 161 |
as required.
For the second property, we use Lemma 2.2 to write
| 162 |
recalling that there are only many possible Young diagrams and hence at most so many terms in the sum.
F. Universal Conditional Erasure for n Copies and Trivial Hamiltonians
Corollary F.1
(Thermodynamic protocol for universal conditional erasure for n copies). Let S, M be systems, let be the maximally mixed state on S. Let , where is the dimension of S, and let small enough. Let be large enough. Let J be a large enough information battery and let any such that is integer.
Then, there exists and a thermal operation acting on the systems , such that the effective work process of with respect to the battery states is a universal conditional -erasure process resetting to the state with respect to the set of states , where is the convex hull of .
The case where is uninteresting as we cannot hope to extract any work. In such cases one can simply set and take to be the thermal operation that completely thermalizes .
Proof
This is in fact a relatively straightforward application of Proposition 7.1 over n copies of SM. Let be given by Proposition E.2. We seek that satisfy (87). We can choose thanks to Definition E.1. Furthermore for any we have
| 163 |
and thus we may take . Finally, is given as .
Footnotes
Publisher's Note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
References
- 1.Goold J, Huber M, Riera A, del Rio L, Skrzypczyk P. The role of quantum information in thermodynamics—a topical review. J. Phys. A: Math. Theor. 2016;49(14):143001. doi: 10.1088/1751-8113/49/14/143001. [DOI] [Google Scholar]
- 2.Brandão FGSL, Horodecki M, Oppenheim J, Renes JM, Spekkens RW. Resource theory of quantum states out of thermal equilibrium. Phys. Rev. Lett. 2013;111(25):250404. doi: 10.1103/PhysRevLett.111.250404. [DOI] [PubMed] [Google Scholar]
- 3.Brandão F, Horodecki M, Ng N, Oppenheim J, Wehner S. The second laws of quantum thermodynamics. Proc. Natl. Acad. Sci. 2015;112(11):3275. doi: 10.1073/pnas.1411728112. [DOI] [PMC free article] [PubMed] [Google Scholar]
- 4.Chitambar E, Gour G. Quantum resource theories. Rev. Mod. Phys. 2019;91(2):025001. doi: 10.1103/RevModPhys.91.025001. [DOI] [Google Scholar]
- 5.Janzing D, Wocjan P, Zeier R, Geiss R, Beth T. Thermodynamic cost of reliability and low temperatures: tightening Landauer’s principle and the second law. Int. J. Theor. Phys. 2000;39(12):2717. doi: 10.1023/A:1026422630734. [DOI] [Google Scholar]
- 6.Faist P, Oppenheim J, Renner R. Gibbs-preserving maps outperform thermal operations in the quantum regime. New J. Phys. 2015;17(4):043003. doi: 10.1088/1367-2630/17/4/043003. [DOI] [Google Scholar]
- 7.Åberg J. Truly work-like work extraction via a single-shot analysis. Nat. Commun. 2013;4:1925. doi: 10.1038/ncomms2712. [DOI] [PubMed] [Google Scholar]
- 8.Horodecki M, Oppenheim J. Fundamental limitations for quantum and nanoscale thermodynamics. Nat. Commun. 2013;4:2059. doi: 10.1038/ncomms3059. [DOI] [PubMed] [Google Scholar]
- 9.Renner, R.: Security of quantum key distribution. Ph.D. thesis, ETH Zürich (2005). 10.3929/ethz-a-005115027
- 10.Tomamichel, M.: A framework for non-asymptotic quantum information theory. Ph.D. thesis, ETH Zurich (2012). 10.3929/ethz-a-7356080
- 11.Tomamichel M. Quantum Information Processing with Finite Resources. Berlin: Springer; 2016. [Google Scholar]
- 12.Chubb CT, Tomamichel M, Korzekwa K. Beyond the thermodynamic limit: finite-size corrections to state interconversion rates. Quantum. 2018;2:108. doi: 10.22331/q-2018-11-27-108. [DOI] [Google Scholar]
- 13.Faist P, Dupuis F, Oppenheim J, Renner R. The minimal work cost of information processing. Nat. Commun. 2015;6:7669. doi: 10.1038/ncomms8669. [DOI] [PMC free article] [PubMed] [Google Scholar]
- 14.îrstoiu, C., Jennings, D.: Global and local gauge symmetries beyond lagrangian formulations (2017). arXiv:1707.09826
- 15.Ben Dana K, García Díaz M, Mejatty M, Winter A. Resource theory of coherence: beyond states. Phys. Rev. A. 2017;95(6):062327. doi: 10.1103/PhysRevA.95.062327. [DOI] [Google Scholar]
- 16.Faist P, Renner R. Fundamental work cost of quantum processes. Phys. Rev. X. 2018;8(2):021011. doi: 10.1103/PhysRevX.8.021011. [DOI] [Google Scholar]
- 17.Smith, G.: Quantum channel capacities. In: IEEE Information Theory Workshop, pp. 1–5 (2010). 10.1109/CIG.2010.5592851
- 18.Christandl M, König R, Renner R. Postselection technique for quantum channels with applications to quantum cryptography. Phys. Rev. Lett. 2009;102(2):20504. doi: 10.1103/PhysRevLett.102.020504. [DOI] [PubMed] [Google Scholar]
- 19.Anshu A, Jain R, Warsi NA. Building blocks for communication over noisy quantum networks. IEEE Trans. Inf. Theory. 2019;65(2):1287. doi: 10.1109/TIT.2018.2851297. [DOI] [Google Scholar]
- 20.Faist P, Berta M, Brandão F. Thermodynamic capacity of quantum processes. Phys. Rev. Lett. 2019;122(20):200601. doi: 10.1103/PhysRevLett.122.200601. [DOI] [PubMed] [Google Scholar]
- 21.Navascués M, García-Pintos LP. Nonthermal quantum channels as a thermodynamical resource. Phys. Rev. Lett. 2015;115(1):010405. doi: 10.1103/PhysRevLett.115.010405. [DOI] [PubMed] [Google Scholar]
- 22.Bennett CH, Devetak I, Harrow AW, Shor PW, Winter A. The quantum reverse Shannon theorem and resource tradeoffs for simulating quantum channels. IEEE Trans. Inf. Theory. 2014;60(5):2926. doi: 10.1109/TIT.2014.2309968. [DOI] [Google Scholar]
- 23.Berta M, Christandl M, Renner R. The quantum reverse Shannon theorem based on one-shot information theory. Commun. Math. Phys. 2011;306(3):579. doi: 10.1007/s00220-011-1309-7. [DOI] [Google Scholar]
- 24.Harrow, A.W.: Applications of coherent classical communication and the Schur transform to quantum information theory. Ph.D. thesis, Massachusetts Institute of Technology (2005)
- 25.Haah J, Harrow AW, Ji Z, Wu X, Yu N. Sample-optimal tomography of quantum states. IEEE Trans. Inf. Theory. 2017;63(9):5628. doi: 10.1109/TIT.2017.2719044. [DOI] [Google Scholar]
- 26.Nötzel, J.: A solution to two party typicality using representation theory of the symmetric group (2012). arXiv:1209.5094
- 27.Tomamichel M, Colbeck R, Renner R. Duality between smooth min-and max-entropies. IEEE Trans. Inf. Theory. 2010;56(9):4674. doi: 10.1109/TIT.2010.2054130. [DOI] [Google Scholar]
- 28.Nielsen MA, Chuang IL. Quantum Computation and Quantum Information. Cambridge: Cambridge University Press; 2000. [Google Scholar]
- 29.Szilard L. über die Entropieverminderung in einem thermodynamischen System bei Eingriffen intelligenter Wesen. Z. Phys. 1929;53(11–12):840. doi: 10.1007/BF01341281. [DOI] [Google Scholar]
- 30.Boyd SP, Vandenberghe L. Convex Optimization. Cambridge: Cambridge University Press; 2004. [Google Scholar]
- 31.Pitchford, A., Granade, C., Nation, P.D., Johansson, R.J.: QuTip4.1.0 (2016). http://qutip.org
- 32.Johansson J, Nation P, Nori F. QuTiP 2: a Python framework for the dynamics of open quantum systems. Comput. Phys. Commun. 2013;184(4):1234. doi: 10.1016/j.cpc.2012.11.019. [DOI] [Google Scholar]
- 33.Andersen, M.S., Dahl, J., Vandenberghe., L.: CVXOPT 1.1.9 (2016). https://cvxopt.org/
- 34.Ramakrishnan N, Iten R, Scholz VB, Berta M. Computing quantum channel capacities. IEEE Trans. Inf. Theory. 2021;67(2):946. doi: 10.1109/TIT.2020.3034471. [DOI] [Google Scholar]
- 35.Alicki, R.: Isotropic quantum spin channels and additivity questions (2004). arXiv:quant-ph/0402080
- 36.Devetak I, Junge M, King C, Ruskai MB. Multiplicativity of completely bounded p-norms implies a new additivity result. Commun. Math. Phys. 2006;266(1):37. doi: 10.1007/s00220-006-0034-0. [DOI] [Google Scholar]
- 37.Holevo, A.S.: The entropy gain of quantum channels. In Proceedings of the 2011 IEEE International Symposium on Information Theory. IEEE, pp. 289–292 (2011). 10.1109/ISIT.2011.6034107
- 38.Holevo AS. The entropy gain of infinite-dimensional quantum evolutions. Dokl. Math. 2010;82(2):730. doi: 10.1134/S1064562410050133. [DOI] [Google Scholar]
- 39.Holevo AS. On the Choi-Jamiolkowski correspondence in infinite dimensions. Theor. Math. Phys. 2011;166(1):123. doi: 10.1007/s11232-011-0010-5. [DOI] [Google Scholar]
- 40.Holevo AS. Quantum Systems, Channels, Information. Berlin: De Gruyter; 2012. [Google Scholar]
- 41.Buscemi F, Das S, Wilde MM. Approximate reversibility in the context of entropy gain, information gain, and complete positivity. Phys. Rev. A. 2016;93(6):062314. doi: 10.1103/PhysRevA.93.062314. [DOI] [Google Scholar]
- 42.Gour, G., Wilde, M.M.: Entropy of a quantum channel: definition, properties, and application. In Proceedings of the 2020 IEEE International Symposium on Information Theory. IEEE, pp. 1903–1908 (2020). 10.1109/ISIT44484.2020.9174135
- 43.Berta M, Renes JM, Wilde MM. Identifying the information gain of a quantum measurement. IEEE Trans. Inf. Theory. 2014;60(12):7987. doi: 10.1109/TIT.2014.2365207. [DOI] [Google Scholar]
- 44.Faist, P.: Quantum coarse-graining: An information-theoretic approach to thermodynamics. Ph.D. thesis, ETH Zürich (2016). 10.3929/ethz-a-010695790
- 45.Morgan C, Winter A. “Pretty strong” converse for the quantum capacity of degradable channels. IEEE Trans. Inf. Theory. 2014;60(1):317. doi: 10.1109/TIT.2013.2288971. [DOI] [Google Scholar]
- 46.Tomamichel M, Colbeck R, Renner R. A fully quantum asymptotic equipartition property. IEEE Trans. Inf. Theory. 2009;55(12):5840. doi: 10.1109/TIT.2009.2032797. [DOI] [Google Scholar]
- 47.Bjelakovic, I., Siegmund-Schultze, R.: Quantum Stein’s lemma revisited, inequalities for quantum entropies, and a concavity theorem of Lieb (2003). arXiv:quant-ph/0307170
- 48.Berta M, Lemm M, Wilde MM. Monotonicity of quantum relative entropy and recoverability. Quantum Inf. Comput. 2015;15(15&16):1333. [Google Scholar]
- 49.Anshu A, Devabathini VK, Jain R. Quantum communication using coherent rejection sampling. Phys. Rev. Lett. 2017;119(12):120506. doi: 10.1103/PhysRevLett.119.120506. [DOI] [PubMed] [Google Scholar]
- 50.Anshu A, Jain R, Warsi NA. A one-shot achievability result for quantum state redistribution. IEEE Trans. Inf. Theory. 2018;64(3):1425. doi: 10.1109/TIT.2017.2776112. [DOI] [Google Scholar]
- 51.Anshu A, Jain R, Warsi NA. A generalized quantum Slepian–Wolf. IEEE Trans. Inf. Theory. 2018;64(3):1436. doi: 10.1109/TIT.2017.2786348. [DOI] [Google Scholar]
- 52.Anshu A, Jain R, Warsi NA. Convex-split and hypothesis testing approach to one-shot quantum measurement compression and randomness extraction. IEEE Trans. Inf. Theory. 2019;65(9):5905. doi: 10.1109/TIT.2019.2915242. [DOI] [Google Scholar]
- 53.Majenz C, Berta M, Dupuis F, Renner R, Christandl M. Catalytic decoupling of quantum information. Phys. Rev. Lett. 2017;118(8):080503. doi: 10.1103/PhysRevLett.118.080503. [DOI] [PubMed] [Google Scholar]
- 54.Anshu A, Berta M, Jain R, Tomamichel M. Partially smoothed information measures. IEEE Trans. Inf. Theory. 2020;66(8):5022. doi: 10.1109/TIT.2020.2981573. [DOI] [Google Scholar]
- 55.Berta M, Majenz C. Disentanglement cost of quantum states. Phys. Rev. Lett. 2018;121:190503. doi: 10.1103/PhysRevLett.121.190503. [DOI] [PubMed] [Google Scholar]
- 56.del Rio L, Åberg J, Renner R, Dahlsten O, Vedral V. The thermodynamic meaning of negative entropy. Nature. 2011;474(7349):61. doi: 10.1038/nature10123. [DOI] [PubMed] [Google Scholar]
- 57.Hayashi M, Nagaoka H. General formulas for capacity of classical-quantum channels. IEEE Trans. Inf. Theory. 2003;49(7):1753. doi: 10.1109/TIT.2003.813556. [DOI] [Google Scholar]
- 58.Scutaru H. Some remarks on covariant completely positive linear maps on C*-algebras. Rep. Math. Phys. 1979;16(1):79. doi: 10.1016/0034-4877(79)90040-5. [DOI] [Google Scholar]
- 59.Keyl M, Werner RF. Optimal cloning of pure states, testing single clones. J. Math. Phys. 1999;40(7):3283. doi: 10.1063/1.532887. [DOI] [Google Scholar]
- 60.Marvian Mashhad, I.: Symmetry, asymmetry and quantum information. Ph.D. thesis, University of Waterloo (2012). https://hdl.handle.net/10012/7088
- 61.Fang K, Wang X, Tomamichel M, Berta M. Quantum channel simulation and the channel’s smooth max-information. IEEE Trans. Inf. Theory. 2020;66(4):2129. doi: 10.1109/TIT.2019.2943858. [DOI] [Google Scholar]
- 62.Gour G, Winter A. How to quantify a dynamical quantum resource. Phys. Rev. Lett. 2019;123:150401. doi: 10.1103/PhysRevLett.123.150401. [DOI] [PubMed] [Google Scholar]
- 63.Dutil, N.: Multiparty quantum protocols for assisted entanglement distillation. Ph.D. thesis, McGill University, Montréal (2011)
- 64.Drescher, L., Fawzi, O.: On simultaneous min-entropy smoothing. In 2013 IEEE International Symposium on Information Theory. IEEE, pp. 161–165 (2013). 10.1109/ISIT.2013.6620208
- 65.Sen, P.: A one-shot quantum joint typicality lemma (2018). arXiv:1806.07278
- 66.Anshu A, Berta M, Jain R, Tomamichel M. A minimax approach to one-shot entropy inequalities. J. Math. Phys. 2019;60:122201. doi: 10.1063/1.5126723. [DOI] [Google Scholar]
- 67.Fannes M. Distillation of local purity from quantum states. Commun. Math. Phys. 1973;31(4):291. doi: 10.1007/BF01646490. [DOI] [Google Scholar]
- 68.Audenaert KMR. A sharp continuity estimate for the von Neumann entropy. J. Phys. A: Math. Theor. 2007;40(28):8127. doi: 10.1088/1751-8113/40/28/S18. [DOI] [Google Scholar]
- 69.Berta M, Christandl M, Colbeck R, Renes JM, Renner R. Entropic uncertainty and measurement reversibility. Nat. Phys. 2010;6(9):659. doi: 10.1038/nphys1734. [DOI] [Google Scholar]
- 70.Wang L, Renner R. One-shot classical-quantum capacity and hypothesis testing. Phys. Rev. Lett. 2012;108(20):200501. doi: 10.1103/PhysRevLett.108.200501. [DOI] [PubMed] [Google Scholar]
- 71.Tomamichel M, Hayashi M. A hierarchy of information quantities for finite block length analysis of quantum tasks. IEEE Trans. Inf. Theory. 2013;59(11):7693. doi: 10.1109/TIT.2013.2276628. [DOI] [Google Scholar]
- 72.Matthews W, Wehner S. Finite blocklength converse bounds for quantum channels. IEEE Trans. Inf. Theory. 2014;60(11):7317. doi: 10.1109/TIT.2014.2353614. [DOI] [Google Scholar]
- 73.Buscemi F, Datta N. The quantum capacity of channels with arbitrarily correlated noise. IEEE Trans. Inf. Theory. 2010;56(3):1447. doi: 10.1109/TIT.2009.2039166. [DOI] [Google Scholar]
- 74.Brandão FGSL, Datta N. One-shot rates for entanglement manipulation under non-entangling maps. IEEE Trans. Inf. Theory. 2011;57(3):1754. doi: 10.1109/TIT.2011.2104531. [DOI] [Google Scholar]
- 75.Dupuis, F., Kraemer, L., Faist, P., Renes, J.M., Renner, R.: Generalized entropies. In: XVIIth international congress on mathematical physics, pp. 134–153 (2013). 10.1142/9789814449243_0008
- 76.Watrous J. Semidefinite programs for completely bounded norms. Theory Comput. 2009;5(11):217. doi: 10.4086/toc.2009.v005a011. [DOI] [Google Scholar]



