The PPT squared conjecture via decomposability of compositions

Let Mdi\mathcal{M}_{d_i} denote the algebra of complex di×did_i\times d_i matrices. Let T:Md1Md2T:\mathcal{M}_{d_1}\rightarrow\mathcal{M}_{d_2} be completely positive and completely copositive, and let P:Md2Md3P:\mathcal{M}_{d_2}\rightarrow\mathcal{M}_{d_3} be positive. A positive map R:Md1Md3R:\mathcal{M}_{d_1}\rightarrow\mathcal{M}_{d_3} is decomposable if there are completely positive maps R1,R2R_1,R_2 such that

R=R1+ϑd3R2,R=R_1+\vartheta_{d_3}\circ R_2,

where ϑd3\vartheta_{d_3} is transposition on Md3\mathcal{M}_{d_3}. PPT squared conjecture. The composition PTP\circ T 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

Never refreshed

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Solutions 0

No solutions have been posted yet.