Skip to main content
Springer logoLink to Springer
. 2021 May 28;384(3):1709–1750. doi: 10.1007/s00220-021-04107-w

Thermodynamic Implementations of Quantum Processes

Philippe Faist 1,2,3,✉, Mario Berta 1,4,5, Fernando G S L Brandao 1,5
PMCID: PMC8550554  PMID: 34776522

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 tr[ρ]=1. A sub-normalized quantum state is a positive semi-definite operator ρ satisfying tr[ρ]⩽1. To each system S is associated a standard basis, usually denoted by {|k⟩S}. For any two systems A,A′, we denote by A≃A′ 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., idA→A′(|k⟩⟨k|A)=|k⟩⟨k|A′ for all k, where idA→A′ denotes the identity process. For any two systems A≃A′, we define the non-normalized maximally entangled reference ket |Φ⟩A:A′=∑k|k⟩A⊗|k⟩A′. Matrix inequalities are with respect to the positive semi-definite cone: A⩽B signifies that B-A is positive semi-definite. A completely positive map EX→X′ is a linear mapping that maps Hermitian operators on X to Hermitian operators on X′ and that satisfies EX→X′(ΦX:RX)⩾0, where RX≃X. The adjoint EX←X′† of a completely positive map EX→X′ is the unique completely positive map X′→X that satisfies tr[E(Y)Z]=tr[YE†(Z)] for all operators Y, Z. A completely positive map EX→X′ is trace-preserving if E†(1X′)=1X and trace non-increasing if E†(1X′)⩽1X.

Proximity of quantum states can be measured by the fidelity F(ρ,σ)=‖ρσ‖1, where the one-norm of an operator is defined as ‖A‖1=tr[A†A]. The fidelity is extended to sub-normalized states ρ,σ as the generalized fidelity, F¯(ρ,σ)=‖ρσ‖1+(1-tr[ρ])(1-tr[σ]), noting that F(·,·)=F¯(·,·) whenever at least one of the states is normalized. An associated metric can be defined for any sub-normalized states as P(ρ,σ)=1-F¯2(ρ,σ), 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 D(ρ,σ)=12‖ρ-σ‖1. We note that the one-norm of a Hermitian operator A can be expressed as

‖A‖1=max‖Z‖∞⩽1tr[ZA]=minΔ±⩾0A=Δ+-Δ-tr[Δ+]+tr[Δ-], 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

D(ρ,σ)⩽P(ρ,σ)⩽2D(ρ,σ). 2

Similarly, we may define a distance measure for channels: For two completely positive, trace non-increasing maps TX→X′ and TX→X′′, the diamond norm distance is defined as

12TX→X′-TX→X′′⋄=maxσXRD(TX→X′(σXR),TX→X′′(σXR)), 3

where the optimization ranges over all bipartite quantum states over X and a reference system R≃X. The optimization may be restricted to pure states without loss of generality.

Entropy measures

The von Neumann entropy of a quantum state ρ is H(ρ)=-tr[ρlnρ]. In this work, all entropies are defined in units of nats, using the natural logarithm ln(·), instead of units of (qu)bits. A number of nats is equal to ln(2) times the corresponding number of qubits. The conditional von Neumann entropy of a bipartite state ρAB is given by

H(A|B)ρ=H(AB)ρ-H(B)ρ=H(ρAB)-H(ρB). 4

The quantum relative entropy is defined as

D(ρ‖σ)=tr[ρ(lnρ-lnσ)], 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 HA and n∈N. The group GL(dA)×Sn acts naturally on HA⊗n, where X∈GL(dA) acts as X⊗n 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

HA≃⨁λVλ=⨁λQλ⊗Pλ, 6

where λ∈Young(n,d) are Young diagrams with n boxes and (at most) d rows, and where Qλ, Pλ are irreducible representations of GL(dA) and Sn, respectively. The number of Young diagrams in the decomposition above is at most poly(n), if dA is kept constant. We write poly(n)=O(poly(n)) in big O notation for terms whose absolute value is upper bounded by some polynomial nc for c∈N in the asymptotic limit n→∞.

We denote by ΠAnλ the projector in HA⊗n onto the term labelled by λ in the decomposition above. We denote by qλ(X) a representing matrix of X∈GL(dA) in the irreducible representation labelled by λ; the operator qλ(X) lives in Qλ. We furthermore introduce the following notation, for any Y∈Qλ⊗Pλ,

[Y]λ=1(Qλ⊗Pλ)→AnY1(Qλ⊗Pλ)←An†, 7

which represents the canonical embedding of an operator Y on Qλ⊗Pλ into the space HA⊗n, i.e., mapping Y onto the corresponding block in (6). In particular,

ΠAnλ[Y]λΠAnλ=[Y]λ. 8

Any operator XAn acting on the n copies which commutes with all the permutations admits a decomposition of the form

XAn=∑λ[Xλ⊗1Pλ]λ 9

for some set of operators Xλ∈Qλ. In particular, [XAn,ΠAnλ]=0. We can make this more precise for i.i.d. states. For any X∈GL(dA), we have that

[ΠAnλ,X⊗n]=0 10
X⊗n=∑λ[qλ(X)⊗1Pλ]λ. 11

For a given λ∈Young(n,d), it is often useful to consider the corresponding normalized probability distribution λ/n=(λi/n)i. The entropy of this distribution is given by

H¯(λ)=H(λ/n)=-∑iλinlnλin, 12

where λi is the number of boxes in the i-th row of the diagram.

If we have n copies of a bipartite system HA⊗HB, then we may Schur–Weyl decompose HA⊗n, HB⊗n and (HA⊗HB)⊗n under the respective actions of GL(dA)×Sn, GL(dB)×Sn and GL(dAdB)×Sn. 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 HA,HB and let ΠAnBnλ and ΠAnλ′ be the projectors onto Schur–Weyl blocks of HAB⊗n and HA⊗n, respectively, with λ∈Young(dAdB,n) and λ′∈Young(dA,n). Then, we have

[ΠAnBnλ,ΠAnλ′⊗1Bn]=0. 13

Proof

ΠAnλ′⊗1Bn is invariant under the action of Sn permuting the copies of A⊗B, and so it admits a decomposition of the form (9) and commutes with ΠAnBnλ. □

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 n∈N copies of a bipartite system HA⊗HB. Then, for any λ∈Young(dAdB,n) and λ′∈Young(dB,n), we have

ΠBnλ′trAn[ΠAnBnλ]ΠBnλ′⩽poly(n)en(H¯(λ)-H¯(λ′))ΠBnλ′ 14

noting that [1An⊗ΠBnλ′,ΠAnBnλ]=0.

The proof is provided in “Appendix A”.

Estimating entropy

Measuring the Young diagram λ—that is, performing the projective measurement with operators {ΠAnλ}λ—yields a good estimation of the spectrum of a state ρA when given ρA⊗n [25]. An estimate for the entropy of ρ is thus obtained by calculating the entropy H(λ/n) corresponding to the probability distribution λ/n.

Proposition 2.1

(Spectrum and entropy estimation [22, 24, 25]). Consider n∈N copies of a system HA. Then, the family of projectors {ΠAnλ}λ given by Schur–Weyl duality forms a POVM obeying the following property: For any δ>0, there exists an η>0 such that for any state ρA, we have

tr∑λ:H¯(λ)∈[H(ρ)±δ]ΠAnλρA⊗n⩾1-poly(n)exp-nη. 15

The proof is provided in “Appendix A”.

Estimating energy

Proposition 2.2

Consider any observable HA on HA and write ΓA=e-HA. Then, the set of projectors RAnk onto the eigenspaces of ΓA⊗n forms a POVM satisfying the following properties:

  • (i)

    There are at most poly(n) POVM elements, with the label k running over a set k∈Kn(HA)⊂R;

  • (ii)

    We have [RAnk,ΓA⊗n]=0 and e-nkRAnk=RAnkΓA⊗n;

  • (iii)
    For any δ>0 and for any state ρA,
    trRAn≈δtr[ρAHA]ρA⊗n⩾1-2e-nηwithη=δ2/(2‖HA‖∞2), 16
    and where for any h∈R we define
    RAn≈δh=∑k∈Kn(HA):|k-h|⩽δRAnk. 17
  • (iv)
    For any h∈R, we have
    e-n(k+δ)RAn≈δh⩽RAn≈δhΓA⊗n⩽e-n(k-δ)RAn≈δh. 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 X,X′ be quantum systems, EX→X′ be a completely positive, trace-preserving map, and TXn→X′n be a completely positive, trace non-increasing map. Furthermore, let R¯≃X,

ζXn=trR¯n∫dϕXR¯|ϕ⟩⟨ϕ|XR¯⊗n=∫dσXσX⊗n, 19

where dϕXR¯ denotes the Haar-induced measure on the pure states on X⊗R¯, and dσX its induced measure on X after partial trace, and let |ζ⟩XnR be a purification of ζXn. Then, we have

12‖T-E⊗n‖⋄⩽poly(n)D(T(ζXnR),E⊗n(ζXnR)). 20

Moreover, for all n∈N there exists a set |ϕi⟩XR¯ of at most poly(n) states, and a probability distribution pi, providing a purification of ζXn as

|ζ⟩XnR¯nR′=∑ipi|ϕi⟩XR¯⊗n⊗|i⟩R′ 21

with a register R′ of size poly(n).

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 X,X′,E, let VX→X′E be an isometry and WXn→X′nEn be an isometry which commutes with the permutations of the n systems. Furthermore, assume that there exists η>0 independent of n such that for all pure states |σ⟩⟨σ|XRX with a reference system RX≃X, we have

Re⟨σ|XRX⊗n(VX←X′E†)⊗nWXn→X′nEn|σ⟩XRX⊗n⩾1-poly(n)exp(-nη). 22

For EX→X′(·)=trE[VX→X′E(·)V†] and TXn→X′n(·)=trEn[WXn→X′nEn(·)W†] we then have

12‖TXn→X′n-EX→X′⊗n‖⋄⩽poly(n)exp(-nη/2). 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 ΓS⩾0 is associated. A trace non-increasing, completely positive map ΦA→B is allowed for free if it satisfies ΦA→B(ΓA)⩽ΓB. In the case of a system S with Hamiltonian HS, and in the presence of a single heat bath at inverse temperature β, the relevant thermodynamic framework is given by setting ΓS=e-βHS. 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 ΓW is simply ΓW=1W (i.e., HW=0). The information battery is required to be in a state of the special form τWm=PWm/tr[PWm] where PWm is a projector of rank em. That is, τWm has uniform eigenvalues over a given rank em. We denote the charge or resource value of a battery state τWm by w(τWm)=ln(d)-m, where d is the dimension of the information battery. The value w(τ) 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 w(τ) in units of number of pure nats, equal to ln(2) 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 w=w(τ)-w(τ′).

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 kTln(2) 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 ln(2) factor: A number λ of pure nats can be converted into λkT 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 β-1=kT. Furthermore, this eliminates the factor β from otherwise essentially information-theoretic expressions, and our theorems thus directly apply to cases where ΓX,ΓX′ are any abstract positive semi-definite operators which are not necessarily defined via a Hamiltonian.

Let ΦXW→X′W be a Gibbs-preserving map acting on an information battery W, and let τWm, τWm′ be two information battery states. An implementation running the operation ΦXW→X′W with the given input and output battery states is tasked to (a) make available the input battery state, (b) apply the operation ΦXW→X′W, 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 {PWm′,1-PWm′}; as long as the first outcome is observed, it is always possible to bring the state to τWm′ by applying a completely thermalizing operation on the support of PWm′ (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 ϵ>0.

A convenient mathematical object to characterize what the operation does on the system is the following. The effective work process TX→X′F associated with ΦXW→X′W and (τWm,τWm′) is the trace non-increasing map defined as

TX→X′(·)=trWPWm′ΦXW→X′W((·)⊗τWm). 24

The question of implementing a process E becomes the issue of finding a Gibbs-preserving map along with battery states such that the associated effective work process is close to E. Specifically, if ‖TX→X′-EX→X′‖⋄⩽ϵ, 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 EX→X′ 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 ΓX,ΓX′⩾0, TX→X′ be a completely positive, trace non-increasing map, and w∈R. Then, the following are equivalent:

  • (i)

    We have TX→X′(ΓX)⩽ewΓX′;

  • (ii)

    For all δ>0 there exists an information battery W and two battery states τW,τW′ such that w(τW)-w(τW′)⩽w+δ, and there exists a Gibbs-preserving map ΦXW→X′W with TX→X′ the effective work process associated with ΦXW→X′W and (τW,τW′).

Therefore, to show that one can implement EX→X′ with Gibbs-preserving maps while expending work w, it suffices to exhibit a map TX→X′ that is ϵ-close to EX→X′ in diamond distance and that satisfies TX→X′(ΓX)⩽ewΓX′. From the proof in [16] we know in Point (ii) above that W, τW≡τWm and τW′≡τWm′ can be chosen freely as long as m′-m=w(τW)-w(τW′)⩾w and that the corresponding Gibbs-preserving map is given by

ΦXW→X′W(·)=TX→X′[trW(PWm(·))]⊗τWm′. 25

In Ref. [16], the resource cost w of implementing a process EX→X′ (any completely positive, trace-preserving map) up to an accuracy ϵ⩾0 in terms of proximity of the process matrix given a fixed input state σX, counted in pure nats, was shown to be given by the coherent relative entropy

w=-D^X→X′ϵ(EX→X′(σXRX)‖ΓX,ΓX′)=lnminT(ΓX)⩽αΓX′P(T(σXRX),E(σXRX))⩽ϵα, 26

where σXRX is the purification of σX on a system RX≃X given by |σ⟩XR=σX1/2|Φ⟩X:RX, and where the optimization ranges over completely positive, trace non-increasing maps TX→X′. 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 EX→X′ and quantum state σX we have for 0<ϵ<1 that

limn→∞1nD^Xn→X′nϵ(EX→X′⊗n(σXR⊗n)‖ΓX⊗n,ΓX′⊗n)=D(σX‖ΓX)-D(E(σX)‖ΓX′). 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 HS 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 HB and with any unitary USB satisfying [USB,HS+HB]=0, resulting in the completely positive, trace-preserving map

ΦS(·)=trB[USB((·)⊗γB)USB†], 28

where γB=e-βHB/tr[e-βHB] 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 ΦS leaves the thermal state γS=e-βHS/tr[e-βHS] 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 ΦXW→XW with respect to battery states (τWm,τWm′) 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 γX=e-βHX/tr[e-βHX] be the thermal state on a system X with Hamiltonian HX, and let |E⟩X be a pure energy eigenstate of HX. There exists a thermal operation ΦXW on an information battery with battery states (τW,τW′) such that ΦXW(γX⊗τW)=|E⟩⟨E|X⊗τW′ and such that w(τW)-w(τW′) can be chosen arbitrarily close to βE+lntr[e-βHX].

Thermodynamic Capacity

Definition

Let X,X′ be quantum systems, EX→X′ be a quantum process, and ϵ>0. We seek a free thermodynamic operation (either a thermal operation or a Gibbs preserving map) ΦXnW→X′nW that acts on X⊗n and a battery W, with output on X′⊗n and W, as well as information battery states τW(i) and τW(f), such that:

  • (i)

    The effective work process TXn→X′n of ΦXnW→X′nW with respect to τW(i),τW(f) is ϵ-close in diamond distance to EX→X′⊗n;

  • (ii)
    We seek to minimize the work consumption per copy w given by
    w=1nwτW(i)-wτW(f). 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 EX→X′ relative to operators ΓX,ΓX′>0 is defined as

T(E)=supσX{D(EX→X′(σX)‖ΓX′)-D(σX‖ΓX)}. 30

In a fully thermodynamic context where ΓX=e-βHX and ΓX′=e-βHX′′, one can choose to express the thermodynamic capacity in units of energy rather than in nats, in which case a pre-factor β-1 may be included in the definition above such that the thermodynamic capacity is a difference of free energies

T(E)=supσ{FH′(E(σ))-FH(σ)}withFH(ρ)=β-1D(ρ‖e-βH). 31

Construction for trivial Hamiltonians First, in Sect. 5 we consider the special case where ΓX=1X and ΓX′=1X′ corresponding to trivial Hamiltonians and show that simple considerations based on properties of known entropy measures guarantee the existence of a universal implementation of E⊗n with either thermal operations or Gibbs-preserving maps.

Construction using Gibbs-preserving maps Second, in Sect. 6 we consider the case of general ΓX,ΓX′ and we construct a universal implementation of EX→X′⊗n 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 EX→X′⊗n with thermal operations, assuming that E 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

D(EX→X′(σX)‖ΓX′)-D(σX‖ΓX)=-H(EX→X′(σX))+H(σX)-trEX→X′(σX)lnΓX′+trσXlnΓX=H(E|X′)ρ-trEX→X′(σX)lnΓX′+trσXlnΓX, 32

where we defined the state ρEX′=VX→X′EσXV† using a Stinespring dilation VX→X′E of EX→X′ into an environment system E, satisfying EX→X′(·)=trEV(·)V†. The conditional entropy is concave in the quantum state as H(E|X′)ρ=-D(ρEX′‖1E⊗ρX′) 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 σXR with a reference system R for any ΓR, on which the process acts as the identity process, we would be effectively computing T(E⊗idR). However, additivity implies that T(E⊗idR)=T(E).

Proposition 4.1

(Additivity of thermodynamic capacity [21]). For ΓX,ΓX′,ΓZ,ΓZ′>0 and quantum channels EX→X′, FZ→Z′ we have

T(E⊗F)=T(E)+T(F). 33

For completeness we provide an independent proof of additivity, to ensure validity in the general setting of abstract Γ operators.

Proof

Let σX,τZ be states achieving the thermodynamic capacity of T(E) and T(F), respectively. Then, σX⊗τZ is a candidate for T(E⊗F), yielding

T(E⊗F)⩾D(E(σ)⊗F(τ)‖ΓX′⊗ΓZ′)-D(σ⊗τ‖ΓX⊗ΓZ)=D(E(σ)‖ΓX′)-D(σ‖ΓX)+D(F(τ)‖ΓZ′)-D(τ‖ΓZ)=T(E)+T(F). 34

Now, let ζXZ achieve the optimum for T(E⊗F). Let VX→E1X′, WZ→E2Z′ be Stinespring isometries of E and F respectively, such that E(·)=trE1V(·)V† and F(·)=trE2W(·)W†. Let ρE1E2X′Z′=(V⊗W)ζ(V⊗W)†. Then, we have

T(E⊗F)=D((E⊗F)(ζ)‖ΓX′⊗ΓZ′)-D(ζXZ‖ΓX⊗ΓZ)=H(E1E2|X′Z′)ρ-trρX′Z′lnΓX′⊗ΓZ′+trζXZlnΓX⊗ΓZ,=H(E1E2|X′Z′)ρ-trρX′lnΓX′-trρZ′lnΓZ′+trζXlnΓX+trζZlnΓZ 35

since ln(A⊗B)=ln(A)⊗1+1⊗ln(B). Invoking the chain rule of the von Neumann entropy, and then strong sub-additivity of the entropy, we see that H(E1E2|X′Z′)ρ=H(E1|X′Z′)ρ+H(E2|E1X′Z′)ρ⩽H(E1|X′)ρ+H(E2|Z′)ρ. Hence, we have

(35)⩽H(E1|X′)ρ-trρX′ln(ΓX′)+trζXlnΓX+H(E2|Z′)ρ-trρZ′ln(ΓZ′)+trζZlnΓZ⩽T(E)+T(F), 36

where the last inequality holds because the reduced states ζX,ζZ are optimization candidates for T(E) and T(F), respectively. □

A special case worth mentioning is when ΓX=1X, ΓX′=1X′, which corresponds to the situation where the Hamiltonians of X and X′ are trivial. For any quantum channel EX→X′, let VX→X′E be a Stinespring dilation isometry with EX→X′·=trEV(·)V†. Then, we have

T(E)=supσH(σX)-H(E(σX))=supσH(E|X′)VσV†. 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 -T(E) 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 TXn→X′n on the systems that obeys T(ΓX⊗n)⩽enwΓX′⊗n. 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 ϵ>0, ΓX,ΓX′>0, EX→X′ a completely positive, trace-preserving map, and TXn→X′n a completely positive, trace non-increasing map such that we have ‖T-E⊗n‖⋄/2⩽ϵ. For w∈R such that TXn→X′n(ΓX⊗n)⩽enwΓX′⊗n, we have in the limit n→∞ that w⩾T(E).

Proof

Let T with 12‖E-T‖⋄⩽ϵ, σX be a quantum state, and |σ⟩XRX=σX1/2|Φ⟩X:RX. Then, by definition of the diamond norm it must hold that D(E(σXRX),T(σXRX))⩽ϵ, which implies that P(E(σXRX),T(σXRX))⩽2ϵ. We have that T is a valid optimization candidate for the definition of the coherent relative entropy and thus

-D^Xn→X′n2ϵ(EX→X′⊗n(σXRX⊗n)‖ΓX⊗n,ΓX′⊗n)⩽nw. 38

For n→∞, we can employ the asymptotic equipartition of the coherent relative entropy (27) to see that

D(E(σX)‖ΓX′)-D(σX‖ΓX)⩽w. 39

Since this inequality holds for all σX, we deduce that T(E)⩽w. □

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

WX→X′ϵ(EX→X′‖ΓX,ΓX′)=minT(ΓX)⩽ewΓX′12T-E⋄⩽ϵw, 40

where TX→X′ 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

1nWXn→X′nϵ(EXn→X′n⊗n‖ΓX⊗n,ΓX′⊗n). 41

Should this upper bound behave like T(E) to leading order, then the T 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 EX→X′ be a completely positive, trace-preserving map, and ϵ>0. Then we have

limn→∞1nWXn→X′nϵ(EXn→X′n⊗n‖1Xn,1X′n)=T(E), 42

where T(E)=maxσXH(σX)-H(E(σX)).

This implementation is constructed by taking the implicit optimal solution TXn→X′n in the semi-definite program (40) for 1nWXn→X′nϵ(EX→X′⊗n‖1Xn,1X′n), and using Proposition 3.1 to construct an associated Gibbs-preserving map acting on battery states via (25). In summary, for any δ′>0, for n large enough and choosing any m,m′ such that m-m′⩽nT(E)+δ′, the full implementation map in terms of TXn→X′n becomes

ΦXnW→X′nW(·)=TXn→X′n(trW[PWm(·)])⊗τWm′. 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

WXn→X′nϵ(EX→X′⊗n‖1Xn,1X′n)⩽-D^Xn→X′nϵ/poly(n)(EX→X′⊗n(ζXnRXn)‖1Xn,1X′n). 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

D^X→X′ϵ(ρX′RX‖1X,1X′)⩾-Hmaxcϵα(E|X′)ρ+g(ϵ), 45

where |ρ⟩X′RXE is a pure state, where c>0, 0<α<1, g(ϵ) are universal and do not depend on the state or the dimensions of the systems, and the smooth max-entropy is defined as

Hmaxϵ(E|X′)ρ=minP(ρ^,ρ)⩽ϵHmax(E|X′)ρ^;Hmax(E|X′)ρ^=max0≤ωX′≤1ln‖ρ^EX′1/2ωX′1/2‖12. 46

Thus, we have

(44)⩽Hmaxϵα/poly(n)(En|X′n)ρ+g(ϵ), 47

where ρX′nEn=VX→X′E⊗nζXn(V†)⊗n=∫dσ(VσV†)⊗n and VX→X′E is a Stinespring dilation isometry of EX→X′ as EX→X′(·)=trEVX→X′E(·)V†. At this point we invoke two facts. First, note that the de Finetti state can be written as a mixture of only poly(n) i.i.d. states, instead of a continuous average (Theorem 2.1): There exists a set {σi} of at most poly(n) states and a distribution {pi} such that ζXn=∑ipiσi⊗n. 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 ∑ipiρi is less than or equal to the maximum over the set of max-entropies corresponding to each ρi, plus a term proportional to the logarithm of the number of terms in the sum [45, Lemma 11]. Hence, with ρi=VσiV†, we get

(48)⩽maxiHmaxϵα/poly(n)(En|X′n)ρi⊗n+ln(poly(n))+g(ϵ). 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, limn→∞(1/n){ln(poly(n))+g(ϵ)}=0 and hence

limn→∞1nWXn→X′nϵ(EX→X′⊗n‖1Xn,1X′n)⩽maxiH(E|X′)ρi=maxiH(σi)-H(E(σi))⩽maxσH(σ)-H(E(σ))=T(E) 49

noting that H(E|X′)=H(EX′)-H(X′)=H(X)-H(X′). □

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

-D^X→X′ϵ(EX→X′(σXRX)‖ΓX,ΓX′)⩽?maxi-D^X→X′ϵ(EX→X′(σXRXi)‖ΓX,ΓX′)+(penalty), 50

where σX=∑piσXi and |σ⟩XR=σX1/2|Φ⟩X:RX, |σi⟩XR=(σXi)1/2|Φ⟩X:RX, and where the (penalty) term scales in a favourable way in n, say of order ln(poly(M)) 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 |0⟩,|1⟩ at corresponding energies E0=0 and E1>0. The corresponding Γ operator is Γ=g0|0⟩⟨0|+g1|1⟩⟨1| with g0=1, g1=e-βE1. Consider the process consisting in erasing the input and creating the output state |+⟩, where we define |±⟩=[|0⟩±|1⟩]/2. That is, we consider the process E(·)=tr[·]|+⟩⟨+|. Suppose the input state is maximally mixed, σ=1/2, such that ρX′RX=|+⟩⟨+|X′⊗1RX/2. If E0=0 and E1→∞, then this process requires a lot of work; intuitively, with probability 1/2 we start in the ground state |0⟩ and need to prepare the output state |+⟩ which has high energy.

For ϵ=0, we can see this because the input state is full rank, hence T=E; then E(Γ)=tr[Γ]|+⟩⟨+| and the smallest α such that E(Γ)⩽αΓ is given by

α/tr[Γ]=‖Γ-1/2|+⟩⟨+|Γ-1/2‖∞=⟨+|Γ-1|+⟩=(g0-1+g1-1)/2=(1+eβE1)/2⩾eβE1/2. 51

Noting that tr[Γ]⩾1, we have α⩾eβE1/2, and hence the energy cost of the transformation 1/2→|+⟩ is

energy cost=-β-1D^X→X′(EX→X′(σXRX)‖Γ,Γ)=β-1lnα⩾E1-β-1ln(2). 52

Clearly, this work cost can become arbitrarily large if E1→∞. 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 (-1) between the |0⟩ and |1⟩ 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 1/2→|+⟩ is very hard, but the individual transformations |±⟩→|+⟩ are trivial, noting that 1/2=(1/2)|+⟩⟨+|+(1/2)|-⟩⟨-|.

We show in “Appendix D” how to make the above claim robust against an accuracy tolerance ϵ≥0.

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 ΓX,ΓX′>0, EX→X′ be a completely positive, trace-preserving map, and ϵ>0. Then, for δ>0 and n∈N large enough there exists a completely positive map TXn→X′n such that:

  • (i)

    TXn→X′n is trace non-increasing;

  • i(ii)

    ‖TXn→X′n-EX→X′⊗n‖⋄⩽ϵ;

  • (iii)

    TXn→X′n(ΓX⊗n)⩽en[T(E)+4δ+n-1ln(poly(n))]ΓX′⊗n.

Note that we have n-1ln(poly(n))→0 as n→∞, and that we can take δ→0 after taking n→∞. Thanks to Proposition 3.1, the mapping TXn→X′n defines an implementation of the i.i.d. process EX→X′⊗n in terms of Gibbs-preserving maps and a battery, whose work cost rate is given to leading order by the thermodynamic capacity T(E) after taking δ→0.

As for Construction #1, the full Gibbs-preserving map implementing the required process is assembled in two steps, first constructing the map TXn→X′n in Theorem 6.1 and then using Proposition 3.1 to obtain the full Gibbs-preserving map. Let VX→X′E be a Stinespring dilation isometry of EX→X′. For δ>0, we introduce a universal conditional and relative typical smoothing operator MEnX′nx,δ (see later Definition 6.1 and Proposition 6.1) with x=-nT(E) and relative to ΓX′E≡VΓXV† and ΓX′. The map TXn→X′n is then constructed as

TXn→X′n(·)=trEnMEnX′nx,δVX→X′E⊗n(·)VX←X′E†⊗nMEnX′nx,δ†. 53

Finally, we employ Proposition 3.1 to construct an associated Gibbs-preserving map acting on battery states via (25). For any δ′>0, for n large enough and choosing any m,m′ such that m-m′⩽nT(E)+4δ+n-1lnpoly(n)+δ′, the full implementation map in terms of TXn→X′n becomes

ΦXnW→X′nW(·)=TXn→X′n(trW[PWm(·)])⊗τWm′. 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 ΓAB,ΓB′⩾0 and x∈R. A universal conditional and relative typical smoothing operator MAnBnx,δ with parameter δ>0 is an operator on AnBn that satisfies the following conditions:

  • (i)

    (MAnBnx,δ)†MAnBnx,δ⩽1 ;

  • (ii)
    There exists ξ>0 independent of n with the following property: For any pure state |ρ⟩ABR with ρAB (respectively ρB) in the support of ΓAB (respectively ΓB′) and such that D(ρAB‖ΓAB)-D(ρB‖ΓB′)⩾x, it holds that
    Re⟨ρ|ABR⊗nMAnBnx,δ|ρ⟩ABR⊗n⩾1-poly(n)exp(-nξ); 55
  • (iii)

    trAn[MAnBnx,δΓAB⊗n(MAnBnx,δ)†]⩽poly(n)e-n(x-4δ)ΓB′⊗n .

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 MAnBnx,δ preserves coherences when it is applied to a superposition of several states {|ρ⟩ABR⊗n}. This property would not have been ensured if instead, we had merely asserted that MAnBnx,δ|ρ⟩ABR⊗n and |ρ⟩ABR⊗n have high absolute value overlap or are close in fidelity. If MAnBnx,δ is a projector then the expression reduces to tr(MAnBnx,δρ) 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 ΓAB,ΓB′⩾0, x∈R, as well as n∈N and δ>0. There exists a universal conditional and relative typical smoothing operator MAnBnx,δ that is furthermore permutation-invariant. Moreover, if [ΓAB,1A⊗ΓB′]=0, then MAnBnx,δ can be chosen to be a projector satisfying [MAnBnx,δ,ΓB′⊗n]=0 and [MAnBnx,δ,ΓAB⊗n]=0.

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 VX→X′E be a Stinespring dilation of EX→X′ into an environment system E≃X⊗X′. For n∈N we need to find a suitable candidate implementation TXn→X′n. Let

x=-maxσX{D(E(σX)‖ΓX′)-D(σX‖ΓX)}=-T(E). 56

For any δ>0 let MEnX′nx,δ be the operator constructed by Proposition 6.1, with the system E playing the role of the system A, with VX→X′EΓXVX←X′E† as ΓAB and with ΓX′ as ΓB′. Now, define

TXn→X′n(·)=trEnMEnX′nx,δVX→X′E⊗n(·)(VX←X′E†)⊗n(MEnX′nx,δ)† 57

noting that TXn→X′n is trace non-increasing by construction thanks to Property (i) of Definition 6.1.

Let |σ⟩XRX be any pure state, and define |ρ⟩X′ERX=VX→X′E|σ⟩XRX. By construction, D(ρEX′‖(VX→X′EΓXV†))-D(ρX′‖ΓX′)=D(σX‖ΓX)-D(E(σX)‖ΓX′)⩾x. Then Property (ii) of Proposition 6.1 tells us that there exists a ξ>0 independent of both ρ and n such that

Re⟨ρ|X′ERX⊗nMEnX′nx,δ|ρ⟩X′ERX⊗n⩾1-poly(n)exp(-nξ). 58

The conditions of Proposition 2.3 are fulfilled, with WXn→X′nEn=MAnBnx,δVX→X′E⊗n, thanks furthermore to the fact that MEnX′nx,δ is permutation-invariant as guaranteed by Proposition 6.1. Hence, we have

12‖TXn→X′n-EX→X′⊗n‖⋄⩽poly(n)exp(-nξ/2). 59

For n∈N large enough this becomes smaller than any fixed ϵ>0. Furthermore, by Property (iii) of Definition 6.1, we have that

TXn→X′n(ΓX⊗n)=trEn[MEnX′nx,δ(VX→X′EΓXVX←X′E†)⊗n(MEnX′nx,δ)†]⩽poly(n)e-n(x-4δ)ΓX′⊗n 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 ΓAB>0 and ΓB′>0 without loss of generality. Indeed, if either operator is not positive definite, then we can first construct the operator M~AnBnx,δ associated with modified operators Γ~AB>0 and Γ~B′>0 where all the zero eigenvalues of ΓAB and ΓB′ are replaced by some arbitrary fixed strictly positive constant (e.g., one); we can then set MAnBnx,δ=PBnΓ′M~AnBnx,δPAnBnΓ, where PAnBnΓ (respectively PBnΓ′) is the projector onto the support of ΓAB⊗n (respectively ΓB′⊗n). The operator MAnBnx,δ constructed in this way satisfies all of the required properties. For the remainder of this proof we thus assume that ΓAB>0 and ΓB′>0.

Let RAnBnk be the POVM constructed by Proposition 2.2 for HAB=-ln(ΓAB). Similarly, let SBnℓ be the corresponding POVM constructed in Proposition 2.2 for HB′=-ln(ΓB′). Also, as before, we denote by ΠAnBnλ and by ΠBnμ the projectors on the Schur–Weyl blocks labelled by the Young diagrams λ∈Young(dAdB,n) and μ∈Young(dB,n). Let

MAnBnx,δ=∑k,ℓ,λ,μ:k-H¯(λ)-ℓ+H¯(μ)⩾x-4δSBnℓΠBnμΠAnBnλRAnBnk. 61

Note that [SBnℓ,ΠBnμ]=0 because SBnℓ is permutation-invariant, and [1An⊗SBnℓ,ΠAnBnλ]=0 because 1An⊗SBnℓ is permutation-invariant. Recall also that [1An⊗ΠBnμ,ΠAnBnλ]=0 for the same reason. The operator MAnBnx,δ is permutation-invariant by construction. Then, we have

MAnBnx,δ†MAnBnx,δ=∑k,ℓ,λ,μ,k′,ℓ′,λ′,μ′:k-H¯(λ)-ℓ+H¯(μ)⩾x-4δk′-H¯(λ′)-ℓ′+H¯(μ′)⩾x-4δRAnBnkΠAnBnλΠBnμSBnℓSBnℓ′ΠBnμ′ΠAnBnλ′RAnBnk′=∑k,k′,ℓ,λ,μ:k-H¯(λ)-ℓ+H¯(μ)⩾x-4δk′-H¯(λ)-ℓ+H¯(μ)⩾x-4δRAnBnk(ΠAnBnλΠBnμSBnℓ)RAnBnk′=∑k,k′RAnBnk∑ℓ,λ,μk-H¯(λ)-ℓ+H¯(μ)⩾x-4δk′-H¯(λ)-ℓ+H¯(μ)⩾x-4δΠAnBnλΠBnμSBnℓRAnBnk′⩽∑k,k′RAnBnkRAnBnk′=∑kRAnBnk=1AnBn 62

recalling that the operators (ΠAnBnλ,ΠBnμ,SBnℓ) 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 |ρ⟩ABR, where R is any reference system, and assume that D(ρAB‖ΓAB)-D(ρB‖ΓB′)⩾x. Rewrite this condition as

x⩽-H(ρAB)-tr[ρABlnΓAB]+H(ρB)+tr[ρBlnΓB′]. 63

We write

graphic file with name 220_2021_4107_Equ64_HTML.gif 64

where we define

graphic file with name 220_2021_4107_Equ65_HTML.gif 65
graphic file with name 220_2021_4107_Equ66_HTML.gif 66a

further noting that the conditions in the sum defining ▪1 indeed imply that k-H¯(λ)-ℓ+H¯(μ)⩾-tr[ρABlnΓAB]-H(ρAB)+tr[ρBlnΓB′]+H(ρB)-4δ⩾x-4δ. We first consider ▪1. Define the projectors

X1=∑k⩾-tr[ρABlnΓAB]-δRAnBnk;X1⊥=1-X1; 66b
X2=∑H¯(λ)⩽H(ρAB)+δΠAnBnλ;X2⊥=1-X2; 67a
X3=∑H¯(μ)⩾H(ρB)-δΠBnμ;X3⊥=1-X3; 67b
X4=∑ℓ⩽-tr[ρBlnΓB′]+δSBnℓ;X4⊥=1-X4, 67c

and observe that

Re▪1=Re⟨ρ|ABR⊗n(X4X3X2X1)|ρ⟩ABR⊗n. 67d

Thanks to Proposition 2.2, we have ‖X1⊥|ρ⟩ABR⊗n‖⩽2exp(-nη/2), recalling that ‖P|ψ⟩‖=tr[Pψ], and hence

Re⟨ρ|ABR⊗nX4X3X2X1|ρ⟩ABR⊗n=Re⟨ρ|ABR⊗nX4X3X2|ρ⟩ABR⊗n-Re⟨ρ|ABR⊗nX4X3X2X1⊥|ρ⟩ABR⊗n⩾Re⟨ρ|ABR⊗nX4X3X2|ρ⟩ABR⊗n-2exp(-nη/2) 68

using Cauchy–Schwarz to assert that Re(⟨χ|ψ⟩)⩽|⟨χ|ψ⟩|⩽‖|χ⟩‖‖|ψ⟩‖. Similarly, using Proposition 2.1, we have ‖X2⊥|ρ⟩ABR⊗n‖⩽poly(n)exp(-nη/2). Also, we have ‖X3⊥|ρ⟩ABR⊗n‖⩽poly(n)exp(-nη/2), and ‖X4⊥|ρ⟩ABR⊗n‖⩽2exp(-nη/2), yielding

Re⟨ρ|ABR⊗nX4X3X2|ρ⟩ABR⊗n⩾Re⟨ρ|ABR⊗nX4X3|ρ⟩ABR⊗n-poly(n)exp(-nη/2); 69
Re⟨ρ|ABR⊗nX4X3|ρ⟩ABR⊗n⩾Re⟨ρ|ABR⊗nX4|ρ⟩ABR⊗n-poly(n)exp(-nη/2); 70
Re⟨ρ|ABR⊗nX4|ρ⟩ABR⊗n⩾1-2exp(-nη/2). 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

Re▪1⩾1-poly(n)exp(-nη/2). 72

Now we consider the term ▪2. We know that

RAnBnk|ρ⟩ABR⊗n⩽exp(-nη/2)ifk<-tr[ρABlnΓAB]-δ; 73
ΠAnBnλ|ρ⟩ABR⊗n⩽poly(n)exp(-nη/2)ifH¯(λ)>H(ρAB)+δ; 74a
SBnℓ|ρ⟩ABR⊗n⩽exp(-nη/2)ifℓ>-tr[ρBlnΓB′]+δ; 74b
ΠBnμ|ρ⟩ABR⊗n⩽poly(n)exp(-nη/2)ifH¯(μ)<H(ρB)-δ 74c

recalling that ‖P|ψ⟩‖=tr[Pψ]. So, for each term in the sum (66b), we have

⟨ρ|ABR⊗n(SBnℓΠBnμΠAnBnλRAnBnk)|ρ⟩ABR⊗n=(⟨ρ|ABR⊗nSBnℓΠBnμΠAnBnλ)(RAnBnk|ρ⟩ABR⊗n)⩽RAnBnk|ρ⟩ABR⊗n·(SBnℓΠBnμΠAnBnλ)|ρ⟩ABR⊗n⩽poly(n)exp(-nη/2) 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 SBnℓ,ΠBnμ,ΠAnBnλ all commute). Because there are only at most poly(n) terms, we have

graphic file with name 220_2021_4107_Equ82_HTML.gif 75

Hence, we have

Re⟨ρ|ABR⊗nMAnBnx,δ|ρ⟩ABR⊗n&=Re▪1+Re▪2⩾Re▪1-▪2⩾1-poly(n)exp(-nη/2) 76

proving Property (ii) for ξ=η/2. Note that ξ does not depend on the state |σ⟩XR. Now, we prove Property (iii). Using Lemma B.1 and dropping some subsystem indices for readability, we have

trAn[MAnBnx,δΓAB⊗n(MAnBnx,δ)†]⩽poly(n)∑k,ℓ,λ,μ:k-H¯(λ)-ℓ+H¯(μ)⩾x-4δtrAnSℓΠμΠλRkΓ⊗nRkΠλΠμSℓ. 77

Recall that, using Proposition 2.2 and Lemma 2.2,

RAnBnkΓAB⊗n⩽e-nkRAnBnk⩽e-nk1AnBn; 78
ΠBnμtrAnΠAnBnλΠBnμ⩽poly(n)exp(n(H¯(λ)-H¯(μ)))1Bn; 79
SBnℓ⩽enℓSBnℓΓB′⊗n⩽enℓΓB′⊗n 80

further recalling that [RAnBnk,ΓAB⊗n]=0 and [SBnℓ,ΓB′⊗n]=0. Combining these together yields

(78)⩽poly(n)∑k,ℓ,λ,μ:k-H¯(λ)-ℓ+H¯(μ)⩾x-4δe-nkSℓΠμtrAn[ΠAnBnλ]ΠμSℓ⩽∑k,ℓ,λ,μ:k-H¯(λ)-ℓ+H¯(μ)⩾x-4δpoly(n)e-nk+n(H¯(λ)-H¯(μ))SBnℓ⩽∑k,ℓ,λ,μ:k-H¯(λ)-ℓ+H¯(μ)⩾x-4δpoly(n)e-n(k-H¯(λ)+H¯(μ)-ℓ)ΓB′⊗n⩽poly(n)e-n(x-4δ)ΓB′⊗n. 81

Finally, suppose that [ΓAB,ΓB′]=0, meaning that we can choose a simultaneous eigenbasis for ΓAB and ΓB′. Then the operator MAnBnx,δ is a projector, as can be seen in (62) since in that case {SBnℓ},{ΠBnμ},{ΠAnBnλ},{RAnBnk} are all complete sets of projectors all elements of which commute pairwise between different sets. Furthermore, ΓB′⊗n and ΓAB⊗n both commute with all of these projectors and therefore also with MAnBnx,δ. □

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, HX a Hermitian operator, β⩾0, EX→X a completely positive, trace-preserving map satisfying

EX→X(e-iHXt(·)eiHXt)=e-iHXtEX→X(·)eiHXtfor allt∈R. 82

Let ϵ>0. Let δ>0 be small enough and n∈N be large enough. Then, there exists an information battery W, a thermal operation ΦXnW, and battery states τW(i) and τW(f) such that:

  • (i)
    The effective work process TXn→Xn associated with ΦXnW and τW(i),τW(f) satisfies
    12‖TXn→Xn-EX→X′⊗n‖⋄⩽ϵ; 83
  • (ii)
    The work cost per copy satisfies
    limδ→0limn→∞1nwτW(i)-wτW(f)=T(E). 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.

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 REnXnJ to reset En to the thermal state γE⊗n using X′n as a memory, while extracting work using an information battery J. Here, the projector that can distinguish ρEX′⊗n from 1En⊗ρX′n is the universal conditional typical projector given by Proposition E.2. The fact that REnXnJ preserves the correlations [E(σXR)]⊗n between the memory (output systems X′n) and the reference Rn ensures that the process is implemented accurately. The amount of work extracted by REnXnJ is m∼n[βFE+T(E)] but ∼nβFE work has to be paid to prepare the initially pure En ancillas, where βFE=-lntr(e-βHE). The overall work extracted is ∼T(E) per copy

Fig. 1.

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 RSMJ 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 e-m1em of rank em for a fixed and known value of m. A state ρSM of the system and the memory is purified by a reference system R (not pictured). The map RSMJ outputs the system S in a state close to the thermal state γS and the register J in a state close to the pure state |0⟩J, all while ensuring that ρMR remains unchanged (up to small errors), for all states ρSM in a given class of states SSM. The routine is provided a POVM effect PSM whose task is to distinguish ρSM from γS⊗ρM in a hypothesis test for all ρSM∈SSM. As long as m is not too large (as determined by how well PSM can perform this distinguishing), the procedure completes successfully. To implement RSMJ (shaded region) we involve em ancillas A=A1…Aem with Aj≃S, each initialized in the thermal state γAj=γS. Then S and Aj are coherently swapped (FSAj) conditioned on the value stored in J. If m is not too large, a POVM {ΩMAj} can infer the value j stored in J, up to a small error; the POVM is constructed from PSM. 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 σS be a fixed state, let SSM={ρSM} be an arbitrary set of states on S⊗M, and let δ′⩾0. A universal conditional δ′-erasure process of S using M as side information is a completely positive, trace non-increasing map TSM→SM such that for all ρSM∈SSM, and writing |ρ⟩SMR a purification of ρSM, we have

F(TSM→SM(ρSMR),σS⊗ρMR)⩾1-δ′. 85

We provide a thermodynamic protocol for universal conditional erasure.

Proposition 7.1

Let S, M be systems with Hamiltonians HS,HM and let γS refer to the thermal state on S. Let SSM be an arbitrary set of states on S⊗M. Let m⩾0 such that em is integer. Let PSM be a Hermitian operator satisfying 0⩽PSM⩽1 and [PSM,HS+HM]=0, and assume that there exists κ,κ′⩾0 such that for all ρSM∈SSM we have

tr[PSMρSM]⩾1-κ; 86
trPSMγS⊗ρM⩽κ′em. 87a

Then, there exists a thermal operation RSMJ→SMJ acting on the systems SM and an information battery J, such that the effective work process TSM→SM of RSMJ→SMJ with respect to the battery states (τJm,|0⟩J) is a universal conditional (2κ+4κ′)-erasure process with σS=γS for the set of states SSM′, where SSM′ is the convex hull of SSM.

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 m⩾0 such that em is integer. Let J be a large register of dimension at least 2em, and choose a fixed basis {|j⟩J}. Now, let γS be any state, SSM an arbitrary set of quantum states on S⊗M, PSM a Hermitian operator satisfying 0⩽PSM⩽1, and assume that there exists κ,κ′⩾0 such that for all ρSM∈SSM the conditions (87) hold. Furthermore, let A=A1⊗⋯⊗Aem be a collection of ancilla systems with each Aj≃S, and let A′=A1′⊗⋯⊗Aem′ be a copy of the full collection of ancilla systems. We write a purification of γAj on Aj′ as |γ⟩AjAj′=γAj1/2|Φ⟩Aj:Aj′. Let SSM′ be the convex hull of SSM. Then, there exists a unitary operator WSMAJ→SMAJ(m) satisfying the following property: For any reference system R, for any pure tripartite state |ρ⟩SMR with ρSM∈SSM′, and for any |j⟩J with 1⩽j⩽em, we have

Re(⟨τj^(ρSMR)|RMSAA′⊗⟨0|J)WSMAJ(m)(|ρ⟩RMS⊗|γ⟩A·A·′⊗em⊗|j⟩J)⩾1-(2κ+4κ′), 87b

where we have defined

|τj^(ρSMR)⟩RMSAA′=|ρ⟩AjMR⊗|γ⟩SAj′⊗[|γ⟩⊗(em-1)]AA′\AjAj′ 88

and by the notation AA′\AjAj′ we refer to all AA′ systems except AjAj′. Moreover, for any observables HS, HM such that [PSM,HS+HM]=0, the unitary WSMAJ(m) may be chosen such that [HS+HM+∑HAj,WSMAJ(m)]=0, where HAj=HS.

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 SSM to be a convex set, because any convex combination of states in SSM also satisfies the conditions (87). For the rest of the proof we assume without loss of generality that SSM=SSM′.

The operator W is defined in two steps. The first operation simply consists on conditionally swapping S with Aj, 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 W(1), acting on systems SAJ

WSAJ(1)=∑jFSAj⊗|j⟩⟨j|J, 89

where FSAj denotes the swap operator between the two designated systems. Observe that W(1) maps ρ onto τj^ according to

WSQJ(1)|ρ⟩RMS⊗|γ⟩A·A·′⊗em⊗|j⟩J=|ρ⟩RMAj⊗|γ⟩SAj′⊗|γ⟩⊗(em-1)AA′\AjAj′⊗|j⟩J=|τj^⟩SRMAA′⊗|j⟩J. 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

ΛMAj=PMAj⊗1A\Aj 91

such that {ΛMAj} is a set of positive operators. We can form a POVM {ΩMAj}j∪{ΩMA⊥} by normalizing the Λj’s as follows:

ΩMAj=ΛMA-1/2ΛMAjΛMA-1/2;ΛMA=∑jΛMAj;ΩMA⊥=1-∑jΩMAj. 92

We would now like to lower bound tr[ΩMAjτj^MA]. Following the proof of [19, Theorem 2], we first invoke the Hayashi–Nagaoka inequality [57], which states that for any operators 0⩽A⩽1, B⩾0, we have

1-(A+B)-1/2A(A+B)-1/2⩽2(1-A)+4B. 93

Applying this inequality with A=ΛMAj and B=∑j′≠jΛMAj′ we obtain

tr1-Ωjτj^MA⩽2tr1-ΛMAjτj^MA+4∑j′≠jtrΛMAj′τj^MA⩽2tr1-PSMρSM+4mtrPSMγS⊗ρM⩽2κ+4κ′. 94

Now, let SHIFTJ(x)=∑j|j+x⟩⟨j|J denote the SHIFT operation on the J register, modulo em; note that (SHIFTJ(x))†=SHIFTJ(-x). We define

WMAJ(2)=∑jΩMAj⊗SHIFTJ(-j);WSMAJ′=WMAJ(2)WSAJ(1) 95

and we see that W′†W′⩽1 thanks to Proposition B.3. Then, we have

WSMAJ′|ρ⟩RMS⊗|ϕ⟩A·A·′⊗em⊗|j⟩J=∑j′ΩMAj′⊗SHIFTJ(-j′)|τj^⟩SRMAA′⊗|j⟩J=∑j′ΩMAj′|τj^⟩RMSAA′⊗|j-j′⟩. 96

Thanks to Proposition C.1, the operator WSMAJ′ can be completed to a full unitary WSMAJ by using an extra qubit in the J register, and such that ⟨0|JWSMAJ|j⟩J=⟨0|JWSMAJ′|j⟩J for all j=1,…,em (with the convention that |j⟩J for j⩽em forces the extra qubit to be in the zero state). So, recalling (95),

⟨τj^|RMSAA′⊗⟨0|JWSMAJ|ρ⟩RMS⊗|ϕ⟩A·A·′⊗em⊗|j⟩J=⟨τj^|RMSAA′⊗⟨0|JWSMAJ′|ρ⟩RMS⊗|ϕ⟩A·A·′⊗em⊗|j⟩J=⟨τj^|ΩMAj|τj^⟩RMSAA′⩾1-(2κ+4κ′). 97

To prove the last part of the claim, let HS,HM be observables such that [PSM,HS+HM]=0 and [HS,γS]=0. Let HAj=HS and we write HA=∑jHAj. For all j, we have

[HS+HM+HA,ΛMAj]=[HS+∑j′≠jHAj′,ΛMAj]+[HM+HAj,PMAj]=0. 98

This implies that [HS+HM+HA,ΛMA]=0, and in turn [HS+HM+HA,ΛMA-1/2]=0, and thus also [HS+HM+HA,Ωj]=0. Hence, we have

[HS+HM+HA,WMAJ(2)]=0. 99

Clearly, [HS+HM+HA,WSAJ(1)]=0, and hence [HS+HM+HA,WSMAJ′]=0. Using Proposition C.2 instead of Proposition C.1, we may further enforce [HS+HM+HA,WSMAJ]=0, as required. □

We now give the proof of Proposition 7.1.

Proof

(Proposition 7.1). Let WSMAJ(m) be the energy-conserving unitary as in Lemma 7.1 and define the thermal operation

RSMJ(·)=trA[WSMAJ(m)((·)⊗γA)WSMAJ(m)†]. 100

Identifying J as an information battery, the associated effective work process of RSMJ with respect to (τJm,|0⟩J) is

TSM→SM(·)=trA[⟨0|JWSMAJ(m)((·)⊗γA⊗τJm)WSMAJ(m)†|0⟩J]. 101

Let ρSM∈SSM′ and let |ρ⟩SMR be a purification of ρSM. We have that the state vector

e-m/2∑j=1em⟨0|JWSMAJm(|ρ⟩SMR⊗|γ⟩AA′⊗em⊗|j⟩J)⊗|j⟩RJ 102

is a purification of TSM→SM(ρSMR), where RJ is an additional register. Similarly, the state vector

e-m/2∑j=1em|τj^(ρSMR)⟩RMSAA′⊗|j⟩RJ 103

is a purification of γS⊗ρMR. Then, with Uhlmann’s theorem we find

F(TSM→SM(ρSMR),γS⊗ρMR)⩾e-m∑j=1emRe(⟨τj^(ρSMR)|RMSAA′⊗⟨0|J)WSMAJ(m)(|ρ⟩RMS⊗|γ⟩A·A·′⊗em⊗|j⟩J)⩾1-(2κ+4κ′), 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 HX, and EX→X be a completely positive, trace-preserving map that is covariant with respect to time evolution. That is, for all t we have

EX→X(e-iHXt(·)eiHXt)=e-iHXtEX→X(·)eiHXt. 105

Then, there exists a system E with Hamiltonian HE including an eigenstate |0⟩E of zero energy, as well as a unitary VEX→EX such that

EX→X(·)=trEV|0⟩⟨0|E⊗(·)V† 106

as well as V(HX+HE)V†=HX+HE.

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 HE, as well as an energy-conserving unitary VXE and a state |0⟩E of zero energy such that (107) holds. Let FE=-β-1ln(ZE) with ZE=tr[e-βHE]. We define

x=minσD(σ‖e-βHX)-D(E(σ)‖e-βHX)=-T(E). 107

Writing ρXE=VXE|0⟩⟨0|E⊗σXVXE†, we have that x=minσX{-H(σX)+βtr[σXHX]+H(ρX)-βtr[ρXHX]}. By tr[σXHX]=tr[(|0⟩⟨0|E⊗σX)(HX+HE)]=tr[ρXEHX+HE], we see that

x=minσX-H(ρXE)+H(ρX)+βtr[ρEHE]. 108

Observe that for any such ρXE, we have

-H(E|X)ρ+βtr[ρEHE]⩾-H(E)ρ+βtr[ρEHE]+ln(Z)-ln(Z)=D(ρE‖γE)+βFE⩾βFE 109

using the sub-additivity of the von Neumann entropy and the fact that relative entropy is positive for normalized states. Hence, we have x⩾βFE.

Let

SEnXn={ρEX⊗n:ρEX=VXE(|0⟩⟨0|E⊗σX)VXE†for someσX}, 110

noting that for all ρEX⊗n∈SEnXn, we have D(ρEX‖e-β(HX+HE))-D(ρX‖e-βHX)=D(σ‖e-βHX)-D(E(σ)‖e-βHX)⩾x. Let PEnXnx,δ be the universal typical and relative conditional operator furnished by Proposition 6.1, where ΓX=e-βHX and ΓXE=e-β(HX+HE)=ΓX⊗ΓE with ΓE=e-βHE. Since ΓXE commutes with 1E⊗ΓX, Proposition 6.1 guarantees that PEnXnx,δ is a projector which furthermore commutes with ΓXE⊗n and ΓX⊗n. We proceed to show that PEnXnx,δ can perform a hypothesis test between ρEX⊗n and γE⊗n⊗ρX⊗n. Recalling Definition 6.1 we have

tr[PEnXnx,δρEX⊗n]⩾1-κ, 111

with κ=poly(n)e-nη for some η>0 independent of ρ and n. By construction we have 1X⊗ΓE=ΓX-1/2ΓXEΓX-1/2, and so thanks to Point (iii) of Definition 6.1 we can compute

trEn[PEnXnx,δΓE⊗n]=(ΓX-1/2)⊗ntrEn[PEnXnx,δΓXE⊗n](ΓX-1/2)⊗n⩽poly(n)exp(-n(x-4δ))1Xn, 112

where we furthermore used the fact that PEnXnx,δ commutes with ΓXE⊗n and with ΓX⊗n. We therefore see using γE=ΓE/tr[ΓE] that

tr[PEnXnx,δρX⊗n⊗γE⊗n]⩽1tr[ΓE⊗n]poly(n)exp(-n(x-4δ))tr[ρX⊗n]=poly(n)exp(-n(x-βFE-4δ)). 113

Let

em=⌊exp{n(x-βFE-4δ-η)}⌋, 114

such that tr[PEnXnx,δρX⊗n⊗γE⊗n]⩽e-mκ′ by choosing κ′=poly(n)e-nη.

Now let J be a register of dimension at least 2em and let REnXnJ be the thermal operation furnished by Proposition 7.1 for S=En, M=Xn, SEnXn, PEnXnx,δ, m, κ, and κ′ as defined above. Here, we have assumed that x>βFE, and that furthermore δ,η are small enough such that 4δ+η<(x-βFE); if instead x=βFE then we can set em=1 and REnXnJ(·)=trEn(·)⊗γE⊗n (which is a thermal operation) in the following.

We proceed to show that the effective work process TEnXn→EnXnR of REnXnJ with respect to (τJm,|0⟩J) is close to the partial trace map TEnXn→EnXn(0)(·)=trEn(·)⊗γE⊗n in diamond distance. We invoke the post-selection technique (Theorem 2.1) to show this. Let ζEnXn be the de Finetti state which via (21) can be written as the convex combination of a finite number of i.i.d. states

ζEnXn=∑piϕi⊗n. 115

Hence ζEnXn lies in the convex hull of SEnXn, and from Proposition 7.1 and Definition 7.1 we see that for a purification |ζ⟩EnXnR of ζEnXn we have

F(TEnXn→EnXnR(ζEnXnR),γE⊗n⊗trEn(ζEnXnR))≥1-(2κ+4κ′). 116

Using D(ρ,σ)≤1-F(ρ,σ) along with Theorem 2.1 we find

12‖TEnXn→EnXnR-TEnXn→EnXn(0)‖⋄⩽2κ+4κ′=poly(n)e-nη/2. 117

We can start piecing together the full process. Our overall protocol needs to (a) bring in a heat bath En, i.e., ancillas initialized in their thermal state, (b) prepare the states |0⟩E⊗n on the ancillas using an auxiliary information battery (denoted by W′ below), (c) apply the energy-conserving unitary VXE⊗n, (d) apply REnXnJ using an information battery J initialized in the state τJm, and (e) discard the ancillas.

As explained in Sect. 3, there exists a thermal operation Φ~EnW′ on the ancillas and an information battery W′ along with battery states (τW′(1),τW′(2)) such that Φ~EnW′(γE⊗n⊗τW′(1))=|0⟩⟨0|E⊗n⊗τW′(2) and with w(τW′(1))-w(τW′(2)) arbitrarily close to -βnFE. Now let W=J⊗W′, τW(i)=τW′(1)⊗τJm, τW(f)=τW′(2)⊗|0⟩⟨0|J, and define

ΦXnW(·)=trEn[REnXnJ(VXE⊗nΦ~EnW′((·)⊗γE⊗n)(VXE⊗n)†)]. 118

The map ΦXnW is a thermal operation because it is a concatenation of thermal operations. The overall heat bath is formed of the systems En, the ancillas An used in the implementation of REnXnJ, as well as the implicit heat bath used in the implementation of Φ~EnW′. The system W=J⊗W′ is the information battery. We can verify that the associated effective work process with respect to (τW(i),τW(f)) is

TXn(·)=〈0|JtrEn[REnXnJ(VXE⊗ntrW′[PW′(2)Φ~EnW′((·)⊗τW′(1)⊗τJm⊗γE⊗n)](VXE⊗n)†)]|0〉J=trEn[〈0|JREnXnJ([VXE⊗n((·)⊗|0⟩⟨0|E⊗n)(VXE⊗n)†]⊗τJm)|0〉J]=trEn[TEnXnR(VXE⊗n((·)⊗|0⟩⟨0|E⊗n)(VXE⊗n)†)]=trEn[VXE⊗n((·)⊗|0⟩⟨0|E⊗n)(VXE⊗n)†]+ΔXn(·)=EX→X⊗n(·)+ΔXn(·), 119

where ΔXn(·)=trEn(TXnEnR(·)-TXnEn(0)(·)) satisfies (1/2)‖ΔXn‖⋄⩽poly(n)e-nη/2. Therefore for any fixed ϵ and for n large enough we have (1/2)‖TXn-EX→X⊗n‖⋄⩽ϵ.

The associated work cost per copy satisfies

limδ→0limn→∞1n[w(τW(i))-w(τW(f))]=limδ→0limn→∞1n[w(τW′(1))-w(τW′(2))-m]=limδ→0limn→∞1n[-nβFE-n(x-βFE-4δ+η)+υ]=T(E), 120

recalling (115), where 0⩽υ⩽2 accounts for the rounding error in (115) and a possible arbitrarily small difference between -nβFE and w(τW′(1))-w(τW′(2)), and recalling that η→0 as δ→0. □

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 ΠAnBnλ may be obtained following [25, Section V]

ΠAnBnλ=dim(Qλ)sλ(diag(λ/n))∫dUABΠAnBnλUABdiag(λ/n)ABUAB†⊗nΠAnBnλ⩽poly(n)enH¯(λ)∫dUABUABdiag(λ/n)ABUAB†⊗n, 121

recalling that ΠAnBnλ commutes with any i.i.d. state, with sλ(X)=tr[qλ(X)] and using bounds on dim(Qλ) and sλ(diag(λ/n)) derived in Ref. [25]. Here, dUAB denotes the Haar measure over all unitaries acting on HAB, normalized such that ∫dUAB=1. We then have

trAnΠAnBnλ⩽poly(n)enH¯(λ)∫dUABtrAnUABdiag(λ/n)ABUAB†⊗n. 122

Observe that for any state ωB, we have

‖ΠBnλ′ωB⊗nΠBnλ′‖∞=‖[qλ′(ωB)⊗1Pλ′]λ′‖∞=‖qλ′(ωB)‖∞⩽trqλ′(ωB)⩽poly(n)e-nH¯(λ′) 123

as derived e.g. in [25, Eq. (9)], and thus for any state ωB,

ΠBnλ′ωB⊗nΠBnλ′⩽poly(n)e-nH¯(λ′)ΠBnλ′. 124

Hence, we get

ΠBnλ′trAnΠAnBnλΠBnλ′⩽poly(n)enH¯(λ)∫dUABΠBnλ′trAUABdiag(λ/n)ABUAB†⊗nΠBnλ′⩽poly(n)enH¯(λ)∫dUABpoly(n)e-nH¯(λ′)ΠBnλ′=poly(n)en(H¯(λ)-H¯(λ′))ΠBnλ′, 125

as required. □

Proof

(Proposition 2.1) The Fannes–Audenaert continuity bound [67, 68] of the entropy states that for any δ′>0 there exists ξ(δ′)>0 such that for any quantum states ρ,σ with D(ρ,σ)⩽δ′ we have

|H(ρ)-H(σ)|⩽ξ(δ′), 126

and furthermore ξ(δ′) is monotonically strictly decreasing and ξ(δ′)→0 if δ′→0. Now, let δ>0, let ξ-1 be the inverse function of ξ, and let δ′=ξ-1(δ). Consider the set of Young diagrams Λδ′={λ∈Young(dA,n):D(diag(λ/n),ρ)⩽δ′}. For all λ∈Λδ′, we have that |H(ρ)-H¯(λ)|⩽δ thanks to the Fannes–Audenaert inequality. Then, we have

tr∑λ:H¯(λ)∈[H(ρ)±δ]ΠAnλρA⊗n⩾tr∑λ∈Λδ′ΠAnλρA⊗n 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)⩾1-poly(n)exp-nη, 128

where η=δ′2/2. □

Proof

(Proposition 2.2). The fact that there are only poly(n) elements follows because there are only so many types. Property (ii) holds by definition. Property (iv) holds because e-n(k±δ) is the minimum / maximum eigenvalue of ΓA⊗n in the subspace spanned by RAn≈δh. Finally, we need to show Property (iii): This follows from a large deviation analysis. More precisely, let Zj for j=1,…,n be random variables where Zj represents the measurement outcome of HA on the j-th system of the i.i.d. state ρA⊗n. By Hoeffding’s inequality, we have that

Pr(1/n)∑Zj-tr[ρAHA]>δ⩽2exp-2nδ2ΔHA2⩽2exp-nδ22‖HA‖∞2, 129

where ΔHA is the difference between the maximum and minimum eigenvalue of HA, and ΔHA⩽2‖HA‖∞. Thus, the event consisting of the outcomes k satisfying |k-tr[ρAHA]|⩽δ happens with probability at least 1-2e-nη, proving (16). □

Proof

(Proposition 2.3) We use the post-selection technique (Theorem 2.1) to bound the diamond norm distance between TXn→X′n and EX→X′⊗n. Let |ζ⟩XnR¯nR′ be the purification of the de Finetti state given by (21). Calculate

Re⟨ζ|XnR¯nR′(VX→EX′⊗n)†WXn→EnX′n|ζ⟩XnR¯nR′=∑piRe⟨ϕi|XR¯⊗n(VX→EX′⊗n)†WXn→EnX′n|ϕi⟩XR¯⊗n⩾1-poly(n)exp(-nη) 130

which implies, recalling that F(|ψ⟩,|ϕ⟩)=|⟨ψ|ϕ⟩|⩾Re{⟨ψ|ϕ⟩} and that (1-x)2⩾1-2x,

F2VX→EX′⊗n|ζ⟩XnR¯nR′,WXn→EnX′n|ζ⟩XnR¯nR′⩾1-poly(n)exp(-nη) 131

and hence

PVX→EX′⊗n|ζ⟩XnR¯nR′,WXn→EnX′n|ζ⟩XnR¯nR′⩽poly(n)exp(-nη/2). 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

D(T(ζXnR¯nR′),E⊗n(ζXnR¯nR′))⩽P(T(ζXnR¯nR′),E⊗n(ζXnR¯nR′))⩽P(WXn→EnX′n|ζ⟩XnR¯nR′,VX→EX′⊗n|ζ⟩XnR¯nR′)⩽poly(n)exp(-nη/2). 133

The post-selection technique then asserts that

12‖T-E⊗n‖⋄⩽poly(n)exp(-nη/2) 134

as claimed. □

Proof

(Lemma 7.2). Let VX→XE′ be any Stinespring dilation isometry of EX→X, such that EX→X(·)=trEVX→XE′(·)V′†. For the input state |Φ⟩X:RX, consider the output state |φ⟩XERX corresponding to first time-evolving by some time t, and then applying V′

|φ⟩XERX=V′e-iHXt|Φ⟩X:RX=e-iV′HXV′†tV′|Φ⟩X:RX. 135

Now, let us define |φ′⟩XERX=e-iHXtV′|Φ⟩X:RX. By the covariance property of EX→X both |φ⟩ and |φ′⟩ have the same reduced state on XRX. Hence, they are related by some unitary WE(t) on the system E which in general depends on t

|φ⟩XERX=WE(t)|φ′⟩XERX. 136

We have

trXV′e-iHXtΦX:RXeiHXtV′†=WE(t)trX[V′ΦX:RXV′†]WE(t)† 137

so WE(t) must define a representation of time evolution, at least on the support of the operator trX[V′ΦX:RXV′†]. Hence, we may write WE(t)=e-iHEt for some Hamiltonian HE, and from (137), we have for all t

VX→XE′e-iHXt=e-i(HX+HE)tVX→XE′. 138

Expanding for infinitesimal t we obtain

VX→XE′HX=HX+HEVX→XE′. 139

Let |0⟩E be an eigenvector of HE corresponding to the eigenvalue zero; if HE 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 VX→XE′⟨0|E 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 VXE→XE. More precisely, let |j⟩X be a complete set of eigenvectors of HX with energies hj. Then |ψj′⟩=VX→XE′|j⟩X is an eigenvector of HX+HE of energy hj thanks to (140). We have two orthonormal sets {|0⟩E⊗|j⟩X} and {|ψj′⟩X} in which the j-th vector of each set has the same energy; we can thus complete these sets into two bases |χi⟩XE, |χi′⟩XE of eigenvectors of HX+HE, where the i-th element of either basis has exactly the same energy. This defines a unitary VXE→XE=∑i|χi′⟩XE⟨χi|XE that is an extension of VX→XE′⟨0|E, and that satisfies all the conditions of the claim. □

B. Technical Lemmas

Lemma B.1

(Pinching-like operator inequality). Let {Ei}i=1M be a collection of M operators and T⩾0. Then, we have

∑EiT∑Ej†⩽M∑EiTEi†. 140

Proof

Call our system S and consider an additional register C of dimension |C|=M, and let |χ⟩C=M-1/2∑k=1M|k⟩C. Then, we have

∑ESiTS∑ESj†=trC∑ESi⊗|i⟩CTS∑ESj†⊗⟨j|C1S⊗(M|χ⟩⟨χ|C)⩽MtrC∑ESi⊗|i⟩CTS∑ESj†⊗⟨j|C1S⊗1C=M∑ESiTSESi†, 141

using |χ⟩⟨χ|C⩽1C. □

Lemma B.2

(Gentle measurement). Let ρ be a sub-normalized quantum state and 0⩽Q⩽1. For tr[Qρ]⩾1-δ we then have

P(ρ,Q1/2ρQ1/2)⩽2δ. 142

This is a cruder statement than that of, e.g., [69, Lemma 7], allowing for a more straightforward proof.

Proof

We have

F¯(ρ,Q1/2ρQ1/2)⩾F(ρ,Q1/2ρQ1/2)=trρ1/2(Q1/2ρQ1/2)ρ1/2=trQ1/2ρ⩾tr[Qρ]⩾1-δ. 143

Then, we get P(ρ,Q1/2ρQ1/2)⩽1-(1-δ)2⩽2δ. □

Proposition B.3

(Controlled-unitary using a POVM). Let {Qj} be a set of positive semi-definite operators on a system X satisfying ∑Qj⩽1, {Uj} be a collection of unitaries on a system Y, and

WXY=∑jQXj⊗UYj. 144

Then, we have W†W⩽1.

Proof

Using an additional register K, define

VX→XK=∑Qj⊗|j⟩K. 145

Then, we have V†V=∑Qj⩽1. Clearly, VV†⩽1XK because VV† and V†V have the same non-zero eigenvalues. Now, let

W=V†∑1X⊗UYj⊗|j⟩⟨j|KV. 146

Because the middle term in parentheses is unitary, we manifestly have W†W⩽1. □

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 WX be an operator on a system X, such that W†W⩽1. Then, there exists a unitary operator UXQ acting on X and a qubit Q such that for any |ψ⟩X,

⟨0|QUXQ(|ψ⟩X⊗|0⟩Q)=WX|ψ⟩X. 147

That is, any operator W with ‖W‖∞⩽1 can be dilated to a unitary, with a post-selection on the output.

Proof

Setting VX→XQ=W⊗|0⟩Q+1-W†W⊗|1⟩Q, we see that V†V=W†W+1-W†W=1X, and hence VX→XQ is an isometry. We can complete this isometry to a unitary UXQ that acts as V on the support of 1X⊗|0⟩⟨0|Q and that maps the the support of 1X⊗|1⟩⟨1|Q onto the complementary space to the image of V. It then follows that for any |ψ⟩X, we have UXQ(|ψ⟩X⊗|0⟩Q)=VX→XQ|ψ⟩X=(WX|ψ⟩X)⊗|0⟩Q+(…)⊗|1⟩Q, and the claim follows. □

Proposition C.2

Let X be a quantum system with Hamiltonian HX and WX be an operator with W†W⩽1 as well as [WX,HX]=0. Then, there exists a unitary operator UXQ acting on X and a qubit Q with HQ=0, that satisfies [UXQ,HX]=0 such that

⟨0|QUXQ|0⟩Q=WX. 148

That is, any energy-preserving operator W with ‖W‖∞⩽1 can be dilated to an energy-preserving unitary on an ancilla with a post-selection on the output.

Proof

First we calculate [W†W,HX]=W†[W,HX]+[W†,HX]W=0-[W,HX]†W=0. This implies that [1-W†W,HX]=0, as W†W and 1-W†W have the same eigenspaces. We define

VX→XQ=W⊗|0⟩Q+1-W†W⊗|1⟩Q. 149

The operator VX→XQ is an isometry, because V†V=W†W+1-W†W=1X. Furthermore, we have

VX→XQHX=(WXHX)⊗|0⟩+(1-W†WHX)⊗|1⟩ 150
=(HXWX)⊗|0⟩+(HX1-W†W)⊗|1⟩=HXVX→XQ 151

and thus we find [VX→XQ,HX]=0. Let {|j⟩X} be an eigenbasis of HX, and let |ψj′⟩XQ=VX→XQ|j⟩X, noting that both |j⟩X and |ψj′⟩XQ have the same energy. The two collections of vectors {|j⟩X⊗|0⟩Q} and {|ψj′⟩XQ} can thus be completed into two bases {|χi⟩XQ} and {|χi′⟩XQ} of eigenvectors of HX+HQ where the i-th element of both bases have the same energy. Define finally UXQ=∑i|χi′⟩⟨χi|XQ, noting that by construction UXQ|0⟩Q=VX→XQ and [UXQ,HX]=0. □

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 EX→X′(·)=tr[·]|+⟩⟨+|, where |+⟩=[|0⟩+|1⟩]/2 with |0⟩,|1⟩ energy eigenstates of respective energies E0=0, E1>0; we write HX=∑j=0,1Ej|j⟩⟨j| and ΓX=e-βHX. The initial state on X and a reference system RX≃X is the maximally entangled state |σ⟩XRX=[|00⟩+|11⟩]/2=|Φ⟩X:RX/2.

We seek a map TX→X′ such that

P(TX→X′(σXRX),EX→X′(σXRX))⩽ϵandTX→X(ΓX)⩽αΓX′, 152

for a α that is independent of E0,E1. Here we have X≃X′ and ΓX=ΓX′.

Let ρX′RX=EX→X′(σXRX). From (153) we find 12‖TX→X′(σXRX)-ρX′RX‖1⩽ϵ, which in turn implies that (1/4)‖TX→X′(ΦX:RX)-|+⟩⟨+|X′⊗1RX‖1⩽ϵ, and hence that TX→X′(·)=tr[·]|+⟩⟨+|X′+Δ(·) for some Hermiticity preserving map Δ(·) satisfying 12‖Δ(ΦXRX)‖1⩽2ϵ.

Let Δ±⩾0 be the positive and negative parts of Δ(Γ)=Δ+-Δ-, noting that tr(Δ-)⩽tr(Δ-)+tr(Δ+)=‖Δ(Γ)‖1=‖trRX(ΓRX1/2Δ(ΦX:RX)ΓRX1/2)‖1, defining ΓRX as the transpose of ΓX onto the system RX, and continuing the computation we obtain tr(Δ-)⩽‖ΓRX1/2Δ(ΦX:RX)ΓRX1/2‖1⩽‖ΓRX‖∞‖Δ(ΦX:RX)‖1⩽4ϵ, using the fact that ‖ΓX‖∞=maxj{e-βEj}=1.

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 Q⩾0 and the dual variables μ,X⩾0:

e-DHη(ρ‖σ)=minimize:η-1tr[Qσ]=maximize:μ-η-1tr[X]subject\ to:Q⩽1=subject to:μρ⩽σ+X.tr[Qρ]⩾η 153

The condition TX→X′(Γ)⩽αΓ implies that αΓ⩾tr[Γ]|+⟩⟨+|+Δ(Γ)⩾|+⟩⟨+|-Δ-. Hence, we have that α-1|+⟩⟨+|⩽Γ+Δ-/α. Hence, for any 0<η⩽1 to be fixed later, μ=α-1 is feasible for the dual problem (154) defining the hypothesis testing entropy DHη(|+⟩⟨+|‖Γ), and e-DHη(|+⟩⟨+|‖Γ)⩾α-1-tr[Δ-/α]/η⩾α-1(1-4ϵ/η). Thus, we have ln(α)⩾DHη(|+⟩⟨+|‖Γ)+ln(1-4ϵ/η). Choosing η=8ϵ yields ln(1-4ϵ/η)=-ln(2).

On the other hand, by definition we have e-DHη(|+⟩⟨+|‖Γ)⩽tr[QΓ]/η for any 0⩽Q⩽1 satisfying tr[Q|+⟩⟨+|]⩾η; with Q=2η|1⟩⟨1| we obtain e-DHη(|+⟩⟨+|‖Γ)⩽2e-βE1 and thus DHη(|+⟩⟨+|‖Γ)⩾βE1-ln(2).

Then, ln(α)⩾-ln(2)+βE1-ln(2)=-2ln(2)+βE1. Now let α be the optimal candidate in the coherent relative entropy D^X→X′ϵ(ρX′RX‖Γ,Γ)=-ln(α). We finally see that the transformation 1/2→|+⟩ may require arbitrarily much energy if E1→∞, even for a small ϵ>0, since

energy cost=-β-1D^X→X′ϵ(ρX′RX‖Γ,Γ)=β-1ln(α)⩾E1-2β-1ln(2). 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 HA,HB and let s∈R. We define a universal conditional typical projector PAnBns,δ with parameter δ>0 as a projector acting on (HA⊗HB)⊗n such that:

  • (i)
    There exists η>0 independent of n such that for any quantum state ρAB with H(A|B)ρ⩽s, we have
    tr[PAnBns,δρAB⊗n]⩾1-poly(n)exp(-nη); 155
  • (ii)

    trAn[PAnBns,δ]⩽poly(n)en(s+2δ)1Bn.

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 s∈R. For any δ>0 and n∈N there exists a universal conditional typical projector PAnBns,δ 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 ρAB as

H^maxϵ(A|B)ρ=minρ≈ϵρ^ln‖trA[ΠABρ^AB]‖∞, 156

where ΠABρ^AB is the projector onto the support of ρ^AB, and where the optimization ranges over sub-normalized states ρ^AB which are ϵ-close to ρAB in purified distance. We may understand the i.i.d. behaviour of this quantity as follows. For δ>0 and n∈N let PAnBns,δ be a universal conditional typical projector with s=H(A|B)ρ. We define ρ^AnBn=Ps,δρAB⊗nPs,δ. Then, we have ρ^AnBn≈ϵρAB⊗n for n∈N large enough, thanks to Property (i) and the gentle measurement lemma (Lemma B.2). On the other hand, using Property (ii) we have

1nH^maxϵ(An|Bn)ρ⊗n⩽1nln‖trAn[Ps,δ]‖∞⩽H(A|B)ρ+2δ+1nln(poly(n)) 157

such that taking the limits n→∞ and δ→0, 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

PAnBns,δ=∑λ,λ′:H¯(λ)-H¯(λ′)⩽s+2δ(1An⊗ΠBnλ′)ΠAnBnλ, 158

where the respective projectors ΠBnλ′, ΠAnBnλ refer to Schur–Weyl decompositions of HB⊗n and of (HA⊗HB)⊗n, respectively, λ∈Young(dAdB,n) and λ′∈Young(dB,n). Observe that PAnBns,δ 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 (HA⊗HB)⊗n. The projector PAnBns,δ corresponds to the measurement of the two commuting POVMs {ΠAnBnλ} and {ΠBnλ′}, and testing whether or not the event H¯(λ)-H¯(λ′)⩽s+2δ is satisfied. Also by construction PAnBns,δ is permutation-invariant.

For any ρAB with H(A|B)ρ⩽s, the probability that the measurement of PAnBns,δ fails on ρAB⊗n can be upper bounded as follows. The passing event H¯(λ)-H¯(λ′)⩽s+2δ is implied in particular by the two events (a) H¯(λ)⩽H(AB)ρ+δ and (b) H¯(λ′)⩾H(B)ρ-δ happening simultaneously, recalling that H(AB)ρ-H(B)ρ=H(A|B)ρ⩽s. The probability of event (a) failing is

PrH¯(λ)>H(AB)ρ+δ⩽poly(n)exp-nη 159

as given by Proposition 2.1, and similarly for event (b)

PrH¯(λ′)<H(B)ρ-δ⩽poly(n)exp-nη. 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 η>0 does not depend on ρ. Hence with this η, for any ρAB we have

tr[PAnBns,δρAB⊗n]⩾1-poly(n)exp(-nη) 161

as required.

For the second property, we use Lemma 2.2 to write

trAn[PAnBns,δ]=∑λ,λ′:H¯(λ)-H¯(λ′)⩽s+2δΠBnλ′trAnΠAnBnλΠBnλ′⩽∑λ,λ′:H¯(λ)-H¯(λ′)⩽s+2δpoly(n)en(H¯(λ)-H¯(λ′))1Bn⩽poly(n)en(s+2δ)1Bn 162

recalling that there are only poly(n) 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 σS be the maximally mixed state on S. Let s<ln(dS), where dS is the dimension of S, and let δ>0 small enough. Let n∈N be large enough. Let J be a large enough information battery and let any m⩽n(ln(dS)-s-3δ) such that em is integer.

Then, there exists η′>0 and a thermal operation RSnMnJ→SnMnJ acting on the systems SnMnJ, such that the effective work process TSnMn→SnMn of RSnMnJ→SnMnJ with respect to the battery states (τJm,|0⟩J) is a universal conditional (poly(n)e-nη′)-erasure process resetting Sn to the state σS⊗n with respect to the set of states SSnMn′, where SSnMn′ is the convex hull of SSnMn={ρSM⊗n:H(S|M)ρ⩽s}.

The case where s=ln(dS) is uninteresting as we cannot hope to extract any work. In such cases one can simply set m=0 and take RSnMnJ to be the thermal operation that completely thermalizes Sn.

Proof

This is in fact a relatively straightforward application of Proposition 7.1 over n copies of SM. Let PSnMns,δ be given by Proposition E.2. We seek κ,κ′ that satisfy (87). We can choose κ=poly(n)exp-nη(δ) thanks to Definition E.1. Furthermore for any ρSM⊗n∈SSnMn we have

trPSnMn1SdS⊗ρM⊗n⩽poly(n)en(s+2δ)dS-ntr[ρM⊗n]=poly(n)e-n(ln(dS)-s-2δ)⩽poly(n)e-nδem 163

and thus we may take κ′=poly(n)e-nδ. Finally, η′ is given as η′=min{δ,η(δ)}. □

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]

Articles from Communications in Mathematical Physics are provided here courtesy of Springer

RESOURCES