When Do Composed Maps Become Entanglement Breaking?
For many completely positive maps repeated compositions will eventually become entanglement breaking. To quantify this behaviour we develop a technique based on the Schmidt number: If a completely positive map breaks the entanglement with respect to any qubit ancilla, then applying it to part of a bipartite quantum state will result in a Schmidt number bounded away from the maximum possible value. Iterating this result puts a successively decreasing upper bound on the Schmidt number arising in this way from compositions of such a map. By applying this technique to completely positive maps in dimension three that are also completely copositive we prove the so-called PPT squared conjecture in this dimension. We then give more examples of completely positive maps where our technique can be applied, e.g. maps close to the completely depolarizing map, and maps of low rank. Finally, we study the PPT squared conjecture in more detail, establishing equivalent conjectures related to other parts of quantum information theory, and we prove the conjecture for Gaussian quantum channels.
Unable to display preview. Download preview PDF.
We thank Daniel Cariello for pointing out how his results [26, 27] together with the techniques from  imply Corollary 3.5. We also thank Ion Nechita for pointing out the different version of Theorem A.1. MC and AMH acknowledge financial support from the European Research Council (ERC Grant Agreement no 337603) and VILLUM FONDEN via the QMATH Centre of Excellence (Grant No. 10059). MW acknowledges the hospitality of the QMATH Centre.
- 8.Christandl, M.: PPT square conjecture. In: Banff International Research Station Workshop: Operator Structures in Quantum Information Theory (2012)Google Scholar
- 9.Bäuml, S., Christandl, M., Horodecki, K., Winter, A.: Limitations on quantum key repeaters. Nat. Commun. 6, 6908 (2015)Google Scholar
- 33.Størmer, E.: Duality of cones of positive maps. Preprint arXiv:0810.4253 (2008)