The positive-partial-transpose-squared (PPT-squared) conjecture asks whether the composition of two positive-partial-transpose (PPT) quantum channels must be entanglement breaking (EB). The problem remains open in general and, within the diagonal orthogonal covariant (DOC) class, the first unresolved deterministic dimension is four. A sufficient condition for PPT-squared composition is derived for DOC maps in arbitrary finite dimension. The proof isolates the quantum coherence data into two correlation matrices, mixes each with the identity until it lies in the convex hull of rank-one correlation matrices, and converts the resulting objects into an explicit triplewise completely positive (TCP) core. The remaining contribution is purely classical and is TCP whenever a simple entrywise mixing inequality is satisfied. For PPT DOC maps $Φ_{A,B,C}$ and $Φ_{D,E,F}$ on $M_d$, the entrywise bound $(AD)_{ij}\ge 2\lfloor\sqrt{d}\rfloor\sqrt{A_{ii}A_{jj}D_{ii}D_{jj}}$ for all $i,j$ guarantees that $Φ_{A,B,C}\circΦ_{D,E,F}$ is EB. In dimension four the universal coefficient becomes four. A continuous family of bistochastic PPT channels is then constructed; every member with $a\ne1$ is not EB, while every pairwise composition within the family is proved to be EB. A rank-sensitive refinement shows explicitly how low coherence rank can improve the universal coefficient. The resulting certificate is sufficient rather than necessary and is complementary to factor-width and semidefinite-hierarchy approaches.
AI Summary
The paper studies the PPT-squared conjecture—whether composing two PPT quantum channels always gives an entanglement-breaking (EB) channel—within the diagonal orthogonal covariant (DOC) class. It derives a deterministic sufficient condition in arbitrary finite dimension, without resolving the general conjecture or the first unresolved DOC dimension, $d=4$.
For PPT DOC maps $\Phi_{A,B,C}$ and $\Phi_{D,E,F}$ on $M_d$, the composition is EB whenever $(AD)_{ij}\ge 2\lfloor\sqrt d\rfloor\sqrt{A_{ii}A_{jj}D_{ii}D_{jj}}$ for every $i,j$. Here $A,D$ describe population transfer; the final condition is independent of the coherence matrices $B,C,E,F$. The coefficient is four in dimension four. A refinement replaces $\lfloor\sqrt d\rfloor$ by $\kappa=\min\{\lfloor\sqrt d\rfloor,\max(\operatorname{rank}R,\operatorname{rank}S)\}$, where $R,S$ are normalized correlation matrices constructed from the composed coherence sectors.
The proof mixes these correlation matrices with the identity until they become convex combinations of rank-one phase correlation matrices. Their decompositions generate a triplewise completely positive core reproducing the composed coherences. The entrywise inequality makes the residual nonnegative, yielding an explicit EB certificate.
An application constructs a continuous family of four-dimensional bistochastic PPT channels, parametrized by $a>0$ and an arbitrary correlation matrix. Every member with $a\ne1$ is non-EB, but every pairwise composition is EB. The certificate is sufficient, not necessary; its coefficient is not claimed optimal, and no general dominance over existing factor-width or semidefinite-hierarchy approaches is established.
Some signs of AI-generated textStrong assumptionsMissing comparison
Written by gpt-6.1-sol from the paper's full text. Automated: it can be wrong.
The positive-partial-transpose-squared (PPT-squared) conjecture asks whether the composition of two positive-partial-transpose (PPT) quantum channels must be entanglement breaking (EB). The problem remains open in general and, within the diagonal orthogonal covariant (DOC) class, the first unresolved deterministic dimension is four. A sufficient condition for PPT-squared composition is derived for DOC maps in arbitrary finite dimension. The proof isolates the quantum coherence data into two correlation matrices, mixes each with the identity until it lies in the convex hull of rank-one correlation matrices, and converts the resulting objects into an explicit triplewise completely positive (TCP) core. The remaining contribution is purely classical and is TCP whenever a simple entrywise mixing inequality is satisfied. For PPT DOC maps ΦA,B,C and ΦD,E,F on Md, the entrywise bound (AD)ij≥2⌊d⌋AiiAjjDiiDjj for all i,j guarantees that ΦA,B,C∘ΦD,E,F is EB. In dimension four the universal coefficient becomes four. A continuous family of bistochastic PPT channels is then constructed; every member with a=1 is not EB, while every pairwise composition within the family is proved to be EB. A rank-sensitive refinement shows explicitly how low coherence rank can improve the universal coefficient. The resulting certificate is sufficient rather than necessary and is complementary to factor-width and semidefinite-hierarchy approaches.
The paper studies the PPT-squared conjecture—whether composing two PPT quantum channels always gives an entanglement-breaking (EB) channel—within the diagonal orthogonal covariant (DOC) class. It derives a deterministic sufficient condition in arbitrary finite dimension, without resolving the general conjecture or the first unresolved DOC dimension, d=4.
For PPT DOC maps ΦA,B,C and ΦD,E,F on Md, the composition is EB whenever (AD)ij≥2⌊d⌋AiiAjjDiiDjj for every i,j. Here A,D describe population transfer; the final condition is independent of the coherence matrices B,C,E,F. The coefficient is four in dimension four. A refinement replaces ⌊d⌋ by κ=min{⌊d⌋,max(rankR,rankS)}, where R,S are normalized correlation matrices constructed from the composed coherence sectors.
The proof mixes these correlation matrices with the identity until they become convex combinations of rank-one phase correlation matrices. Their decompositions generate a triplewise completely positive core reproducing the composed coherences. The entrywise inequality makes the residual nonnegative, yielding an explicit EB certificate.
An application constructs a continuous family of four-dimensional bistochastic PPT channels, parametrized by a>0 and an arbitrary correlation matrix. Every member with a=1 is non-EB, but every pairwise composition is EB. The certificate is sufficient, not necessary; its coefficient is not claimed optimal, and no general dominance over existing factor-width or semidefinite-hierarchy approaches is established.
We construct, in every local dimension d≥6, nonempty open families of triples of CPTP channels whose Choi matrices and partial transposes are strictly positive, each with Schmidt number at least d−floor(sqrt(2d−1)) and individually non-entanglement-breaking, but whose triple compositions lie in the interior of the entanglement-breaking cone. The proof combines Johnston–Lovitz high-Schmidt-number PPT states with an explicit separable-order sandwich lemma. We also give a conservative exact rational interval for robustness of a fixed 10→6→10 PPT-channel pair, with independently auditable integer Kraus matrices and numerical checks. This is an existence and sufficient-condition result, not a solution of the general PPT-cubed conjecture or a universal triple-composition theorem. Historical priority and expert peer review remain pending.
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.
Entanglement swapping is a fundamental operation in quantum repeaters for establishing entanglement between distant parties. The positive partial transpose (PPT) squared conjecture asks whether two PPT entangled links can generate terminal entanglement through entanglement swapping, or equivalently, whether the composition of two PPT maps is always entanglement breaking. Motivated by this conjecture, we investigate the map-composition problem beyond the PPT setting. For qutrit completely positive (CP) maps, we prove that the composition of any CP map whose Choi matrix is 1-undistillable with any CP map whose Choi matrix has Schmidt number at most two is entanglement breaking in either order. Moreover, we show that the cone of 1-undistillable CP maps is exactly the largest qutrit cone of CP maps whose composition with every CP map whose Choi matrix has Schmidt number at most two is entanglement breaking in both orders. Finally, although map composition captures only the standard maximally entangled outcome in entanglement swapping, we prove that any 1-undistillable two-qutrit state and any state of Schmidt number at most two cannot generate terminal entanglement under an arbitrary selective measurement on the intermediate systems.
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.
The PPT² conjecture asserts that the composition of two completely positive and completely copositive (PPT) maps is entanglement breaking. A recent counterexample uses two maps through a six-dimensional middle algebra between ten-dimensional outer algebras, and certifies entanglement by the range criterion: the range of the composite Choi matrix contains no product vector. We ask how small such a certificate can be. For PPT maps Φ: Mₘ → Mₖ and Ψ: Mₖ → Mₙ with Ψ ∘ Φ ≠ 0 we prove, with computer-assisted steps, that the range of the Choi matrix of Ψ ∘ Φ contains a product vector whenever max(m, k, n) ≤ 6 and either k ≤ 5 or an outer dimension is at most five. If both outer dimensions are four, this holds for every middle dimension k. In dimension six only the reduced type (6, 6, 6) remains, and we bound its Choi ranks. The proofs use that, after a reduction, a product-free composite range forbids Kraus operators of rank at most two, that the rank-loss loci of a PPT map are finite unions of linear subspaces with generically constant range on each subspace, a rank inequality for PPT maps at product vectors in the kernel of their Choi matrices, top Chern classes at middle dimensions four and five, an excess intersection on Gr(3, 6) at middle dimension six, and, for the type (5, 6, 5), the Euler characteristic of a sheaf on a multiple line in ℙ². For the known example we show that the quadratic Veronese images of the rank-loss directions of its base map and of their kernel vectors are Gale dual by the Cayley–Bacharach theorem, and that the kernel conditions determine the Kraus spaces of both factors. If the rank-loss scheme of the base map is reduced and of the expected dimension zero, then among the lifts through arbitrary Schur functors with nonzero composite only those through exterior powers give an unextendible product set of kernel product vectors, and these only when one of the three dimensions is at least ten. For a general base map, the member of the family with outer dimension six is one product vector short of the range criterion, and its factors are rigid. For such base maps on M₄ that are not entanglement breaking, a compression of the lift to outer dimensions 4 ≤ D ≤ 9 keeps at most 2D − 4 of the twenty kernel product vectors. Finally, symmetry under a compact connected group acting irreducibly on both outer spaces, or under SU(2) acting without multiplicities on one of them, puts a product vector into the range. Mathematics Subject Classification (2020): 81P40; 15A69, 14M15, 14C17, 47L07.
The PPT² conjecture asserts that the composition of two completely positive and completely copositive (PPT) maps is entanglement breaking. A recent counterexample uses two maps through a six-dimensional middle algebra between ten-dimensional outer algebras, and certifies entanglement by the range criterion: the range of the composite Choi matrix contains no product vector. We ask how small such a certificate can be. For PPT maps Φ: Mₘ → Mₖ and Ψ: Mₖ → Mₙ with Ψ ∘ Φ ≠ 0 we prove, with computer-assisted steps, that the range of the Choi matrix of Ψ ∘ Φ contains a product vector whenever max(m, k, n) ≤ 6 and either k ≤ 5 or an outer dimension is at most five. If both outer dimensions are four, this holds for every middle dimension k. In dimension six only the reduced type (6, 6, 6) remains, and we bound its Choi ranks. The proofs use that, after a reduction, a product-free composite range forbids Kraus operators of rank at most two, that the rank-loss loci of a PPT map are finite unions of linear subspaces with generically constant range on each subspace, a rank inequality for PPT maps at product vectors in the kernel of their Choi matrices, top Chern classes at middle dimensions four and five, an excess intersection on Gr(3, 6) at middle dimension six, and, for the type (5, 6, 5), the Euler characteristic of a sheaf on a multiple line in ℙ². For the known example we show that the quadratic Veronese images of the rank-loss directions of its base map and of their kernel vectors are Gale dual by the Cayley–Bacharach theorem, and that the kernel conditions determine the Kraus spaces of both factors. If the rank-loss scheme of the base map is reduced and of the expected dimension zero, then among the lifts through arbitrary Schur functors with nonzero composite only those through exterior powers give an unextendible product set of kernel product vectors, and these only when one of the three dimensions is at least ten. For a general base map, the member of the family with outer dimension six is one product vector short of the range criterion, and its factors are rigid. For such base maps on M₄ that are not entanglement breaking, a compression of the lift to outer dimensions 4 ≤ D ≤ 9 keeps at most 2D − 4 of the twenty kernel product vectors. Finally, symmetry under a compact connected group acting irreducibly on both outer spaces, or under SU(2) acting without multiplicities on one of them, puts a product vector into the range. Version 3 adds a description of a Lean formalization that derives the main theorem from nine stated algebro-geometric hypotheses (code: doi:10.5281/zenodo.23643757); the mathematics is otherwise the same as in version 2. Mathematics Subject Classification (2020): 81P40; 15A69, 14M15, 14C17, 47L07.