Eventually Entanglement Breaking Maps

# Eventually Entanglement Breaking Maps

Mizanur Rahaman111Department of Pure Mathematics, University of Waterloo 222Institute for Quantum Computing, University of Waterloo , Sam Jaquesfootnotemark: 333Department of Combinatorics and Optimization, University of Waterloo , and Vern I. Paulsenfootnotemark: footnotemark:
###### Abstract

We analyze linear maps on matrix algebras that become entanglement breaking after composing a finite or infinite number of times with themselves. This means that the Choi matrix of the iterated linear map becomes separable in the tensor product space. If a linear map becomes entanglement breaking after finitely many iterations, we say the map has a finite index of separability. In particular we show that every unital PPT-channel has a finite index of separability and that the class of unital channels that have finite index of separability is a dense subset of the unital channels. We construct concrete examples of maps which are not PPT but have finite index of separability. We prove that there is a large class of unital channels that are asymptotically entanglement breaking. This analysis is motivated by the PPT-squared conjecture made by M. Christandl that says every PPT channel, when composed with itself, becomes entanglement breaking.

## 1 Introduction and Motivation

Detecting separability is one of the key aspects of the theory of quantum information. Computationally it is a hard problem to decide whether a state (a positive semi-definite matrix of trace 1) is separable or not. The quantum channel associated to a state is entanglement breaking if the (Choi)state is separable.

An important class of linear maps in this context is the class of PPT maps. The Choi matrices of such maps are positive and have a positive partial transpose. These states turn out to be useful in Quantum Key Distribution (QKD) and dense coding protocols (see [2]). It was observed that all known PPT maps, when composed twice with themselves, become entanglement breaking. Hence a conjecture was put forward by M. Christandl in [17]

###### Conjecture 1.1 (PPT-squared Conjecture).

The composition of two PPT maps is always entanglement breaking.

Our work is closely related to that of Lami and Giovannetti in [13], who studied quantum channels that are “entanglement saving”, i.e., where no power of the map becomes entanglement breaking. They studied such maps in great detail and also provided conditions on when a channel is “asymptotically entanglement saving”. Although they did not study PPT maps in particular, some of our results concerning PPT maps can be deduced from their work. Our proofs use multiplicative domains and are more direct for our particular results. Very recently in [10], the authors analyzed the composition of PPT maps and proved an asymptotic version of the above conjecture. They showed that for every PPT map , the sequence of distances goes to zero as , where is the set of entanglement breaking maps. This finding verifies the conjecture asymptotically, that is, is asymptotically entanglement breaking.

In this paper we look at PPT maps as a particular class of maps which become entanglement breaking after finitely many iterations. If a map is such that is entanglement breaking for some , then we say that has finite index of separability. The spectral and multiplicative properties of unital channels are the key ingredients of this investigation. In Section 3, we provide a structure theorem (Theorem 3.2) for a unital PPT map with respect to its action on projections that are mapped to another projection. This reveals that its action can be restricted to independent blocks on the diagonal in a suitable basis. In Section 4, we prove that every unital PPT channel becomes entanglement breaking after finite iterations (see Theorem 4.4). An illustrative example (Example 5.1) is put forward in Section 5 to show that there are maps which are not PPT yet they become eventually entanglement breaking after finite iterations. It is also shown in Theorem 5.2 that the class of such maps which have finite index of separability is dense in the class of unital channels. In Section 6, a large class of channels are shown to be eventually entanglement breaking in asymptotic sense (see Theorem 6.1).

## 2 Background

We begin with defining a quantum channel which is a completely positive and trace preserving linear map . Note that every linear map on defines a unique element in which is known as the Choi-matrix of and it is defined as , where are the matrix units in . It holds that is completely positive if and only if is positive semi-definite in . For general introduction of completely positive maps and quantum channels we refer to the monographs [15], [20].

One of the main tools we use to investigate iterative properties of a channel is the multiplicative nature of the channel. We note some definitions in this regard.

###### Definition 2.1.

For a linear map , the following set is known as the multiplicative domain of

 ME={a∈Md:E(xa)=E(x)E(a),E(ax)=E(a)E(x), ∀x∈Md}
###### Theorem 2.1 (Choi, [3]).

For a unital completely positive map , the multiplicative domain of is a C-subalgebra of and equals the following set

 ME={x∈Md:E(x∗x)=E(x∗)E(x), E(xx∗)=E(x)E(x∗)}.

Note that if the maps are assumed to be unital, trace preserving and completely positive, then the fixed point set of is defined by

 FixE={a∈Md:E(a)=a}.

This is an algebra and moreover we have . For any unital channel and any , (See [16]), and hence there is some such that for any , . Following [16], we denote this algebra and refer to it as the stabilized multiplicative domain of .

###### Definition 2.2 ([16]).

The multiplicative index of a unital quantum channel is the minimum such that . In other words it is the length of the following decreasing chain of subalgebras

 ME⊇ME2⊇⋯⊇ME∞.

We often denote this number as .

Another useful result is Lemma 2.2 from [16]:

###### Lemma 2.1 (see  [16]).

If are two unital quantum channels, then

 ME2∘E1={x∈ME1|E1(x)∈ME2}.

Next, we note down the definition of separability of a positive matrix.

###### Definition 2.3.

A positive semi-definite matrix is called separable if there exists positive semi-definite matrices and such that .

Separability of states has a close connection to a specific set of channels which we define below.

###### Definition 2.4.

A linear map is called entanglement breaking if the Choi-matrix of , , is separable in .

The set of separable states is a compact convex set and hence so is the set of entanglement breaking maps. There are many different equivalent criteria for a channel to be entanglement breaking. We note down the following facts about entanglement breaking maps.

###### Theorem 2.2 ([6]).

For a linear map , the following statements are equivalent:

1. is entanglement breaking,

2. has the form , where the are positive matrices with trace 1 in and are all positive semi-definite matrices in .

3. For any completely positive map , the maps and are entanglement breaking, whenever the composition is meaningful.

###### Definition 2.5.

A linear map is said to have finite index of separability if there exists a such that is entanglement breaking.

###### Remark 2.1.

If a linear map is entanglement breaking, then for any other completely positive map , is entanglement breaking by Theorem 2.2. Thus, having a finite index of separability means that, after enough repeated applications, a linear map becomes entanglement breaking and stays entanglement breaking. Notice here that this index of separability for channels has been studied before in [12]. We further analyze this property keeping the PPT-squared conjecture in mind.

## 3 Structure of PPT Maps

In this section we analyze some essential features of PPT maps which eventually help us proving that all PPT maps have finite index of separability.

###### Definition 3.1.

A linear map is called PPT if it is completely positive and co-completely positive, that is, is completely positive where is the transpose map .

Note that in the literature of quantum information theory, the name PPT appears with different meanings [1],[7]. We will consider the above definition as PPT maps. It turns out that the Choi matrix of a PPT map is ‘positive partial transpose’ in the tensor product (see Theorem 7.2.2 in [19]).

To decide whether a channel is entanglement breaking or not amounts to deciding whether the Choi matrix is separable, which is computationally quite a difficult task. Note that since every separable state is positive partial transpose [6], it is clear that the set of entanglement breaking channels is a subset of the PPT channels. However, there are PPT channels that are not entanglement breaking. One more criterion for separability in terms of the multiplicative domain is recorded below.

###### Theorem 3.1 (Størmer, [18]).

Let be a unital channel. Then if is entanglement breaking, then the multiplicative domain is an abelian C- algebra. The converse is also true provided is a conditional expectation, that is, .

Next we extend the results of Størmer’s mentioned in Theorem 3.1. Before that we prove a lemma that will be useful in the subsequent discussion. This result was given in [9] but for the sake of completeness we outline a proof. See also Corollary 3 in [18].

###### Lemma 3.1.

Let be unital completely positive map such that the is contained in an abelian C, then is entanglement breaking.

###### Proof.

Let the (finite dimensional) abelian C-algebra be for some . Hence we can regard for every . Now for each , define the co-ordinate projections , that is, . These are positive linear functionals on . Hence composing with , we get which is a unital positive functional on . Since every such functional is given by for some density matrix , we have . Now choose many positive elements in to associate each coordinate element of to and eventually we get

 E(x)=k∑j=1Tr(xaj)bj, ∀x∈Md,

which is entanglement breaking. ∎

Now we state and prove the main theorem of this section.

###### Theorem 3.2.

Let a unital PPT map. Let be projection and let . Then for every we have

 E(x)=E(pxp)+E(qxq)=E(p)E(x)E(p)+E(q)E(x)E(q).

It follows that is an abelian C-algebra contained in the center of the C-algebra generated by the . If moreover, is faithful, then is abelian.

###### Proof.

If contains no projection then our conclusion follows trivially. So assume there exists a projection . So is a projection (that is ) and for all we have . For any , define

 X=[pt0x0], then X∗=[¯px∗00].

Hence
By 2-positivity of we have by Schwarz inequality

 [E(p)0E(xt)0][E(p)E(¯x)00]≤[E∘t(pt¯p)E∘t(ptx∗)E∘t(x¯p)E∘t(xx∗)]=[E(pp)E(¯xp)E(pxt)E(¯xxt)]

This implies

 [E(p)E(p)E(¯x)E(xt)E(p)E(xt)E(¯x)]≤[E(p)E(¯xp)E(pxt)E(¯xxt)].

This yields

 [0E(¯xp)−E(p)E(¯x)E(pxt)−E(xt)E(p)E(¯xxt)−E(xt)E(¯x)]≥0.

If the entry of a positive is zero, then the entry will be zero. Hence . Since was arbitrary, replacing by , we get

 E(xp)=E(p)E(x).

But we already have from the multiplicative domain property. Hence we obtain for every and any projection ,

 E(x)E(p)=E(p)E(x).

So it follows that for every , we have two projections () such that

 E(x) =E((p+q)x(p+q)) =E(pxp)+E(qxp)+E(pxq)+E(qxp) =E(p)E(x)E(p)+E(q)E(x)E(q).

The other terms vanishes as and the above commutation property. It also shows that is abelian and it is contained in the center of the algebra generated by . Now if is faithful, restricting on we get an isomorphism between and . As is abelian, it follows that is abelian. ∎

We get an immediate useful corollary to the above theorem.

###### Corollary 3.1.

Let be a unital PPT map. If are two orthogonal projections in the multiplicative domain and such that , then .

###### Proof.

If , then from the previous theorem we get . ∎

This result shows that for every PPT map, there is some basis where its action can be restricted to independent blocks on the diagonal.

Next we extend the results of Størmar given in Theorem 3.1 for PPT maps.

###### Theorem 3.3.

If is a unital PPT channel, then is abelian and the converse is also true if is a conditional expectation.

###### Proof.

The first part is essentially Theorem 3.2 as the trace preservation property implies faithfulness.

Conversely, suppose is a channel such that and the multiplicative domain is abelian. Then we have that is contained in . Indeed, for any we have

 E(E(aa∗)−aa∗)=0.

But by the Schwarz inequality of . Now by the trace preservation of , from the above equation we get , which is the equality in the Schwarz inequality and hence . As is contained in an abelian C-algebra, by Lemma 3.1 we get is entanglement breaking. Since an entanglement breaking map is automatically PPT, we have the result.

The composition of PPT maps will have a similar structure, with independent projections, but the projections may not “line up”, and so we need to analyze the composition of PPT maps in more detail.

## 4 Composition of PPT maps and Finite Index of Separability

In this section we prove one of the main results of the paper, that is, every unital PPT map becomes entanglement breaking after a finite number of iterations.

###### Theorem 4.1.

Let be a unital PPT channel and let be the set of minimum mutually orthogonal projections . Then there is some natural number such that

 En=E1⊕⋯⊕Ek

where is a unital PPT channel with trivial multiplicative domain.

###### Proof.

Let be the multiplicative index of defined as in 2.2. Then the multiplicative domain of is just . As , by Theorem 3.2, this domain is an abelian subalgebra of , and thus there is some set of minimum mutually orthogonal projections that span . We can apply Theorem 3.2 repeatedly and get that the action of is

 Eκ(x)= Eκ(p1xp1)+⋯+Eκ(pkxpk) = Eκ(p1)Eκ(p1xp1)Eκ(p1)+⋯+Eκ(pk)Eκ(pkxpk)Eκ(pk). (1)

Since , then is also a projection in . If we take a projection of minimum rank, , then must also be a projection of minimum rank. Since these projections are all accounted for in , then for some permutation . We can repeat this process for every projection of minimum rank, and then for the projections of second-smallest rank, until we construct a permutation such that for all , . Then, for any , we can use Equation 1:

 E2κ(x)= Eκ(pσ(1)Eκ(p1xp1)pσ(1)+⋯+pσ(k)Eκ(pkxpk)pσ(k)) = Eκ(pσ(1))E2κ(p1xp1)Eκ(pσ(1))+⋯+Eκ(pσ(k))E2κ(pkxpk)Eκ(pσ(k)) = pσ2(1)E2κ(p1xp1)pσ2(1)+⋯+pσ2(k)E2κ(pkxpk)pσ2(k).

Then will have some finite order , so repeating the calculations above gives:

 Emκ(x)=p1Emκ(p1xp1)p1+⋯+pkEmκ(pkxpk)pk.

Setting and for , and applying Theorem 3.2 to , which has multiplicative domain equal to , gives the required result. ∎

At this juncture we note down some results that we will use to arrive to the main theorem of the section.

###### Theorem 4.2.

(Gurvits-Barnum, [5]) Let be a normalized density matrix in a bipartite system of total dimension such that , then is separable, where are the identity matrices in and respectively.

Note that is the Choi matrix for the channel given by , for all . Using the Choi-Jamiolkowski identification with matrices in and the linear maps from to , the above theorem ensures that the map has a neighborhood where each quantum channel in the neighborhood is entanglement breaking.

In what follows represents the unit circle in the complex plane. Note that (see [21]) for any quantum channel , all the eigenvalues lie in the closed unit disc of the complex plane. We define the peripheral spectrum () of as follows

 SpecE={λ∈C | (λ.id−E) is \ not \ \ invertible \ on Md},

where is the identity operator on . The set is called the peripheral eigenvalues and any satisfying , with , is called a peripheral eigenvector corresponding . It is a consequence of the Kadison-Schwarz inequality that for a unital channel , if , for some , then . See [16], Corollary 2.2 for more details.

###### Theorem 4.3.

(See [21], Theorem 6.7) Let be a unital channel such that it has trivial peripheral spectrum, that is , then for all .

Channels with trivial peripheral spectrum are known as “primitive” channels. These maps are generic in the sense that they are dense in the set of channels. Following [16], Corollary 3.5, a unital channel is primitive if and only if the stabilized multiplicative domain is trivial, that is, , where is the identity matrix in .

With all the necessary background we are ready to write down the main result of this section:

###### Theorem 4.4.

Every unital PPT channel has finite index of separability.

###### Proof.

Consider the channels in Theorem 4.1. Each channel has trivial multiplicative domain, so by [16], its peripheral spectrum is trivial. Thus, we can apply Theorem 4.3 and conclude that . Then there will be some finite such that is close enough to that their Choi matrices are within a distance of . By Theorem 4.2, this means that the Choi matrix of is separable, that is is entanglement breaking. Letting , then

 Enℓ=Eℓ1⊕⋯⊕Eℓk

will be a direct sum of entanglement breaking channels, and thus is entanglement breaking. ∎

## 5 Beyond PPT maps

PPT maps turn out to be a special case of channels with finite index of separability. This turns out to be, topologically, an abundant class of channels. We need the following result:

###### Theorem 5.1 (see [19], corollary 7.5.5).

Let be a positive map such that , then is entanglement breaking.

###### Theorem 5.2.

The set of unital channels on which have finite index of separability is dense (C.B topology) in the set of unital channels.

###### Proof.

Let be a unital channel. We will show that given , there is a unital channel approximating within in CB norm and has finite index of separability.

To this end, let us define the map , , where . It is easily verified that is a unital channel and

 ∥E−Φ∥cb≤δ2∥(Φ+Ω)∥cb≤δ.

For simplicity call . As , it follows that for every . So

 En=(1−an)(Ω+an1−anΦn)=(1−an)d(Tr(x)1+dan1−anΦn).

As as , it follows that for large and hence is entanglement breaking for large by Theorem 5.1. ∎

### 5.1 Schur Channels

Next we provide some concrete examples of maps which are not PPT, yet they have finite index of separability. We start with a definition of Schur channels. Recall for two matrices and , the Schur product is defined as .

###### Definition 5.1.

Given a matrix , we define a map on . Such maps are called Schur product maps.

It is well known that is completely positive if and only if the matrix . Moreover, if has all its diagonal entries equal to 1, then is a unital channel.

###### Proposition 5.1.

For a Schur Channel on , the following statements are equivalent:

1. is PPT.

2. is entanglement breaking.

3. , the identity element in .

###### Proof.

is well-known. For , a characterization of the multiplicative domain of Schur channels has been put forward in [14]. It is given below

 x=(xi,j)∈MTb⇔xi,j≠0, whenever |bi,j|=1.

Hence it is clear that the multiplicative domain of contains the algebra of diagonal matrices of . Since the matrix units for all and noting that we get by Corollary 3.1. Thus .

To prove , if , then can be written as . Since these are rank-1 operators, is entanglement breaking by one of the equivalent criteria given in [6]. Hence, is also entanglement breaking. ∎

The above proposition suggests that there are no non-trivial Schur channels that are PPT, a fact which was proved in [10] using different method.

###### Example 5.1 (Non- PPT Maps having finite index of Separability).

Let

 b=⎛⎜⎝110110001⎞⎟⎠,u=⎛⎜⎝010001100⎞⎟⎠,

and set , where , for all . Hence is a unital channel. One computes

 ME=⎧⎪⎨⎪⎩⎛⎜⎝a11a120a21a22000a33⎞⎟⎠∣∣ ∣∣aij∈C⎫⎪⎬⎪⎭.

Clearly it is a non-abelian subalgebra of and hence can not be PPT by the Theorem 3.2. But we have that

 E⎛⎜⎝x11x12x13x21x22x23x31x32x33⎞⎟⎠=⎛⎜⎝x33000x11x120x21x22⎞⎟⎠.

which, by Lemma 2.1, gives , the algebra of diagonal matrices. Further, we observe that , that is the range of is contained inside the abelian C-algebra , hence by Lemma 3.1, must be entanglement breaking. Thus, is not PPT, but is entanglement breaking.

We can extend this example to higher dimensions: Set (where is the matrix of all ones), and set to be the permutation corresponding to in the symmetric group on . Then setting , we see that is not PPT, and neither is for , but will be entanglement breaking.

Note that above example suggests that the converse of the PPT conjecture is false, that is, if is channel such that is entanglement breaking, then need not be PPT.

## 6 Asymptotically Entanglement Breaking

In this section we show the existence of maps that don’t have finite index of separability, but asymptotically they are entanglement breaking.

###### Definition 6.1.

We call a linear map ‘asymptotically entanglement breaking’ if there is a sequence such that is entanglement breaking, where the limit is in the bounded weak (BW) topology.

In a very recent article [10], it was shown that PPT maps are asymptotically entanglement breaking. Indeed, they showed that a limit point of iterates of a PPT map becomes entanglement breaking. This could also be deduced from the work of Lami and Giovannetti [13]. In this section we show that there are plenty of channels that are asymptotically entanglement breaking.

###### Theorem 6.1.

Let be a unital channel. Then is asymptotically entanglement breaking map if and only if the stabilized multiplicative domain is abelian.

###### Proof.

Note that Kuperberg in [11] proved that for a unital completely positive map , there is subsequence such that converges to a unique conditional expectation such that is completely positive and also

 Range(P)=Span{a∈Md:E(a)=λa, |λ|=1},

that is, the range is the span of all the peripheral eigen operators of . From the Theorem 2.5 in [16], we get is the algebra generated by the set . Hence by the hypothesis, is contained in an abelian C-algebra. Hence by the Lemma 3.1, we have is entanglement breaking. Thus is asymptotically entanglement breaking.

Conversely, let there exist a subsequence of such that

 limk→∞Emk=Q,

then it follows that the idempotent and commutes for every . It is evident that

 limn∥En−En∘Q∥=0.

Now choosing particularly the subsequence for which we get the conditional expectation onto the subalgebra , we get

 limj∥Enj−Enj∘Q∥=0.

Now passing to any subsequence of the sequence we may conclude that

 limi∥P−Eni∘Q∥=0.

As is entanglement breaking and composing it with any completely positive map yields another entanglement breaking map, it is immediate that is entanglement breaking since the set of entanglement breaking channel is a closed set. Hence by Lemma 3.1 we get is abelian.

###### Remark 6.1.

If any of the limit points of the set are entanglement breaking, then the above proof technique can be used to show that any other limit point of the set will be a limit of entanglement breaking maps, which is again entanglement breaking. This fact was first proved in [13], Proposition 20. Note that Lami-Giovannetti in [13] proved Theorem 24 which is essentially equivalent to Theorem 6.1. Indeed, they prove that a channel is asymptotically entanglement saving if and only if the stabilized multiplicative domain (of ) is non-abelian.

We next demonstrate a large class of maps that have the property mentioned in the above theorem.

###### Definition 6.2.

A positive linear map is called irreducible if holds for a projection and , then , that is, must be a trivial projection.

Irreducible maps are generic in the sense that these maps are dense in the set of all positive linear maps acting on .

###### Corollary 6.1.

Every unital irreducible channel is asymptotically entanglement breaking.

###### Proof.

Note that by the aid of Perron-Frobenius theory of irreducible positive maps, we know that (see [4]) the peripheral eigen operators of an irreducible channel are generated by a single unitary. It is proved in the Lemma 3.4 in [16] that for a unital irreducible channel , we have is an abelian C-algebra. Hence by the Theorem 6.1 we have the result. ∎

We end this section by providing an example of a channel which is asymptotically entanglement breaking but does not have finite index of separability, ensuring that being abelian is not sufficient for to have finite index of separability.

###### Example 6.1.

Let be defined as a Schur product channel , where , with . It follows that the stabilized multiplicative domain , which is clearly abelian. However following Proposition 5.1, it is evident that is not entanglement breaking for any as , where .

###### Remark 6.2.

Note that since the irreducible channels are dense in the set of all quantum channels, Corollary 6.1 ensures that the set of unital channels that are asymptotically entanglement breaking is also a dense subset of the unital channels. This result, combined with Theorem 5.2, demonstrates the richness of the class of eventually entanglement breaking maps.

## 7 Discussion

The requirement of unitality of PPT channels can be relaxed in some cases if some properties of the adjoint map are exploited. Note that our method guarantees the existence of a number for a unital PPT channel on such that s entanglement breaking. However, a uniform bound could not be found. A uniform upper bound for the multiplicative index may provide an upper bound for this number. In a recent article [8], Theorem 3.8, such a bound for multiplicative index of a channel was proposed.

Also analyzing the structure of PPT maps in Section 3, it can be realized that to prove the PPT-squared Conjecture (1.1) it is enough to prove the same for unital and trace preserving PPT maps which have trivial multiplicative domain.

## 8 Acknowledgement

We would like to thank the referee for pointing out a simplified proof of Theorem 5.2. M.R is supported by a Post Doctoral Fellowship of the department of Pure Mathematics, University of Waterloo and Institute of Quantum Computing, S.J is supported by a Graduate Research Fellowship of the department of Combinatorics and Optimization and Institute of Quantum Computing and V.P is supported by NSERC Grant Number 03784.

## References

• [1] K. Audenaert, M. B. Plenio, and J. Eisert, Entanglement Cost under Positive-Partial-Transpose-Preserving Operations, Physical Review Letters 90 (2003), no. 2, 027901.
• [2] S. Bäuml, M. Christandl, K. Horodecki, and A. Winter, Limitations on quantum key repeaters, Nature Communications 6 (2015), 6908.
• [3] Man Duen Choi, A Schwarz inequality for positive linear maps on -algebras, Illinois J. Math. 18 (1974), 565–574. MR 0355615
• [4] David E. Evans and Raphael Høegh-Krohn, Spectral properties of positive maps on -algebras, J. London Math. Soc. (2) 17 (1978), no. 2, 345–355. MR 0482240
• [5] Leonid Gurvits and Howard Barnum, Largest separable balls around the maximally mixed bipartite quantum state, Phys. Rev. A 66 (2002), 062311.
• [6] Michael Horodecki, Peter W. Shor, and Mary Beth Ruskai, Entanglement breaking channels, Rev. Math. Phys. 15 (2003), no. 6, 629–641. MR 2001114
• [7] P. Horodecki, M. Horodecki, and R. Horodecki, Binding entanglement channels, Journal of Modern Optics 47 (2000), 347–354.
• [8] S. Jaques and M. Rahaman, Spectral Properties of Tensor Products of Channels, ArXiv e-prints (2017).
• [9] Nathaniel Johnston, David W. Kribs, Vern I. Paulsen, and Rajesh Pereira, Minimal and maximal operator spaces and operator systems in entanglement theory, J. Funct. Anal. 260 (2011), no. 8, 2407–2423. MR 2772376
• [10] M. Kennedy, M. Manor, and V.I. Paulsen, Composition of PPT maps, Quantum Information and Computation 18 (2018), no. 5&6, 0472–0480.
• [11] Greg Kuperberg, The capacity of hybrid quantum memory, IEEE Trans. Inform. Theory 49 (2003), no. 6, 1465–1473. MR 1984935
• [12] L. Lami and V. Giovannetti, Entanglement-breaking indices, Journal of Mathematical Physics 56 (2015), no. 9, 092201.
• [13] L. Lami and V. Giovannetti, Entanglement-saving channels, J. Math. Phys. 57 (2016), no. 3, 032201, 34. MR 3466536
• [14] J. Levick, An Uncertainty Principle For Completely Positive Maps, ArXiv e-prints (2016).
• [15] Vern Paulsen, Completely bounded maps and operator algebras, Cambridge Studies in Advanced Mathematics, vol. 78, Cambridge University Press, Cambridge, 2002. MR 1976867
• [16] Mizanur Rahaman, Multiplicative properties of quantum channels, Journal of Physics A: Mathematical and Theoretical 50 (2017), no. 34, 345302.
• [17] Mary Beth Ruskai, Marius Junge, David Kribs, Patrick Hayden, and Andreas Winter, Operator structures in quantum information theory, final report, Banff international Research Station, 2012.
• [18] Erling Størmer, Separable states and positive maps, J. Funct. Anal. 254 (2008), no. 8, 2303–2312. MR 2402111
• [19] Erling Størmer, Positive linear maps of operator algebras, Springer Monographs in Mathematics, Springer, Heidelberg, 2013. MR 3012443
• [20] John Watrous, The theory of quantum information, Cambridge University Press, 2018.
• [21] M. M. Wolf, Quantum channels and operations- guided tour, Online Lecture Notes, 2012.
You are adding the first comment!
How to quickly get a good reply:
• Give credit where it’s due by listing out the positive aspects of a paper before getting into which changes should be made.
• Be specific in your critique, and provide supporting evidence with appropriate references to substantiate general statements.
• Your comment should inspire ideas to flow and help the author improves the paper.

The better we are at sharing our knowledge with each other, the faster we move forward.
The feedback must be of minimum 40 characters and the title a minimum of 5 characters