Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:2608.13551

Every PPT channel has finite entanglement breaking index

Sang-Jun Park

quant-phmath-phmath.OASubmitted Aug 13, 2026• Announced Aug 14, 2026• 6 citations• Revised Aug 17, 2026 (v2)
v1 · Aug 13, 2026v2 · Aug 17, 2026
arXivHTMLPDF

Abstract

We prove that every PPT linear map has finite entanglement breaking index, thereby establishing the eventual entanglement breaking property of PPT channels in full generality. Furthermore, by utilizing completely positive maps with low entanglement dimensionality, we show that a large family of PPT maps, which strictly contains the class of 2-superpositive maps, has entanglement breaking index bounded above by 3, uniformly in the dimension. In particular, these results provide evidence that the PPT-cubed conjecture may hold in full generality.

Comments
19 pages

Related papers

Eventually entanglement breaking maps

Mizanur Rahaman, Samuel Jaques, Vern I. Paulsen

We analyze linear maps on matrix algebras that become entanglement breaking after composing a finite or infinite number of times with themselves. This means that the Choi matrix of the iterated linear map becomes separable in the tensor product space. If a linear map becomes entanglement breaking after finitely many iterations, we say that the map has a finite index of separability. In particular, we show that every unital positive partial transpose (PPT) channel has a finite index of separability and that the class of unital channels that have a finite index of separability is a dense subset of the unital channels. We construct concrete examples of maps which are not PPT but have a finite index of separability. We prove that there is a large class of unital channels that are asymptotically entanglement breaking. Our work is motivated by Christandl’s PPT-squared conjecture. This conjecture states that every PPT channel, when composed with itself, becomes entanglement breaking.

arXiv:1801.05542•Journal of Mathematical Physics•Jun 1, 2018•37 citations

An Exact Entanglement-Breaking Index for the Explicit 21-Dimensional PPT-Square Counterexample

Kias Henry

We establish that the explicit trace-preserving 21-dimensional PPT channel constructed in OpenAI's September 2026 Entanglement with zero distillable secret key in local dimension ten has entanglement-breaking index exactly three. The original paper proves that its square is not entanglement breaking; we give an exact finite certificate that its cube is entanglement breaking. The certificate proves the reverse-order constituent composition is entanglement breaking, using rational invertible local filters, strict diagonal dominance, partial-transpose invariance, and an exact nonnegative decomposition into 666 real product projectors. A self-contained integer-only Python verifier and the LaTeX source are included as a supplementary ZIP. This result determines the index of one specific channel; it does not resolve the universal PPT-cubed conjecture. The work is a preprint and has not been independently peer reviewed. The structured Related works identify the original construction, Park's eventual entanglement-breaking theorem, and an earlier qubit-intermediate PPT composition result by Henry.

•Nov 6, 2026•0 citations

Entanglement Breaking of All-Partition Compositions of a PPT Edge-State Channel Family

Kias Henry

We exhibit an all-dimensional family of entanglement-breaking compositions built from distinct non-entanglement-breaking PPT edge-state channels of Sacchi type. For arbitrary subsets defining the two partitions, arbitrary positive family parameters, and any positive diagonal intermediate filter, the resulting Choi operator admits an explicit separable decomposition. A complete-positive matrix factorization handles the doubled-coherence blocks, leading to a pairwise entanglement-breaking class of normalized CPTP PPT channels. This is a theorem about a specific family with a common distinguished basis index, not a proof of the unrestricted PPT-cubed conjecture or a classification of general PPT compositions. Exact-rational and independent channel-level checks are included. Historical priority and external peer review remain open.

•Nov 5, 2026•0 citations

Composition of PPT maps

Mathew Kennedy, Nicholas Manor, Vern I. Paulsen

M. Christandl conjectured that the composition of any trace preserving PPT map with itself is entanglement breaking. We prove that Christandl's conjecture holds asymptotically by showing that the distance between the iterates of any unital or trace preserving PPT map and the set of entanglement breaking maps tends to zero. Finally, for every graph we define a one-parameter family of maps on matrices and determine the least value of the parameter such that the map is variously, positive, completely positive, PPT and entanglement breaking in terms of properties of the graph. Our estimates are sharp enough to conclude that Christandl's conjecture holds for these families.

arXiv:1710.08475•Quantum Information and Computation•May 1, 2018•19 citations

PPT Composition Through a Qubit Is Entanglement Breaking

Kias Henry

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.

•Aug 10, 2026•2 citations

Eventually Entanglement Breaking Markovian Dynamics: Structure and Characteristic Times

Eric P. Hanson, Cambyse Rouzé, Daniel Stilck França

Abstract We investigate entanglement breaking times of Markovian evolutions in discrete and continuous time. In continuous time, we characterize which Markovian evolutions are eventually entanglement breaking, that is, evolutions for which there is a finite time after which any entanglement initially present has been destroyed by the noisy evolution. In the discrete-time framework, we consider the entanglement breaking index, that is, the number of times a quantum channel has to be composed with itself before it becomes entanglement breaking. The $$\hbox {PPT}^2$$ PPT2 conjecture is that every PPT quantum channel has an entanglement breaking index of at most 2; we prove that every faithful PPT quantum channel has a finite entanglement breaking index, and more generally, any faithful PPT CP map whose Hilbert–Schmidt adjoint is also faithful is eventually entanglement breaking. We also provide a method to obtain concrete bounds on this index for any faithful quantum channel. To obtain these estimates, we use a notion of robustness of separability to obtain bounds on the radius of the largest separable ball around faithful product states. We also extend the framework of Poincaré inequalities for non-primitive semigroups to the discrete setting to quantify the convergence of quantum semigroups in discrete time, which is of independent interest.

arXiv:1902.08173•Annales Henri Poincaré•Mar 11, 2020•25 citations
We prove that every PPT linear map has finite entanglement breaking index, thereby establishing the eventual entanglement breaking property of PPT channels in full generality. Furthermore, by utilizing completely positive maps with low entanglement dimensionality, we show that a large family of PPT maps, which strictly contains the class of 2-superpositive maps, has entanglement breaking index bounded above by 3, uniformly in the dimension. In particular, these results provide evidence that the PPT-cubed conjecture may hold in full generality.
We analyze linear maps on matrix algebras that become entanglement breaking after composing a finite or infinite number of times with themselves. This means that the Choi matrix of the iterated linear map becomes separable in the tensor product space. If a linear map becomes entanglement breaking after finitely many iterations, we say that the map has a finite index of separability. In particular, we show that every unital positive partial transpose (PPT) channel has a finite index of separability and that the class of unital channels that have a finite index of separability is a dense subset of the unital channels. We construct concrete examples of maps which are not PPT but have a finite index of separability. We prove that there is a large class of unital channels that are asymptotically entanglement breaking. Our work is motivated by Christandl’s PPT-squared conjecture. This conjecture states that every PPT channel, when composed with itself, becomes entanglement breaking.
We establish that the explicit trace-preserving 21-dimensional PPT channel constructed in OpenAI's September 2026 Entanglement with zero distillable secret key in local dimension ten has entanglement-breaking index exactly three. The original paper proves that its square is not entanglement breaking; we give an exact finite certificate that its cube is entanglement breaking. The certificate proves the reverse-order constituent composition is entanglement breaking, using rational invertible local filters, strict diagonal dominance, partial-transpose invariance, and an exact nonnegative decomposition into 666 real product projectors. A self-contained integer-only Python verifier and the LaTeX source are included as a supplementary ZIP. This result determines the index of one specific channel; it does not resolve the universal PPT-cubed conjecture. The work is a preprint and has not been independently peer reviewed. The structured Related works identify the original construction, Park's eventual entanglement-breaking theorem, and an earlier qubit-intermediate PPT composition result by Henry.
We exhibit an all-dimensional family of entanglement-breaking compositions built from distinct non-entanglement-breaking PPT edge-state channels of Sacchi type. For arbitrary subsets defining the two partitions, arbitrary positive family parameters, and any positive diagonal intermediate filter, the resulting Choi operator admits an explicit separable decomposition. A complete-positive matrix factorization handles the doubled-coherence blocks, leading to a pairwise entanglement-breaking class of normalized CPTP PPT channels. This is a theorem about a specific family with a common distinguished basis index, not a proof of the unrestricted PPT-cubed conjecture or a classification of general PPT compositions. Exact-rational and independent channel-level checks are included. Historical priority and external peer review remain open.
M. Christandl conjectured that the composition of any trace preserving PPT map with itself is entanglement breaking. We prove that Christandl's conjecture holds asymptotically by showing that the distance between the iterates of any unital or trace preserving PPT map and the set of entanglement breaking maps tends to zero. Finally, for every graph we define a one-parameter family of maps on matrices and determine the least value of the parameter such that the map is variously, positive, completely positive, PPT and entanglement breaking in terms of properties of the graph. Our estimates are sharp enough to conclude that Christandl's conjecture holds for these families.
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.
Abstract We investigate entanglement breaking times of Markovian evolutions in discrete and continuous time. In continuous time, we characterize which Markovian evolutions are eventually entanglement breaking, that is, evolutions for which there is a finite time after which any entanglement initially present has been destroyed by the noisy evolution. In the discrete-time framework, we consider the entanglement breaking index, that is, the number of times a quantum channel has to be composed with itself before it becomes entanglement breaking. The PPT2\hbox {PPT}^2PPT2 PPT2 conjecture is that every PPT quantum channel has an entanglement breaking index of at most 2; we prove that every faithful PPT quantum channel has a finite entanglement breaking index, and more generally, any faithful PPT CP map whose Hilbert–Schmidt adjoint is also faithful is eventually entanglement breaking. We also provide a method to obtain concrete bounds on this index for any faithful quantum channel. To obtain these estimates, we use a notion of robustness of separability to obtain bounds on the radius of the largest separable ball around faithful product states. We also extend the framework of Poincaré inequalities for non-primitive semigroups to the discrete setting to quantify the convergence of quantum semigroups in discrete time, which is of independent interest.