The PPT squared conjecture via tensor products of PPT maps
The PPT squared conjecture via tensor products of PPT maps
Let denote the algebra of complex matrices. Let
be linear maps, each completely positive and completely copositive. For a positive matrix , write for its image. A matrix is separable if it is a sum of positive product matrices. PPT squared conjecture. The matrix is separable for every positive matrix . This is another reformulation of the PPT squared conjecture, connected to locally entanglement-annihilating maps; the source supplies no resolution, so the claim 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.