When Do Composed Maps Become Entanglement Breaking?

Publikation: Bidrag til tidsskrift › Tidsskriftartikel › Forskning › fagfællebedømt

Standard

When Do Composed Maps Become Entanglement Breaking? / Christandl, Matthias; Müller-Hermes, Alexander; Wolf, Michael M.

I: Annales Henri Poincare, Bind 20, Nr. 7, 2019, s. 2295-2322.

Publikation: Bidrag til tidsskrift › Tidsskriftartikel › Forskning › fagfællebedømt

Harvard

Christandl, M, Müller-Hermes, A & Wolf, MM 2019, 'When Do Composed Maps Become Entanglement Breaking?', Annales Henri Poincare, bind 20, nr. 7, s. 2295-2322. https://doi.org/10.1007/s00023-019-00774-7

APA

Christandl, M., Müller-Hermes, A., & Wolf, M. M. (2019). When Do Composed Maps Become Entanglement Breaking? Annales Henri Poincare, 20(7), 2295-2322. https://doi.org/10.1007/s00023-019-00774-7

Vancouver

Christandl M, Müller-Hermes A, Wolf MM. When Do Composed Maps Become Entanglement Breaking? Annales Henri Poincare. 2019;20(7):2295-2322. https://doi.org/10.1007/s00023-019-00774-7

Author

Christandl, Matthias ; Müller-Hermes, Alexander ; Wolf, Michael M. / When Do Composed Maps Become Entanglement Breaking?. I: Annales Henri Poincare. 2019 ; Bind 20, Nr. 7. s. 2295-2322.

Bibtex

@article{ab21a2783deb4125b957f8bab2ebf664,
title = "When Do Composed Maps Become Entanglement Breaking?",
abstract = "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.",
author = "Matthias Christandl and Alexander M{\"u}ller-Hermes and Wolf, {Michael M.}",
year = "2019",
doi = "10.1007/s00023-019-00774-7",
language = "English",
volume = "20",
pages = "2295--2322",
journal = "Annales Henri Poincare",
issn = "1424-0637",
publisher = "Springer Basel AG",
number = "7",

}

RIS

TY - JOUR

T1 - When Do Composed Maps Become Entanglement Breaking?

AU - Christandl, Matthias

AU - Müller-Hermes, Alexander

AU - Wolf, Michael M.

PY - 2019

Y1 - 2019

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=85061649183&partnerID=8YFLogxK

U2 - 10.1007/s00023-019-00774-7

DO - 10.1007/s00023-019-00774-7

M3 - Journal article

AN - SCOPUS:85061649183

VL - 20

SP - 2295

EP - 2322

JO - Annales Henri Poincare

JF - Annales Henri Poincare

SN - 1424-0637

IS - 7

ER -

ID: 214128555