← All problems

The PPT squared conjecture

8 years old · traced to

Let Md\mathcal{M}_d denote the algebra of complex d×dd\times d matrices, and let T:Md→MdT:\mathcal{M}_d\rightarrow\mathcal{M}_d be a linear map. A map is completely positive if all its ampliations are positive, and completely copositive if its composition with transposition is completely positive. A map is entanglement breaking if it sends every bipartite positive matrix to a separable matrix. PPT squared conjecture. If TT is completely positive and completely copositive, then

T∘TT\circ T

is entanglement breaking. This conjecture asks whether applying a PPT map twice always destroys entanglement; it remains open, with partial progress known for asymptotic versions and additional hypotheses.

Equivalent formulations
  1. A linear map is PPT when it is completely positive and its Choi matrix is PPT; a map is entanglement breaking when its Choi matrix is separable. Let L1\mathcal{L}_1 and L2\mathcal{L}_2 be completely positive linear maps.

    PPT squared conjecture. If the Choi matrices of L1\mathcal{L}_1 and L2\mathcal{L}_2 are PPT, then the Choi matrix of

    L1∘L2\mathcal{L}_1\circ\mathcal{L}_2

    is separable; equivalently, the composition of any two PPT linear maps is entanglement breaking. The conjecture is resolved in dimensions d=2d=2 and d=3d=3, while it remains open in general and has been proved in various restricted settings.

    source: Sang-Jun Park, “k-Positivity and high-dimensional bound entanglement under symplectic group symmetries”, arXiv:2602.09860 (2026).

References

2 papers in this index state this conjecture (2018). The statement above is taken from the most recent of them; the others are arXiv:1805.11570.

Source: Matthias Christandl, Alexander Müller-Hermes and Michael M. Wolf, “When Do Composed Maps Become Entanglement Breaking?”, arXiv:1807.01266 (2019).

Progress summary

Refreshed
Open

The conjecture is proved in low dimensions and special families, but the general higher-dimensional question remains open, with no public proof or counterexample.

Matthias Christandl proposed the conjecture in 2012: squaring every completely positive and completely copositive map should produce an entanglement-breaking map.

Known results

  • The conjecture holds for d=2d=2 and d=3d=3, including compositions with intermediate dimension 33.
  • Kennedy-Manor-Paulsen proved asymptotic entanglement breaking for unital or trace-preserving PPT maps.
  • Rahaman-Jaques-Paulsen proved that every unital PPT channel becomes entanglement breaking after finitely many iterations.
  • It holds for Choi-type maps, Gaussian channels, and several further structured families.

July 2026 qutrit update

A July 2026 preprint proves a related composition result for a completely positive map with 11-undistillable Choi matrix and another with Schmidt number at most 22. It strengthens the qutrit picture but does not resolve dimensions d>3d>3; no general proof or counterexample is reported.

Current status (as of August 2026): The conjecture is settled for d≤3d\leq 3 and several restricted classes, while the general case for d>3d>3 remains open.

Sources

Solutions 0

No solutions have been posted yet.