Problems / quantum-information-computing
quantum-information-computing / Quantum channels: PPT maps and entanglement breaking
The PPT-squared conjecture: is the composition of two PPT channels always entanglement breaking?
Theorem 1.3: there is an explicit trace-preserving PPT channel Θ on M21(C) with Θ∘Θ not entanglement breaking, answering the 2012 channel question negatively with the same channel in both slots. Theorem 1.2: explicit PPT maps Φ1,Φ2 on M10(C) (not trace preserving) whose composition has nonzero Choi matrix with no product vector in its range, refuting the unrestricted two-map Conjecture IV.1. The same pair yields the zero-key entangled state of the companion entry. Not shown: minimal dimensions, or whether every PPT channel becomes entanglement breaking after three compositions (the PPT-cubed question).