Every positive-partial-transpose channel is claimed to become entanglement-breaking after finitely many iterations, but the paper's additional uniform bound of 3 for a large family is false as stated.
Positive-partial-transpose square conjecture for n= 3
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
quant-ph 1years
2026 1verdicts
REJECT 1representative citing papers
citing papers explorer
-
Every PPT channel has finite entanglement-breaking index
Every positive-partial-transpose channel is claimed to become entanglement-breaking after finitely many iterations, but the paper's additional uniform bound of 3 for a large family is false as stated.