PPT-squared conjecture: is composing two PPT channels entanglement breaking
26No. 1,695 in all physics · No. 87 in Quantum Information and Foundations
Some noisy channels are so weak at carrying entanglement that their partial transpose stays positive. The conjecture says that applying two such channels in a row always destroys all entanglement.
Status in the literature
Unverified note: it names recent work and was partly written without a live literature search; it awaits a check by an editor.
A 2026 preprint proves that every PPT channel has finite entanglement-breaking index (arXiv:2608.13551); the two-fold statement remains open for $d \ge 4$.
No solutions, ideas or subproblems yet.
See also
Details, signature and history
- Kind
- Well-posed question
- Answer
- Proof
- Posed
- 2012
- Topic review
- R. Horodecki, P. Horodecki, M. Horodecki and K. Horodecki, Quantum entanglement, Reviews of Modern Physics, 2009. Link
- Record
- Revision 1 · imported from the seed collection · compiled by AI, not yet reviewed by an editor
Proof
- Fingerprint
- abeef5db0c35…
- Public log
- Entry 2,036, in checkpoint 2,123
- In the log by
- Block 969,698, 2026-10-03
This text was in the PubPhys log by that date. The date says nothing about when the problem was first posed.
Comments (0)
Comments are not records: they are not signed, stamped or logged. How comments work
No comments yet.
Sign in to comment.