The PPT squared conjecture via decomposability of compositions
The PPT squared conjecture via decomposability of compositions
Let denote the algebra of complex matrices. Let be completely positive and completely copositive, and let be positive. A positive map is decomposable if there are completely positive maps such that
where is transposition on . PPT squared conjecture. The composition is decomposable. This is obtained in the paper as an equivalent formulation using duality of cones; the source gives no resolution, so it remains open.
Sources & referencesView supporting material
Primary source
Matthias Christandl, Alexander Müller-Hermes and Michael M. Wolf, “When Do Composed Maps Become Entanglement Breaking?”, arXiv:1807.01266 (2019).
Progress summary
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
Sign in to submit a solution.
No solutions have been posted yet.