Papers
Topics
Authors
Recent
Search
2000 character limit reached

Eventually Entanglement Breaking Maps

Published 17 Jan 2018 in quant-ph, math.FA, and math.OA | (1801.05542v2)

Abstract: We analyze certain class of 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 is entanglement breaking after finite iterations, we say the map has a finite index of separability. In particular we show that every unital PPT-channel becomes entanglement breaking after a finite number of iterations. It turns out 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.

Summary

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.