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

Open Families of High-Schmidt-Number PPT Channels with Interior Entanglement-Breaking Triple Compositions

Kias Henry

Published Nov 5, 2026• 0 citations
Publisher

Abstract

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.

DOI
10.5281/zenodo.23955254

Related papers

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

Beyond the Positive Partial Transpose Squared Conjecture: The Qutrit Case

Junhyeong An, Soojoon Lee

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.

quant-pharXiv:2607.15947•Jul 20, 2026•1 citation

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

Toroidal-Core Certificates for PPT-Squared Diagonal Orthogonal Covariant Channels

Samuel Marquez Gonzalez

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.

quant-pharXiv:2609.32979•Sep 29, 2026•0 citations

Exact Schmidt Numbers and PPT Extremality of an Infinite Grid-State Family

Kias Henry

Krebs and Gachechiladze [Phys. Rev. A 113, 062428 (2026)] introduced a family of positive-partial-transpose (PPT) generalized grid states in local dimension d = 2k − 1. They determined the Schmidt number for k ≤ 5 and proposed an all-order scaling pattern. For their particular explicitly specified family, we prove SN(R_k) = k = (d + 1)/2 for every k ≥ 2 using a universal signed-minor identity. We also prove that each R_k generates an extreme ray of the complex Hermitian PPT cone, and obtain exact ranks rank(R_k) = k² + k − 1 and rank(R_k^Γ) = k² + 2k − 3. Local filtering yields extremal trace-preserving PPT channels whose Choi matrices have Schmidt number k and whose partially transposed Choi matrices have Schmidt number two. Their threefold iterates are entanglement breaking by a theorem of Park (2026). The underlying states, their PPT decomposition, and other families with linear Schmidt-number growth were established in earlier work; the results here concern the specific 2026 grid-state family.

•Nov 3, 2026•0 citations

Every PPT channel has finite entanglement breaking index

Sang-Jun Park

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.

quant-pharXiv:2608.13551•Aug 14, 2026•6 citations
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 111-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 111-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 111-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 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Φ_{A,B,C}ΦA,B,C​ and ΦD,E,FΦ_{D,E,F}ΦD,E,F​ on MdM_dMd​, the entrywise bound (AD)ij≥2⌊d⌋AiiAjjDiiDjj(AD)_{ij}\ge 2\lfloor\sqrt{d}\rfloor\sqrt{A_{ii}A_{jj}D_{ii}D_{jj}}(AD)ij​≥2⌊d​⌋Aii​Ajj​Dii​Djj​​ for all i,ji,ji,j guarantees that ΦA,B,C∘ΦD,E,FΦ_{A,B,C}\circΦ_{D,E,F}Φ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≠1a\ne1a=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.
Krebs and Gachechiladze [Phys. Rev. A 113, 062428 (2026)] introduced a family of positive-partial-transpose (PPT) generalized grid states in local dimension d = 2k − 1. They determined the Schmidt number for k ≤ 5 and proposed an all-order scaling pattern. For their particular explicitly specified family, we prove SN(R_k) = k = (d + 1)/2 for every k ≥ 2 using a universal signed-minor identity. We also prove that each R_k generates an extreme ray of the complex Hermitian PPT cone, and obtain exact ranks rank(R_k) = k² + k − 1 and rank(R_k^Γ) = k² + 2k − 3. Local filtering yields extremal trace-preserving PPT channels whose Choi matrices have Schmidt number k and whose partially transposed Choi matrices have Schmidt number two. Their threefold iterates are entanglement breaking by a theorem of Park (2026). The underlying states, their PPT decomposition, and other families with linear Schmidt-number growth were established in earlier work; the results here concern the specific 2026 grid-state family.
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.