Equivalence between non-Markovian dynamics and correlation backflows
Dario De Santis1 and Markus Johansson1
1ICFO-Institut de Ciencies Fotoniques, The Barcelona Institute of Science and Technology,
08860 Castelldefels (Barcelona), Spain
Abstract
The information encoded into an open quantum system that evolves under a Markovian dynamics is always monotonically non-increasing.
Nonetheless, for a given quantifier of the information contained in the system, it is in general not clear if for all non-Markovian dynamics it is possible to observe a non-monotonic evolution of this quantity, namely a backflow.
We address this problem by considering correlations of finite-dimensional bipartite systems.
For this purpose, we consider a class of correlation measures and prove that if the dynamics is non-Markovian there exists at least one element from this class that provides a correlation backflow.
Moreover, we provide a set of initial probe states that accomplish this witnessing task.
This result provides the first one-to-one relation between non-Markovian dynamics of finite-dimensional quantum systems and correlation backflows.
The study of open quantum systems dynamics BPbook ; RHbook is of central interest in quantum mechanics. A quantum system is called open when interaction with the environment that surrounds the quantum system is included in the description of its evolution. Since there are no experimental scenarios where a quantum system can be considered completely isolated, this approach provides a more realistic description of quantum evolutions.
The interaction between an open quantum system S and its environment E leads to two possible regimes of evolution. The phenomena associated with the Markovian regime are characterized by the monotonic non-increase of the information contained in the open system. In this case we have a unidirectional flow of information away from S and we say that the dynamics is memoryless. Instead, in the non-Markovian regime, this flow is not unidirectional and part of the information lost is recovered in one or more subsequent time intervals. This phenomenon is called backflow of information.
However, it is nonobvious what mathematical framework is better suited to reproduce this phenomenology. Recently, a framework based on a notion of divisibility of dynamical maps, namely the operators describing the dynamical evolution of the system, achieved a promising consensus RHbook ; WWTA ; INI ; RHP ; BLP ; BD ; bogna ; LFS ; BognaREV . More precisely, it requires that, if the dynamics is Markovian, the evolution between any two times is represented by a completely positive and trace-preserving (CPTP) linear map.
Many efforts are directed towards testing this mathematical definition by studying the characteristic backflows of information that different physical quantities show when the evolution is non-Markovian. Once we consider a quantity that is non-increasing under Markovian evolutions, we can study its “non-Markovian witnessing potential”, namely the ability to show a backflow when the dynamics is non-Markovian.
Distinguishability between states BLP ; BD ; bogna , correlation measures LFS ; PRA ; long ; Janek , channel capacities BognaChannel0 and the volume of accessible states Volume are some examples of quantities that have been studied in this scenario. Moreover, while Markovian phenomena are reproduced correctly by definition, the non-trivial point that has to be analyzed is if it is possible to obtain one-to-one connections between backflows of these quantities and non-Markovian dynamical maps. Indeed, this result would imply a correspondence between the phenomenological and the mathematical description of non-Markovianity that we have presented.
In this work we focus on the witnessing potential of the set of correlation measures. In particular, we study the connection between revivals of bipartite correlations and when the evolution of one subsystem S is non-Markovian.
Several measures have already been considered in this scenario, e.g. quantum mutual information LFS ; long and entanglement measures Janek . Recently, a correlation measure that witnesses almost all non-Markovian dynamics has been introduced PRA . However, it is unknown if any of these correlation measures can witness all non-Markovian dynamics long .
The main result of this work is the first proof of a one-to-one relation between correlation backflows and non-Markovian dynamics.
We consider a class of correlation measures for bipartite systems that provides backflows if and only if the dynamics is not Markovian. For this purpose, we make use of supplementary ancillary systems to define initial probe states that allow to succeed in this witnessing task. Finally, we introduce a measure of non-Markovianity.
*Non-Markovianity and divisibility properties.—*Given a generic finite-dimensional Hilbert space H, we define B(H) to be the set of linear bounded operators that act on H and S(H) the set of positive semidefinite, Hermitian and trace one operators on H, namely the state space of H.
We consider an open quantum system S described by states on a finite-dimensional Hilbert space HS. At the initial time t0 the system S is uncorrelated with the surrounding environment E. The evolution of S from t0 to t≥t0 is given by a dynamical map: a CPTP linear operator ΛS(t,t0):S(HS)→S(HS). Therefore, the complete evolution of S, namely from t0 to any time t≥t0, is described by a family of dynamical maps {ΛS(t,t0)}t, where ΛS(t,t0) is CPTP for every t≥t0.
The concept needed to define the mathematical structure we adopt to define Markovianity is the completely positive (CP) divisibility of the family {ΛS(t,t0)}t in terms of intermediate maps VS(t,t′).
Definition 1**.**
The evolution {ΛS(t,t0)}t is called CP-divisible if, for any t≥t0, the dynamical map ΛS(t,t0) can
be decomposed as a sequence of CPTP linear maps ΛS(t,t0)=VS(t,t′)ΛS(t′,t0), where VS(t,t′) is a CPTP linear map for any t0≤t′≤t.
CP-divisibility is commonly used to define Markovian dynamics and it is the definition that we consider in this work: {ΛS(t,t0)}t is Markovian if and only if it is CP-divisible. Likewise, we call an evolution non-Markovian if and only if for some t0≤t′≤t there is no CPTP intermediate map VS(t,t′).
*Measurements with fixed output probability distributions.—*Any measurement process on a quantum state ρ∈S(H) is defined by a positive-operator valued measure (POVM), namely an indexed set of Hermitian and positive semi-definite operators {Pi}i=1n of B(H) such that ∑i=1nPi=\mathbbm1, where \mathbbm1∈B(H) is the identity operator on H and n is the number of possible measurement outcomes. The operator Pi represents the i-th output of the measurement, where pi=\mboxTr[ρPi] is the corresponding occurrence probability.
Let E={pi,ρi}i=1n be a generic ensemble of n states where each finite-dimensional state ρi∈S(H) occurs with probability pi.
Now we consider a bipartite state ρAB∈S(HA⊗HB) and a POVM {PA,i}i=1n defined for the subsystem A. We define E(ρAB,{PA,i}i=1n)≡{pi,ρB,i}i=1n to be the ensemble of states of B that we obtain when we apply on A the measurement {PA,i}i=1n, where
[TABLE]
We call {pi}i=1n and {ρB,i}i=1n respectively the output probability distribution and the output states of the measurement. We call their combination E(ρAB,{PA,i}i=1n) the output ensemble.
We consider finite probability distributions P={pi}i=1n composed by n positive elements, where ∑i=1npi=1. We define the set of n-output POVMs that, if applied on ρ∈S(H), provide P-distributed outcomes.
Definition 2**.**
Given the finite probability distribution P={pi}i=1n, the n-output POVM {Pi}i=1n on H is a P-POVM for ρ∈S(H) if and only if it belongs to
[TABLE]
Similarly, given a bipartite system state ρAB, we define the measurement processes that, if applied on one side of ρAB, provide P-distributed output ensembles (see Fig. 1).
Definition 3**.**
Given the finite probability distribution P={pi}i=1n, the n-output POVM {PA,i}i=1n on HA is a P-POVM on A for ρAB∈S(HAB) if and only if it belongs to
[TABLE]
Analogously, we can define ΠBP(ρAB).
We notice that for any given P and ρAB, we have
ΠAP(ρAB)=ΠP(ρA), where ρA=\mboxTrB[ρAB]. Moreover, ΠP(ρ) (ΠAP(ρAB)) is a non-empty convex set for any ρ (ρAB) and P.
Witnessing non-Markovianity with distinguishability of ensembles.— We apply an n-output measurement {Pi}i=1n on a state that we randomly extract from an ensemble E={pi,ρi}i=1n of states of S(H). The guessing probability Pg(E) is the average probability to successfully identify the extracted state with an optimal measurement. This quantity is defined as
[TABLE]
where the maximization is performed over the n-output POVMs of B(H).
Now we describe how guessing probability can be used to witness non-Markovianity.
We consider a finite-dimensional system HS⊗HA′, where the open quantum system S is evolved by a generic {ΛS(t,t0)}t and A′ is an ancillary system. Given an initial ensemble ESA′(t0)={pi,ρSA′,i}i, we consider its evolution:
[TABLE]
where IA′:S(HA′)→S(HA′) is the identity map on S(HA′). For any CPTP map Λ acting on the states of E={pi,ρi}i, Pg(E) is non-increasing: Pg({pi,ρi}i)≥Pg({pi,Λ(ρi)}i). Therefore, if {ΛS(t,t0)}t is CP-divisible,
[TABLE]
for every τ≥t0 and Δτ≥0.
Given any evolution {ΛS(t,t0)}t and time interval [τ,τ+Δτ], there exist an ancillary system A′ and an initial ensemble ESA′(t0) of separable states of S(HS⊗HA′)
[TABLE]
such that we have a backflow
[TABLE]
if and only if there is no CPTP intermediate map VS(τ+Δτ,τ), as shown in Ref. BD . Moreover, P≡{pi}i=1n is finite and \mboxdim(HA′)≤dS≡\mboxdim(HS). We underline that, even if we do not make it explicit, ESA′(t0) strictly depends on {ΛS(t,t0)}t and [τ,τ+Δτ].
The result of Ref. BD is general and applies to any evolution defined on a finite-dimensional system.
A class of correlation measures.—
Let P≡{pi}i be a generic finite probability distribution and ρAB∈S(HA⊗HB) a generic finite-dimensional bipartite system state. We consider the correlation measure
[TABLE]
where the maximization is performed over the P-POVMs on A for ρAB and we used the definitions Pg(ρAB,{PA,i}i)≡Pg(E(ρAB,{PA,i}i)) and pmax≡maxipi (see Fig 1). Therefore, we can consider a class of correlation measures where each element is defined by a different distribution P.
The operational meaning of this correlation measure for a given P is the following. Its value (modulo pmax) is the largest guessing probability of the ensembles {pi,ρB,i}i on B that A can generate measuring its side of ρAB with P-POVMs. Therefore, CAP(ρAB(1))>CAP(ρAB(2)) implies that the largest distinguishability of the P-distributed output ensembles of B that A can generate measuring ρAB(1) is greater than the largest distinguishability of the P-distributed output ensembles of B that A can generate measuring ρAB(2).
To consider CAP a proper correlation measure, we have to show that it is: zero-valued for product states, non-negative and monotonically decreasing under local operations long . In order to prove the first property, given a generic product state ρAB=ρA⊗ρB, the output ensemble E(ρA⊗ρB,{PA,i}i)={pi,ρB}i is made of identical states for any POVM {PA,i}i and Pg({pi,ρB}i)=pmax. Therefore, while CAP(ρAB)≥0 is now trivial, the proof for the monotonicity of CAP(ρAB) under local operations is in the Supplemental Material (SM).
Similarly, we can define the class of measures of the form
[TABLE]
Since in general CAP(ρAB)=CBP(ρAB), we can consider the symmetric class of measures
[TABLE]
Finally, we notice that the correlation measures given in Eqs. (7), (8) and (9)
can be considered as generalizations for generic distributions P of the correlation measures introduced in Ref. PRA , where only uniform distributions are considered.
*The probe states.—*The goal of this work is to prove a one-to-one correspondence between non-Markovianity and correlation backflows. Therefore, similarly to Ref. BD , we consider the most general scenario where a family of dynamical maps ΛS(t,t0) defines the evolution for t≥t0 and we focus on a generic time interval [τ,τ+Δτ]. We provide an initial probe state and a distribution P for which the correlation measure CAP shows a backflow in the time interval [τ,τ+Δτ] if and only if there is no CPTP intermediate map VS(τ+Δτ,τ).
First, we introduce the bipartition and the state space needed to consider CAP and the initial probe state.
We define the bipartite system S(HA⊗ HB) such that dim(HA)= n
and HB≡HS⊗HA′⊗HA′′, where \mboxdim(HS)=\mboxdim(HA′)=dS and dim(HA′′)=n+1.
We fix the following orthonormal basis for HA and HA′′: MA≡{∣i⟩A}i=1n={∣1⟩A,∣2⟩A,...,∣n⟩A} and
MA′′≡{∣i⟩A′′}i=1n+1={∣1⟩A′′,∣2⟩A′′,...,∣n+1⟩A′′}. Notice that the ancillas A′ and A′′ can be considered as a single ancilla with Hilbert space HA′⊗HA′′ (see Fig. 2).
We define ρB,i≡ρSA′,i⊗∣n+1⟩⟨n+1∣A′′∈S(HB), for i=1,…,n, where we made use of the elements of ESA′(t0)={pi,ρSA′,i}i=1n (see Eq. (5)). We introduce a class of initial probe states ρAB(λ)(t0)∈S(HA⊗HB) parametrized by λ∈[0,1)
[TABLE]
where σSA′ is a generic state of S(HS⊗HA′). Notice that in Eq. (10) the index i runs from 1 to n. Since the ancillary systems do not evolve, the action of the dynamical map of the evolution on the probe state, i.e., IA⊗ΛS(t,t0)⊗IA′A′′(ρAB(λ)(t0)), preserves the initial classical-quantum separable structure for any t≥t0
[TABLE]
where ρB,i(t)=ΛS(t,t0)⊗IA′A′′(ρB,i) and σSA′(t)=ΛS(t,t0)⊗IA′(σSA′). Finally, since \mboxTrB[ρAB(λ)(t)]=∑i=1npi∣i⟩⟨i∣A, the set ΠAP(ρAB(λ)(t))=ΠP(\mboxTrB[ρAB(λ)(t)]) does not depend on t and λ.
*Witnessing non-Markovianity with correlations.—*We provide a procedure that witnesses any non-Markovian dynamics with a correlation backflow.
In the case of bijective or pointwise non-bijective ΛS(t,t0),
this scenario has been studied in Refs. PRA ; Janek . Moreover, the negativity entanglement measure witnesses any non-Markovian qubit evolution Janek .
In order to witness non-Markovianity through backflows of CAP, the evolution of the initial state ρASA′=∑i=1npi∣i⟩⟨i∣A⊗ρSA′,i is an intuitive choice. Indeed, {∣i⟩⟨i∣A}i=1n∈ΠAP(ρASA′(t)) for all t≥t0 and Pg(ρASA′(t),{∣i⟩⟨i∣A}i=1n)=Pg(ESA′(t)) (see Eq. (6)). Nonetheless, in general {∣i⟩⟨i∣A}i=1n is not selected by the maximization that defines CAP(ρASA′(t)) long .
We present the main result of this work, namely that the class of correlation measures CAP is able to witness any non-Markovian dynamics.
Theorem 1**.**
For any evolution {ΛS(t,t0)}t defined on a finite-dimensional system S and time interval [τ,τ+Δτ] there exist at least one ancillary system H, one bipartite system HA⊗HB, where HB=HS⊗H, a correlation measure for bipartite systems CAB and an initial state ρAB(t0)∈S(HA⊗HB) such that a backflow
[TABLE]
occurs if and only if there is no CPTP intermediate map VS(τ+Δτ,τ), where S is the only system that evolves during the evolution.
Proof.
We consider the ancillary system H=HA′⊗HA′′, the correlation measure CAB=CAP and the set of initial probe states ρAB(λ)(t0).
We prove that, for wisely chosen values of λ, we have a backflow
[TABLE]
if and only if there is no CPTP intermediate map VS(τ+Δτ,τ).
We notice that {∣i⟩⟨i∣A}i=1n∈ΠAP(ρAB(λ)(t)) is a P-POVM on A for the probe state. Moreover, as noticed above, ΠAP(ρAB(λ)(t)) does not depend on λ and t. In the following, if not specified otherwise, the index i runs from 1 to n. The output ensemble that we obtain measuring ρAB(λ)(t) with {∣i⟩⟨i∣A}i is
[TABLE]
The corresponding guessing probability is (See SM)
[TABLE]
Now we consider {PA,i}i∈ΠAP(ρAB(λ)(t)) different from {∣i⟩⟨i∣A}i. In general, we obtain (See SM):
[TABLE]
Each state σB,i⊥(t) is defined as σB,i⊥(t)≡σSA′(t)⊗ρA′′,i⊥, where ρA′′,i⊥ is a convex combination of the states {∣k⟩⟨k∣A′′}k=1n. Analogously, σB,i∥(t)≡ρSA′,i∥(t)⊗∣n+1⟩⟨n+1∣A′′, where ρSA′,i∥(t) is a convex combination of the states {ρSA′,k(t)}k=1n (See SM).
Similarly to Eq. (32), we obtain
[TABLE]
In order to understand when CAP(ρAB(λ)(t)) shows a backflow in [τ,τ+Δτ], we write:
[TABLE]
We focus on CAP(ρAB(λ)(t)) at t=τ for different values of λ (we omit the dependence on τ of some quantities to increase readability). We define the “optimal” P-POVMs {PA,i(λ)}i to be the P-POVMs that at t=τ solve the maximization that defines CAP(ρAB(λ)(τ))
[TABLE]
We consider Eq. (33) when an optimal {PA,i(λ)}i is chosen. We define the corresponding ensembles that appear in this expression E⊥({PA,i(λ)}i) and E∥({PA,i(λ)}i), namely
[TABLE]
We focus on Eq. (17) and we distinguish the two possible scenarios:
(A): one of the optimal measurements is {PA,i(λ)}i={∣i⟩⟨i∣A}i for some λ∈[0,1),
(B): none of the optimal measurements {PA,i(λ)}i is equal to {∣i⟩⟨i∣A}i for any λ∈[0,1).
We start studying case (A).
In SM we prove that if {∣i⟩⟨i∣A}i is an optimal P-POVM for some λ∗, then the same is true for any λ∈(λ∗,1). From Eqs. (6), (32) and (17), for λ∈(λ∗,1)
[TABLE]
if and only if there is no CPTP intermediate map VS(τ+Δτ,τ) for ΛS(t,t0).
Now we analyze case (B).
In SM we show that for λ=1 the unique optimal P-POVM is {∣i⟩⟨i∣A}i. Moreover, Pg(ρAB(λ)(τ),{PA,i}i) is Lipschitz continuous in λ and Pg(ρAB,{PA,i}i) is Lipschitz continuous in {PA,i}i. This implies that the set of optimal P-POVMs {PA,i(λ)}i is contained in a neighbourhood of {∣i⟩⟨i∣A}i with size decreasing towards zero as λ approaches 1.
This in turn implies that the set of guessing probabilities Pg(E∥({PA,i(λ)}i)) for different {PA,i(λ)}i is contained in an interval that converges on Pg(ESA′(τ)) (See SM for proof). If we define Pg∥(λ)≡max{PA,i(λ)}iPg(E∥({PA,i(λ)}i)) and Pg⊥(λ)≡max{PA,i(λ)}iPg(E⊥({PA,i(λ)}i)),
it holds that
[TABLE]
Hence, for δ≡Pg(ESA′(τ+Δτ))−Pg(ESA′(τ))>0 (which is in the form of Eq. (6)), there exists λ∈[0,1) such that
Pg∥(λ)−Pg(ESA′(τ))<Pg(ESA′(τ+Δτ))−Pg(ESA′(τ)) for any λ∈(λ,1). It follows that
[TABLE]
To conclude, we consider inequalities (17) and (22) for λ∈(λ,1) and we obtain a backflow
[TABLE]
[TABLE]
if and only if there is no CPTP intermediate map VS(τ+Δτ,τ) for {ΛS(t,t0)}t.
∎
We showed that for every non-Markovian evolution there exist initial probe states ρAB(λ)(t0) that provide at least one backflow of the correlation measure CAP if and only if the dynamics is non-Markovian.
The robustness of this backflow is provided by the following properties that are valid for any {ΛS(t,t0)}t and [τ,τ+Δτ]: the guessing probability Pg(ρAB,{PA,i}i)
is a Lipschitz continuous function of ρAB∈S(HA⊗HB) and POVMs {PA,i}i (See SM), ΠAP(ρAB(λ)(t)) does not depend on λ and t, and there exists a continuous interval of values of λ for which ρAB(λ)(t0) allows backflows of CAP(ρAB(λ)(t)) when there is no CPTP intermediate map VS(τ+Δτ,τ). Therefore, if we add small enough perturbations to ρAB(λ)(t0) and the optimal P-POVMs obtained by the maximization in Eq. (7), we still obtain backflows of CAP for any non-Markovian dynamics.
Hence, there exists a set of initial states with the same dimension as S(HA⊗HB) that provide a backflow of CAP in the scenario described above (See SM for more details).
Since there are no particular assumptions for the structure of ESA′(t0) BD , it is straightforward to adapt our technique to any other ensemble. In particular, if the evolution of an initial ensemble {pi,ϕSA′,i}i=1n provides a backflow of Pg({pi,ϕSA′,i(t)}i=1n) in a time interval [τ,τ+Δτ], we can consider CAP(ψAB(λ)(t0)), where P={pi}i=1n and ψAB(λ)(t0)=∑i=1npi∣i⟩⟨i∣A⊗(λσSA′⊗∣i⟩⟨i∣A′′+(1−λ)ϕSA′,i⊗∣n+1⟩⟨n+1∣) and obtain a backflow of CAP(ψAB(λ)(t)) in [τ,τ+Δτ].
We make some examples of ensembles (different from ESA′(t0)) that can be considered to witness particular classes of non-Markovian evolutions. A constructive method that provides ensembles of two equiprobable states that witness any bijective or pointwise non-bijective non-Markovian dynamics is given in Ref. bogna . The existence of two-state ensembles that detect any image non-increasing evolution, namely such that \mboxIm(Λt)⊆\mboxIm(Λs) for any s<t, is proven in Ref. imagenon . Finally, in Ref. qubitchrusc is proven that two-state ensembles are sufficient to witness any non-Markovian qubit evolution.
Similarly to prior measures of non-Markovianity that catch increases of quantities that are monotonically decreasing under Markovian evolutions RHP ; BLP ; LFS ; BognaChannel0 ; Volume , we define the class
[TABLE]
where the sup is over the possible ancillary systems (A and A′) and the initial states ρASA′(t0)∈S(HA⊗HS⊗HA′). As a consequence of Theorem 1, if CAP(ρASA′(t)) is differentiable, NP({ΛS(t,t0)}t)>0 if and only if the evolution is non-Markovian (See SM for details and a discussion of the non-differentiable case).
Indeed, for any time interval where the evolution cannot be described by a CPTP intermediate map, we proved the existence of a set of initial states that show an increase of CAP in the same time interval.
We notice that NP with P={1/2,1/2} is non-zero for any bijective or pointwise non-bijective non-Markovian evolution PRA .
*Discussion.—*In this work we showed that any non-Markovian dynamics can be witnessed through backflows of CAP. For this purpose, we introduced a class of initial probe states ρAB(λ)(t0) that allows to accomplish this task. Hence, we proved the first one-to-one correspondence between CP-divisibility of evolutions, namely Markovianity, and the absence of correlation backflows.
It would be useful to obtain a constructive method that provides the elements of ESA′(t0) that we used to define the initial probe state. Moreover, since the class of bipartite correlations that we studied does not consider the subsystems A and B symmetrically, an open question is to understand if also CABP (see Eq. (9)) is able to witness any non-Markovian evolution.
The computation required to evaluate the measures of non-Markovianity NP can be significantly demanding. We consider interesting the possibility to formulate simplified versions of these measures (e.g, that require a simplified computation, are specialized to measure evolutions with particular properties).
Acknowledgements.
- Acknowledgments.—* We would like to thank A. Acín, B. Bylicka and M. Lostaglio for insightful discussions and comments on a previous draft.
Support from the
Spanish MINECO (QIBEQI FIS2016-80773-P and Severo Ochoa SEV-2015-0522), the
Fundació Privada Cellex, the
Generalitat de Catalunya (CERCA Program and SGR1381), is acknowledged. D.D.S acknowledge support from the ICFOstepstone programme, funded by the Marie Skłodowska-Curie COFUND action (GA665884).
Appendix A Monotonic behavior of CAP under local operations
We consider a general bipartite finite-dimensional quantum system with Hilbert space HAB=HA⊗HB. Therefore, the states that we consider are ρAB∈S(HAB).
We consider a generic finite probability distribution P={pi}i=1n and we prove that CAP is monotone under local operations of the form ΛA⊗IB and IA⊗ΛB on ρAB, where ΛA (ΛB) is a CPTP map on A (B) and IA (IB) is the identity map on S(HA) (S(HB)).
In order to show the effect of the application of a local operation of the form ΛA⊗IB on CAP(ρAB), we look at ΠAP(ρAB) in a different way. Each element of this collection is a P-POVM for ρAB, i.e., they generate output ensembles where the output probability distribution is P={pi}i. In fact, we can consider CAP(ρAB) as the maximization over all the possible output ensembles with output probability distribution P that we can generate measuring the subsystem A of ρAB.
The effect of the first local operation that we consider is: ρ~AB=ΛA⊗IB(ρAB)=∑k(Ek⊗\mathbbm1B)ρAB(Ek⊗\mathbbm1B)†,
where {Ek}k is a set of Kraus operators that corresponds to ΛA. Now we analyze the relation between ΠAP(ρAB) and ΠAP(ρ~AB). Given a P-POVM for ρ~AB, i.e., {PA,i}i∈ΠAP(ρ~AB), the probabilities and the states of the output ensemble E(ρ~AB,{PA,i}i) are
\mboxTr[ρ~ABPA,i⊗\mathbbm1B]=pi and ρ~B,i=\mboxTrA[ρ~ABPA,i⊗\mathbbm1B]/pi. Now we write the i-th element of the output probability distribution that we obtain applying {PA,i}i on ρ~AB, namely pi=\mboxTr[ΛA⊗IB(ρAB)PA,i⊗\mathbbm1B], as follows
[TABLE]
where we have defined the operators P~A,i≡ΛA∗(PA,i)=∑k(Ek†⊗\mathbbm1B)PA,i(Ek⊗\mathbbm1B). Similary, we can write ρ~B,i=\mboxTrA[ρ~ABPA,i]/pi=\mboxTrA[ρABP~A,i]/pi. Therefore, since
pi=\mboxTr[ρABP~A,i] and ρ~B,i=\mboxTrA[ρABP~A,i]/pi, if we apply {P~A,i}i on ρAB we obtain the same P-distributed output ensemble {pi,ρ~B,i}i that we obtain applying {PA,i}i on ρ~AB.
Next we show that:
{P~A,i}i={ΛA∗(PA,i)}i={∑kEk†PA,iEk}i,
is a proper n-output POVM. First, the elements of {P~A,i}i sum up to the identity:
∑iP~A,i=∑k,iEk†PA,iEk=∑kEk†(∑iPA,i)Ek=∑kEk†Ek=\mathbbm1B.
Moreover, we show that they are positive semi-definite operators. Indeed, for any ∣ψ⟩A∈HA, we have ⟨ψ∣AP~A,i∣ψ⟩A=∑k(⟨ψ∣AEk†)PA,i(Ek∣ψ⟩A)=∑k⟨ψk∣APA,i∣ψk⟩A≥0, where each element of the last sum is non-negative because PA,i is positive semi-definite.
It follows that {P~A,i}i is a POVM and in particular a P-POVM for ρAB, i.e., {P~A,i}i∈ΠAP(ρAB). Thus, for every P-POVM {PA,i}i∈ΠAP(ρ~AB) for ρ~AB, there is a P-POVM {P~A,i}i∈ΠAP(ρAB) for ρAB, such that the output ensembles are identical: E(ρ~AB,{PA,i}i)=E(ρAB,{P~A,i}i). Hence, any P-distributed ensemble of B that can be generated from ρ~AB can also be obtained from ρAB. Therefore, we obtain the following inclusion
[TABLE]
Finally, since as we said above CAP(ρAB) is the maximum guessing probability of the P-distributed output ensembles that can be generated from ρAB, from Eq. (26) we conclude that CAP(ρAB) is defined as a maximization over a set that includes the set over which maximization defines CAP(ρ~AB). Hence, for any state ρAB and CPTP map ΛA, we obtain
[TABLE]
Next we show that CAP(ρAB) is monotonic under local operations of the form IA⊗ΛB. We find that the collection of the P-POVMs for ρ~AB=IA⊗ΛB(ρAB), namely ΠAP(ρ~AB), coincides with ΠAP(ρAB).
In order to prove this, we apply a general POVM {PA,i}i both on ρAB and ρ~AB and we show that the respective output ensembles are defined by the same probability distribution. Indeed, being \mboxTr[ρABPA,i] (\mboxTr[IA⊗ΛB(ρAB)PA,i]) the probability for the i-th output of the POVM considered when it is applied on ρAB (ρ~AB), we have \mboxTr[IA⊗ΛB(ρAB)PA,i]=\mboxTr[ρABPA,i], where this identity uses the trace-preserving property of the superoperator IA⊗ΛB. Consequently, if {PA,i}i is a P-POVM for ρAB, which means that \mboxTr[ρABPA,i]=pi, in the same way \mboxTr[IA⊗ΛB(ρAB)PA,i]=pi. Hence, {PA,i}i∈ΠAP(ρAB) if and only if {PA,i}i∈ΠAP(ρ~AB), i.e.,
[TABLE]
Given a P-POVM {PA,i}i both for ρAB and ρ~AB, we compare the corresponding output states
[TABLE]
From Eq. (29) and the definition of the guessing probability, it follows that
[TABLE]
The consequence of the last relation is that for any P-distributed output ensemble ensemble that we can generate from ρ~AB there exists at least one P-distributed output ensemble that we can generate from ρAB for which the guessing probability is equal or greater. Hence, considering the definition of CAP, Eqs. (28) and (30), we conclude that
[TABLE]
for any state ρAB and CPTP map ΛB.
Appendix B Performing P-POVMs on the probe state: the orthogonal and the parallel components
In this section we prove that, if we apply the projective P-POVM {∣i⟩⟨i∣A}i on A for ρAB(λ)(t), we obtain
[TABLE]
Moreover, for a general P-POVM on A for ρAB(λ)(t) different from {∣i⟩⟨i∣A}i, we have
[TABLE]
for some {ρA′′,i⊥}i and {ρSA′,i∥(t)}i that we define.
First, we notice that the projective measurement {∣i⟩⟨i∣A}i=1n is a P-POVM on A for ρAB(λ)(t) for any t and λ. We consider E(ρAB(λ)(t),{∣i⟩⟨i∣A}i), namely the ensemble of B that we obtain measuring ρAB(λ)(t) with {∣i⟩⟨i∣A}i:
[TABLE]
where ρB,i=ρSA′,i⊗∣n+1⟩⟨n+1∣A′′.
We evaluate the guessing probability of this ensemble and we obtain
[TABLE]
[TABLE]
We notice that, for any i=1,…,n, every state that belongs to the set {σSA′(t)⊗∣i⟩⟨i∣A′′}i is orthogonal to every state of the set {ρSA′,i(t)⊗∣n+1⟩⟨n+1∣A′′}i. It follows that, for any i=1,…,n, the value of \mboxTrB[σSA′(t)⊗∣i⟩⟨i∣A′′PB,i] depends only on the components of PB,i that belong to span({∣i⟩⟨j∣B}ij), where ∣i⟩B and ∣j⟩B belong to the tensor product between the elements of MSA′, i.e., an orthonormal basis of HS⊗HA′, and {∣k⟩A′′}k=1n (notice that dim(HA′′)=n+1). Similarly, for any i=1,…,n, the value of \mboxTrB[ρSA′,i(t)⊗∣n+1⟩⟨n+1∣A′′PB,i] depends only on the components of PB,i that belong to span({∣i′⟩⟨j′∣B}i′j′), where ∣i′⟩B and ∣j′⟩B belong to the tensor product between the elements of MSA′ and ∣n+1⟩A′′. We further note that no operator defined on span({∣i⟩⟨j∣B}ij)⊕span({∣i′⟩⟨j′∣B}i′j′) that is not positive semidefinite can be made positive semidefinite by adding something outside span({∣i⟩⟨j∣B}ij)⊕span({∣i′⟩⟨j′∣B}i′j′). Therefore, we can limit the maximization in Eq. (35) to be over POVMs PB,i that are defined on span({∣i⟩⟨j∣B}ij)⊕span({∣i′⟩⟨j′∣B}i′j′), without affecting the optimal value.
Since span({∣i⟩⟨j∣B}ij) is orthogonal to span({∣i′⟩⟨j′∣B}i′j′), the maximization in Eq. (35) can be divided in two independent maximizations
[TABLE]
[TABLE]
[TABLE]
where we have used Pg({pi,∣i⟩⟨i∣A′′}i)=1, namely the possibility to perfectly distinguish ensembles of orthonormal states, Pg({pi,σSA′(t)⊗∣i⟩⟨i∣A′′}i)=Pg({pi,∣i⟩⟨i∣A′′}i) and Pg({pi,ρSA′,i(t)⊗∣n+1⟩⟨n+1∣A′′}i)=Pg({pi,ρSA′,i(t)}i)=Pg(ESA′(t)).
The output ensemble that we obtain applying a generic P-POVM {PA,i}i on A for ρAB(λ)(t) different from {∣i⟩⟨i∣A}i is E(ρAB(λ)(t),{PA,i}i). The k-th state of this ensemble is
[TABLE]
[TABLE]
where (PA,k)ii=⟨i∣APA,k∣i⟩A≥0 is the i-th diagonal element of PA,k in the basis MA={∣i⟩A}i=1n. Keeping in mind that P is a finite probability distribution and pk>0 for any k, we define the parameters eik≡(PA,k)iipi/pk≥0. Since ρB,k(λ)(t) and the states λσSA′(t)⊗∣i⟩⟨i∣A′′+(1−λ)ρB,i(t) are trace one operators for any i=1,…,n , we conclude that ∑ieik=1 for any k=1,…,n. Therefore, {eik}i=1n is an n-element probability distribution for any value of k=1,...,n. We write:
[TABLE]
where we have used the definitions
[TABLE]
[TABLE]
Each state ρA′′,k⊥ (ρSA′,k∥(t)) is a convex combination of the states {∣i⟩⟨i∣A′′}i=1n ({ρSA′,i(t)}i=1n) that does not depend on λ but depends on the P-POVM {PA,i}i chosen. From Eq. (38) it follows that, if we consider a generic P-POVM {PA,i}i for ρAB(λ)(t), we obtain
[TABLE]
and therefore, similarly to Eq. (36), now we can write
[TABLE]
Appendix C Analysis of case (A)
Let assume that for some α∈[0,1) we have that {PA,i(α)}i={∣i⟩⟨i∣A}i, i.e., this projective measurement is one of the optimal P-POVM that accomplishes the maximization for CAP(ρAB(α)(τ)), and that for some β>α instead we have that {∣i⟩⟨i∣A}i is not optimal. In this section we show that these two assumptions are incompatible and lead to a contradiction. The first condition implies that, when λ=α the optimal P-POVM that provides the greatest value of Pg(ρAB(α)(τ),{PA,i}i) is {PA,i(α)}i={∣i⟩⟨i∣A}i and therefore
[TABLE]
[TABLE]
where we also considered the cases where {PA,i(β)}i is optimal both for λ=α and λ=β.
On the other hand, for λ=β>α we have that {∣i⟩⟨i∣A}i is not an optimal P-POVM for the maximization needed for CAP(ρAB(β)(τ)) and
[TABLE]
which can be written as
[TABLE]
and therefore, subtracting the quantity α(Pg(E⊥(β))−1+Pg(ESA′(τ))−Pg(E∥(β))) from each side of inequality (45), we obtain
[TABLE]
If inequality (44) holds, then Pg(E∥(β))>Pg(ESA′(τ)). Therefore, Pg(ESA′(τ))−Pg(E∥(β))<0 and we conclude that the left-hand side of inequality (46) is negative. The right-hand side of the same inequality is instead non-negative for inequality (43). This contradiction shows that if for some value of the parameter λ the orthogonal measurement {∣i⟩⟨i∣A}i maximizes Pg(ρAB(λ)(τ),{PA,i}i), then it is also the case for any greater value of λ. In conclusion, if one of the optimal measurement is {∣i⟩⟨i∣A}i for λ=α, the same is true for any β∈[α,1).
Appendix D Study of the limit λ→1 in case (B)
First, we notice that the set of P-POVMs on A for ρAB(λ)(t) is a set that does not depend on λ and t. Indeed, we use the notation ΠAP=ΠAP(ρAB(λ)(τ)).
Now we prove that the only optimal P-POVM for CAP(ρAB(1)(τ)) is the projective measurement {∣i⟩⟨i∣A}i. In the case of an optimal {PA,i}i∈ΠAP for ρAB(1)(τ) we obtain the output ensemble (see Eq. (39))
[TABLE]
where ∑jeji=1 for any i=1,…,n. Since Pg(ρAB(1)(τ),{∣i⟩⟨i∣A}i)=1, an optimal P-POVM different from {∣i⟩⟨i∣A}i must provide an output ensemble E(ρAB(1)(τ),{PA,i}i) of orthogonal states. Given the identity Pg(E(ρAB(1)(τ),{PA,i}i)=Pg({pi,∑jeji∣j⟩⟨j∣A′′}i), we have to check if, for some eij, the ensemble {pi,∑jeji∣j⟩⟨j∣A′′}i can be an orthogonal ensemble of states different from {pi∣i⟩⟨i∣A′′}i. Each state ρA′′,i⊥=∑jeji∣j⟩⟨j∣A′′ is defined as a convex combination of the states {∣i⟩⟨i∣A′′}i. Two such states are orthogonal only if the respective convex combinations do not have any element ∣i⟩⟨i∣A′′ in common. Therefore, the only way to have nˉ orthogonal output states is if for each i the state is of the form ρA′′,i⊥=∣j⟩⟨j∣A′′ for some j=j(i) exclusively assigned to i. Thus, each PA,i has only one nonzero diagonal element (PA,i)jj=⟨j∣APA,i∣j⟩A. Since ∑iPA,i=\mathbbm1A this is only possible if {PA,i}i={∣i⟩⟨i∣A}i.
We proved that {∣i⟩⟨i∣A}i∈ΠAP is the only optimal P-POVM for the evaluation of CAP(ρAB(1)(τ)). Therefore, for any P-POVM {PA,i}i={∣i⟩⟨i∣A}i we have that Pg(ρAB(1)(τ),{PA,i}i)<1.
We notice that the set ΠAP is closed and bounded, i.e., it is compact. Indeed, it is a subset of B(HA) that is defined through linear constraints involving identities and relations of semi-positivity. The guessing probability Pg(ρAB(1)(τ),{PA,i}i) is a continuous function on this compact set of P-POVMs.
We now show that Pg(ρAB(λ)(τ),{PA,i}i) is Lipschitz continuous in λ. In other words we construct a bound on the change of the guessing probability for a given change in λ. To do so we first show that Pg(ρAB,{PA,i}i) is Lipschitz continuous on the set of states.
Consider Pg(ρAB,{PA,i}i) as a function of ρAB.
We consider a pair ρAB1, ρAB2 and observe that
[TABLE]
Let Δ be a diagonal matrix such that Δ=U(ρAB1−ρAB2)U† for a unitary U. Let Δ+ and Δ− be the two diagonal positive semidefinite matrices such that Δ=Δ+−Δ−. Note that U†Δ+U and U†Δ−U are positive semidefinite. This implies
[TABLE]
Since POVM elements are positive semidefinite \mboxTr[PA,i⊗PB,j(U†Δ+U)] is positive for each pair PA,i, PB,j.
Therefore \mboxTr[∑iPA,i⊗PB,i(U†Δ+U)]≤\mboxTr[∑iPA,i⊗∑jPB,j(U†Δ+U)]=\mboxTr[U†Δ+U]=\mboxTr[Δ+]. Likewise ∑i\mboxTr[PA,i⊗PB,i(U†Δ−U)]≤\mboxTr[Δ−]. Thus,
[TABLE]
Considering Eqs. (48) and (50) we can now conclude that
[TABLE]
By exchanging the 1 and 2 in the above derivation we obtain
[TABLE]
Thus
[TABLE]
Note that this bound is independent of {PA,i}i. Thus we see that Pg(ρAB,{PA,i}i) is Lipschitz continuous on the set of states.
Next we consider the pair ρAB(λ1)(τ),ρAB(λ2)(τ) and note that the trace norm ∣∣ρAB(λ1)(τ)−ρAB(λ2)(τ)∣∣1=2∣λ1−λ2∣.
Therefore,
[TABLE]
Thus we see that Pg(ρAB(λ)(τ),{PA,i}i) is Lipschitz continuous in λ.
We next consider how the set of optimal P-POVMs converges to {∣i⟩⟨i∣A}i as λ→1 using the bound in Eq. (54).
Consider a semi-open neighbourhood O1 of the projective P-POVM {∣i⟩⟨i∣A}i such that the set S1≡ΠAP−O1 of P-POVMs not in O1 is closed. Since the set S1 is closed and bounded and Pg(ρAB(1)(τ),{PA,i}i) is a continuous function on ΠAP there exists a maximum value m1<1 of Pg(ρAB(1)(τ),{PA,i}i) on S1, i.e.,
m1≡max{PA,i}i∈S1Pg(ρAB(1)(τ),{PA,i}i)<1.
Then, due to Eq. (54), for ϵ>0 and λ=1−ϵ it holds that Pg(ρAB(1−ϵ)(τ),{PA,i}i)≤m1+2ϵ on S1 and the maximum value of Pg(ρAB(1−ϵ)(τ),{PA,i}i) on O1 is larger or equal to 1−2ϵ.
There exists a sufficiently small ϵ1>0 such that 1−2ϵ1=m1+2ϵ1.
For all ϵ<ϵ1 the set of optimal P-POVMs belongs to O1.
We next consider a sequence of semi-open sets Oi which all contain {∣i⟩⟨i∣A}i and are such that Oi+1⊂Oi. There is a corresponding sequence of closed sets Si≡ΠAP−Oi and non-decreasing sequence of maximal values mi<1 of Pg(ρAB(1)(τ),{PA,i}i) on Si.
For each mi there is an ϵi such that for all ϵ<ϵi the optimal P-POVMs, namely the P-POVMs that maximize Pg(ρAB(1−ϵ)(τ),{PA,i}i), belong to Oi. The sequence of ϵi is non-increasing since the sequence of mi is non-decreasing.
Let us consider a distance measure d(⋅,⋅) on B(HA) and define a sequence O(δi) of semi-open sets as the P-POVMs {PA,i}i such that d(PA,i,∣i⟩⟨i∣A)<δi for any i=1,...,n, for a strictly decreasing sequence δi+1<δi where δi→0 as i→∞.
Then from the above argument we can conclude that, for any δ>0 there exists a value λδ∈(0,1) such that, if λ∈(λδ,1), any optimal P-POVM {PA,i(λ)}i for this λ is such that d(PA,i(λ),∣i⟩⟨i∣A)<δ for any i=1,...,n.
Next we show that Pg(ρAB,{PA,i}i) is Lipschitz continuous as a function of {PA,i}i. In other words, we construct a bound on the change of the guessing probability proportional to a distance measure quantifying the change of the POVM {PA,i}i, valid for any ρAB∈S(HA⊗HB).
We select a pair {PA,i1}i, {PA,i2}i and observe that
[TABLE]
Let Δi be a diagonal matrix such that Δi=Ui(PA,i1−PA,i2)Ui† for a unitary Ui. Let Δi+ and Δi− be the two diagonal positive semidefinite matrices such that Δi=Δi+−Δi−. Note that Ui†Δi+Ui and Ui†Δi−Ui are positive semidefinite. This implies
[TABLE]
Since POVM elements are positive semidefinite \mboxTr[Ui†(Δi+)Ui⊗PB,iρAB] is positive for each PB,j.
Therefore \mboxTr[Ui†(Δi+)Ui⊗PB,iρAB]≤\mboxTr[Ui†(Δi+)Ui⊗∑jPB,jρAB]=\mboxTr[Ui†(Δi+)Ui⊗\mathbbm1BρAB]. Likewise \mboxTr[Ui†(Δi−)Ui⊗PB,iρAB]≤\mboxTr[Ui†(Δi−)Ui⊗\mathbbm1BρAB]. Using this we find that
[TABLE]
where we used that \mboxTr[\mathbbm1B]=(n+1)dS2 and for the second inequality we have used Von Neumann’s trace inequality and that the largest eigenvalue of ρAB is smaller or equal to 1. By combining Eq. (55) and Eq. (D) we can now conclude that
[TABLE]
By exchanging the {PA,i1}i and {PA,i2}i in the above derivation we obtain
[TABLE]
Therefore
[TABLE]
Thus we have shown that Pg(ρAB,{PA,i}i) is Lipschitz continuous as a function of {PA,i}i for any ρAB∈S(HA⊗HB).
We now study the guessing probability of the ensemble that we obtain applying {PA,i}i∈ΠAP on ρAB(λ)(t) given by
[TABLE]
We consider Eq. (61) when an optimal {PA,i(λ)}i is chosen. We define the corresponding ensembles that appear in this expression E⊥({PA,i(λ)}i)≡{pi,ρA′′,i⊥}i and E∥({PA,i(λ)}i)≡{pi,ρSA′,i∥(t)}i, so that
[TABLE]
The ensembles E⊥({PA,i(λ)}i) and E∥({PA,i(λ)}i) are functions on the set of optimal P-POVMs {PA,i(λ)}i for a given λ. Thus the image of the function Pg(E⊥({PA,i(λ)}i)) over the set of optimal P-POVMs {PA,i(λ)}i for a given λ, denoted Im(Pg(λ)(E⊥))≡{Pg(E⊥({PA,i(λ)}i)):{PA,i(λ)}ioisooptimal}, is a subset of the interval [0,1], i.e., Im(Pg(λ)(E⊥))⊂[0,1]. Likewise, the function Pg(E∥({PA,i(λ)}i)) takes values in a set Im(Pg(λ)(E∥))⊂[0,1] for a given λ.
Using Eq. (60) we can now construct bounds on Im(Pg(λ)(E⊥)) and Im(Pg(λ)(E∥)) for a given λ. First, based on the above argument we make the following observation: for any η>0 there exists a value λη∈(0,1) such that, if λ∈(λη,1), any optimal P-POVM {PA,i(λ)}i for this λ is such that ∣∣PA,i(λ)−∣i⟩⟨i∣A∣∣1<η for any i=1,...,n.
Thus, by Eq. (60) the values in the image of Pg(E⊥({PA,i(λ)}i)) for λ∈(λη,1) differ from Pg(E⊥({∣i⟩⟨i∣A}i))=1 by less than n(n+1)dS2η, i.e., ∣Pg(E⊥({PA,i(λ)}i))−1∣<n(n+1)dS2η for all optimal {PA,i(λ)}i:λ∈(λη,1) . Likewise, the values in the range of Pg(E∥({PA,i(λ)}i)) for λ∈(λη,1) differ from Pg(E∥({∣i⟩⟨i∣A}i))=Pg(ESA′(τ)) by less than n(n+1)dS2η, i.e., ∣Pg(E∥({PA,i(λ)}i))−Pg(ESA′(τ))∣<n(n+1)dS2η for all optimal {PA,i(λ)}i:λ∈(λη,1).
Using this we can state the following
[TABLE]
Appendix E Lipschitz continuity of CAP on the set of states
Consider a POVM {PA,i}i and two states ρAB and ρ~AB. Let pi=\mboxTr[PA,iρAB] and p~i=\mboxTr[PA,iρ~AB].
Let Δ be a diagonal matrix such that Δ=U(ρ~AB−ρAB)U† for a unitary U. Let Δ+ and Δ− be the two diagonal positive semidefinite matrices such that Δ=Δ+−Δ−. Note that U†Δ+U and U†Δ−U are positive semidefinite. Then
[TABLE]
Since POVM elements are positive semidefinite \mboxTr[PA,jU†Δ+U] is positive for each PA,j.
Therefore \mboxTr[PA,iU†Δ+U]≤\mboxTr[∑jPA,jU†Δ+U]=\mboxTr[U†Δ+U]=\mboxTr[Δ+]. Likewise \mboxTr[PA,i(U†Δ−U)]≤\mboxTr[Δ−]. Thus,
[TABLE]
It follows that
[TABLE]
By exchanging pi and p~i in the above derivation we obtain
[TABLE]
From this we can conclude that
[TABLE]
Assume now that {PA,i}i is a P-POVM for ρAB but not necessarily for ρ~AB.
We can create a P-POVM for ρ~AB from {PA,i}i in the following way.
If p~i−pi>0 we subtract (1−pi/p~i)PA,i from PA,i to create a new element P~A,i≡pi/p~iPA,i.
Let Pr≡∑i∈{i+}(1−pi/p~i)PA,i where the {i+} is the set of all i such that p~i−pi>0 and let pr≡\mboxTr[Prρ~AB]=∑i∈{i+}p~i−pi.
If p~i−pi<0 we add (pi−p~i)/(pr)Pr to PA,i to create a new element P~A,i≡PA,i+(pi−p~i)/(pr)Pr.
Next consider the trace distance between {P~A,i}i and {PA,i}i.
[TABLE]
where we used that ∑i∈/{i+}pi−p~i=pr.
Since each PA,i is positive semidefinite with all eigenvalues less or equal to 1 it follows that
∣∣PA,i∣∣1≤nA where nA≡dim(HA). Moreover, ∣∣Pr∣∣1=∣∣∑i∈{i+}(1−pi/p~i)PA,i∣∣1≤∑i∈{i+}∣1−pi/p~i∣∣∣PA,i∣∣1. Therefore,
[TABLE]
We further note that p~i>pi for i∈{i+} and thus if pmin≡minipi we have that p~i>pmin for i∈{i+}. It follows that ∣(p~i−pi)/p~i∣<∣(p~i−pi)/pmin∣ for i∈{i+}. Hence,
[TABLE]
where ∣P∣ is the number of elements of P and we have used Eq. (68).
Thus if {PA,i}i is a P-POVM for ρAB the minimum trace distance between {PA,i}i and a P-POVM for ρ~AB is upper bounded by 2nA∣P∣∣∣ρ~AB−ρAB∣∣1/pmin. By an analogous argument if {P~A,i}i is a P-POVM for ρ~AB the minimum trace distance between {P~A,i}i and a P-POVM for ρAB is upper bounded by 2nA∣P∣∣∣ρ~AB−ρAB∣∣1/pmin
We now recall Eq. (53) and Eq. (60) from Appendix D showing that the guessing probability Pg(ρAB,{PA,i}i) is Lipschitz continuous on the set of states for a fixed {PA,i}i
[TABLE]
and Lipschitz continuous on the set of POVMs for a fixed ρAB
[TABLE]
where nB≡dim(HB).
We are now ready to show Lipschitz continuity of CAP on the set of states. When ρAB changes to ρ~AB the minimum trace distance between any P-POVM for ρ~AB and a P-POVM for ρAB is upper bounded by 2nA∣P∣∣∣ρ~AB−ρAB∣∣1/pmin. From this and Eq. (73) follows that the difference between the maximum of Pg(ρAB,{PA,i}i) evaluated on the set ΠAP(ρ~AB) of P-POVMs for ρ~AB and the maximum of Pg(ρAB,{PA,i}i) evaluated on the set ΠAP(ρAB) of P-POVMs for ρAB
is upper bounded by 2nAnB∣P∣∣∣ρ~AB−ρAB∣∣1/pmin. Moreover, by Eq. (72) the difference between Pg(ρAB,{PA,i}i) and Pg(ρ~AB,{PA,i}i) for any given {PA,i}i in the union ΠAP(ρAB)∪ΠAP(ρ~AB) of the set of P-POVMs for ρ~AB and the set of P-POVMs for ρAB is upper bounded by ∣∣ρ~AB−ρAB∣∣1. In conclusion the change of CAP when ρAB changes to ρ~AB is upper bounded by (1+2nAnB∣P∣/pmin)∣∣ρ~AB−ρAB∣∣1 , i.e.,
[TABLE]
Thus CAP is Lipschitz continuous on the set of states.
Using Eq. (74) we can make some observations about the robustness of correlation backflows.
If we have a backflow in the interval [τ,τ+Δτ] for an initial state ρAB(t0), i.e., CAP(ρAB(τ+Δτ))−CAP(ρAB(τ))>0, any state ρAB′ such that ∣∣ρ′AB−ρAB(τ+Δτ)∣∣1<pmin/(pmin+2nAnB∣P∣)∣CAP(ρAB(τ+Δτ))−CAP(ρAB(τ))∣ satisfies CAP(ρAB′)−CAP(ρAB(τ))>0. Likewise, if CAP(ρAB(τ+Δτ))−CAP(ρAB(τ))>0 any state ρAB′′ such that ∣∣ρ′′AB−ρAB(τ)∣∣1<pmin/(pmin+2nAnB∣P∣)∣CAP(ρAB(τ+Δτ))−CAP(ρAB(τ))∣ satisfies CAP(ρAB(τ+Δτ))−CAP(ρAB′′)>0. Moreover, if CAP(ρAB(τ+Δτ))−CAP(ρAB(τ))>0 any pair of states ρAB′ and ρAB′′ such that ∣∣ρ′AB−ρAB(τ+Δτ)∣∣1+∣∣ρ′′AB−ρAB(τ)∣∣1<pmin/(pmin+2nAnB∣P∣)∣CAP(ρAB(τ+Δτ))−CAP(ρAB(τ))∣ satisfies CAP(ρAB′)−CAP(ρAB′′)>0.
Thus a backflow can be seen also for evolution of a perturbed initial state ρAB(t0)+χ where χ is traceless Hermitian if ∣∣Λ(τ+Δτ,t0)⊗\mathbbm1B(χ)∣∣1+∣∣Λ(τ,t0)⊗\mathbbm1B(χ)∣∣1<pmin/(pmin+2nAnB∣P∣)∣CAP(ρAB(τ+Δτ))−CAP(ρAB(τ))∣. Since
Λ(t,t0) is CPTP for every t it holds that ∣∣Λ(τ+Δτ,t0)⊗\mathbbm1B(χ)∣∣≤∣∣χ∣∣ and ∣∣Λ(τ,t0)⊗\mathbbm1B(χ)∣∣≤∣∣χ∣∣. Thus there is a neighbourhood of ρAB(t0) such that all states in this neighbourhood show a backflow in the interval [τ,τ+Δτ] and it includes all states ρAB(t0)+χ such that 2∣∣χ∣∣1<pmin/(pmin+2nAnB∣P∣)∣CAP(ρAB(τ+Δτ))−CAP(ρAB(τ))∣. Hence, this neighbourhood has the same dimension as S(HA⊗HB).
Appendix F Comments on the Non-Markovianity measure: the case of non-differentiable CAP(ρASA′(t))
Here we discuss the non-Markovianity measure introduced in Eq. (24) and how it can be extended to work for almost everywhere differentiable CAP(ρASA′(t)). We also comment on how one may construct measures of non-Markovianity based on CAP(ρASA′(t)) using finite differences.
First we consider the case where CAP(ρASA′(t)) is differentiable.
Consider the non-Markovianity measure introduced in Eq. (24) and let [t1,t2] be a closed time interval for which it holds that dtdCAP(ρASA′(t))>0. In Eq. (24) the type of integration used is not specified, but if the Henstock-Kurzweil integral is used it holds that
[TABLE]
if CAP(ρASA′(t)) is differentiable in [t1,t2]. If the Riemann or Lebesgue integral is used there would be the additional requirement that dtdCAP(ρASA′(t)) is Riemann or Lebesgue integrable, respectively.
Next we consider the case where CAP(ρASA′(t)) is almost everywhere differentiable, i.e. CAP(ρASA′(t)) is non-differentiable for at most a countable set of times ti.
At the times where CAP(ρASA′(t)) fails to be differentiable, it is either non-differentiable but continuous or has a discontinuity. Since CAP(ρASA′(t)) is a continuous function on the set of states it has a discontinuity only if the evolution of ρASA′(t) is discontinuous.
To deal with these points of non-differentiability we can define a function dtdCAP(ρASA′(t))∗ that is equal to dtdCAP(ρASA′(t)) for all t for which CAP(ρASA′(t)) is differentiable, and is equal to zero otherwise. If we use the Henstock-Kurzweil integral in the definition of the measure NP({ΛS(t,t0)}t) it is insensitive to how we define dtdCAP(ρASA′(t))∗ in the countable set of ti where CAP(ρASA′(t)) is not differentiable. Thus we can define the measure
[TABLE]
where Δ+(ti) is the value of a discontinuous increase of CAP(ρASA′(t)) at a time ti. This definition reduces to that of Eq. (24) when CAP(ρASA′(t)) is differentiable.
For the case when CAP(ρASA′(t)) is not almost everywhere differentiable the measure in Eq. (76) is not well defined. In this case one can resort to finite difference methods to estimate the amount of non-Markovianity in a given interval. A simple measure of this kind is
[TABLE]
where ti and tf and belong to the interval of interest. We know that if the evolution is non-Markovian there always exists at least one P, some ancillas A and A′, an initial state ρASA′(t0) and a pair of times ti and tf such that CAP(ρASA′(tf))−CAP(ρASA′(ti))>0 (See Theorem 1). Therefore, NfiniteP({ΛS(t,t0)}t)>0 if and only if the evolution {ΛS(t,t0)}t is non-Markovian.