Proving that composition of PPT maps through qubit systems breaks entanglement, suggesting implications for the PPT-squared conjecture.
We prove that the composition of two PPT maps through an intermediate qubit system is entanglement breaking. Specifically, for arbitrary finite dimensions m and n, if Φ: Mₘ → M₂ and Ψ: M₂ → Mₙ are completely positive and completely copositive, then Ψ ∘ Φ is entanglement breaking. The proof uses the special 2 × 2 block structure imposed by the qubit intermediate system, Schur-complement inequalities, an operator interpolation argument, and an explicit separability decomposition. As a consequence, no counterexample to the PPT-squared conjecture can occur through the 4 → 2 → 4 composition pattern.
No takes yet. Share an insight, caveat, or question.
Kias Henry (2026) studied this question.
Synapse has enriched 5 closely related papers on similar clinical questions. Consider them for comparative context: