Christandl's PPT conjecture for entanglement-breaking compositions
Christandl's PPT conjecture for entanglement-breaking compositions
Let be linear maps. A map is PPT when both and are completely positive, and it is entanglement breaking when for every . PPT conjecture. The composition of two arbitrary PPT linear maps is entanglement breaking. Equivalently, if are the corresponding Choi states and , then
Christandl posed this conjecture in 2012; it asks whether composing two PPT maps always destroys entanglement, and its resolution remains open.
Sources & referencesView supporting material
Primary source
Jonas Britz and Monique Laurent, “Semidefinite hierarchies for diagonal unitary invariant bipartite quantum states”, arXiv:2512.06551 (2026).
Additional references
6 papers in this index state this conjecture (2017–2025). The statement above is taken from the most recent of them; the others are arXiv:2207.02510, arXiv:2002.09614, arXiv:1807.01266, arXiv:1801.05542, arXiv:1710.08475.
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.