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:2108.01588

On PPT Square Conjecture

W. A. Majewski

Published Aug 3, 2021• 0 citations
arXivHTMLPDF

Abstract

An analysis of the PPT square conjecture based on the characteristics of positive mappings given in [9] will be carried out. First, a general strategy for analyzing the PPT conjecture will be presented. Then, a detailed analysis of the certain tensor cones and their corresponding classes of mappings will be given. Special emphasis will be put on key mappings used in quantum information.

DOI
10.48550/arxiv.2108.01588

Related papers

Investigation of the PPT Squared Conjecture for High Dimensions

Jin, Ryan

We present the positive-partial-transpose squared conjecture introduced by M. Christandl at Banff International Research Station Workshop: Operator Structures in Quantum Information Theory (Banff International Research Station, Alberta, 2012). We investigate the conjecture in higher dimensions and offer two novel approaches (decomposition and composition of quantum channels) and correspondingly, several schemes for finding counterexamples to this conjecture. One of the schemes involving the composition of PPT quantum channels in unsolved dimensions yields a potential counterexample.

arXiv:2010.15554•Oct 27, 2020•1 citation

Mapping cones of positive maps

Erling Størmer

We study mapping cones of positive maps of $B(H)$ into itself, i.e., cones which are closed under composition with completely positive maps. As applications we obtain characterizations of linear functionals with strong positivity properties with respect to so-called symmetric mapping cones, with special emphasis on separable and PPT states.

MATHEMATICA SCANDINAVICA•Jun 1, 2011•13 citations

$k$-Positivity and high-dimensional bound entanglement under symplectic group symmetries

Sang-Jun Park

We investigate the structure of $k$-positivity and Schmidt numbers for classes of linear maps and bipartite quantum states exhibiting symplectic group symmetries. Specifically, we consider (1) linear maps on $M_d(\mathbb{C})$ which are covariant under conjugation by unitary symplectic matrices $S$, and (2) $d\otimes d$ bipartite states which are invariant under $S\otimes S$ or $S\otimes \overline{S}$ actions, each parametrized by two real variables. We provide a complete characterization of all $k$-positivity and decomposability conditions for these maps and explicitly compute the Schmidt numbers for the corresponding bipartite states. In particular, our analysis yields a broad class of PPT states with Schmidt number $d/2$ and the first explicit constructions of (optimal) $k$-positive indecomposable linear maps for arbitrary $k=1,\ldots, d/2-1$, achieving the best-known bounds. Overall, our results offer a natural and analytically tractable framework in which both strong forms of positive indecomposability and high degrees of PPT entanglement can be studied systematically. We present two further applications of symplectic group symmetries. First, we show that the PPT-squared conjecture holds within the class of PPT linear maps that are either symplectic-covariant or conjugate-symplectic-covariant. Second, we resolve a conjecture of Pal and Vertesi concerning the optimal lower bound of the Sindici-Piani semidefinite program for PPT entanglement.

quant-pharXiv:2602.09860•Feb 11, 2026•0 citations

Positive-partial-transpose square conjecture for n=3

Lin Chen, Yang Yu, Wai-Shing Tang

We present the positive-partial-transpose (PPT) square conjecture introduced by M. Christandl Banff International Research Station Workshop: Operator Structures in Quantum Information Theory (Banff International Research Station, Alberta, 2012). We prove the conjecture in the case $n=3$ as a consequence of the fact that two-qutrit PPT states have Schmidt number of at most 2. The PPT square conjecture in the case of $n\ensuremath{\ge}4$ is still open. We present an example to support the conjecture for $n=4$.

arXiv:1807.03636•Physical Review A•Jan 22, 2019•20 citations

Programski pristop k domnevi PPT2

Noah Novšak

The PPT2 conjecture asserts that the composition of any two PPT maps is entanglement breaking. It is proven for maps on matrices of size up to $3 times 3$ and for several structured families, but the general case remains open

•Jul 10, 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•0 citations
An analysis of the PPT square conjecture based on the characteristics of positive mappings given in [9] will be carried out. First, a general strategy for analyzing the PPT conjecture will be presented. Then, a detailed analysis of the certain tensor cones and their corresponding classes of mappings will be given. Special emphasis will be put on key mappings used in quantum information.
We present the positive-partial-transpose squared conjecture introduced by M. Christandl at Banff International Research Station Workshop: Operator Structures in Quantum Information Theory (Banff International Research Station, Alberta, 2012). We investigate the conjecture in higher dimensions and offer two novel approaches (decomposition and composition of quantum channels) and correspondingly, several schemes for finding counterexamples to this conjecture. One of the schemes involving the composition of PPT quantum channels in unsolved dimensions yields a potential counterexample.
We study mapping cones of positive maps of B(H)B(H)B(H) into itself, i.e., cones which are closed under composition with completely positive maps. As applications we obtain characterizations of linear functionals with strong positivity properties with respect to so-called symmetric mapping cones, with special emphasis on separable and PPT states.
kkk-Positivity and high-dimensional bound entanglement under symplectic group symmetries
We investigate the structure of kkk-positivity and Schmidt numbers for classes of linear maps and bipartite quantum states exhibiting symplectic group symmetries. Specifically, we consider (1) linear maps on Md(C)M_d(\mathbb{C})Md​(C) which are covariant under conjugation by unitary symplectic matrices SSS, and (2) d⊗dd\otimes dd⊗d bipartite states which are invariant under S⊗SS\otimes SS⊗S or S⊗S‾S\otimes \overline{S}S⊗S actions, each parametrized by two real variables. We provide a complete characterization of all kkk-positivity and decomposability conditions for these maps and explicitly compute the Schmidt numbers for the corresponding bipartite states. In particular, our analysis yields a broad class of PPT states with Schmidt number d/2d/2d/2 and the first explicit constructions of (optimal) kkk-positive indecomposable linear maps for arbitrary k=1,…,d/2−1k=1,\ldots, d/2-1k=1,…,d/2−1, achieving the best-known bounds. Overall, our results offer a natural and analytically tractable framework in which both strong forms of positive indecomposability and high degrees of PPT entanglement can be studied systematically. We present two further applications of symplectic group symmetries. First, we show that the PPT-squared conjecture holds within the class of PPT linear maps that are either symplectic-covariant or conjugate-symplectic-covariant. Second, we resolve a conjecture of Pal and Vertesi concerning the optimal lower bound of the Sindici-Piani semidefinite program for PPT entanglement.
We present the positive-partial-transpose (PPT) square conjecture introduced by M. Christandl Banff International Research Station Workshop: Operator Structures in Quantum Information Theory (Banff International Research Station, Alberta, 2012). We prove the conjecture in the case n=3n=3n=3 as a consequence of the fact that two-qutrit PPT states have Schmidt number of at most 2. The PPT square conjecture in the case of $n\ensuremath{\ge}4$ is still open. We present an example to support the conjecture for n=4n=4n=4.
The PPT2 conjecture asserts that the composition of any two PPT maps is entanglement breaking. It is proven for maps on matrices of size up to 3times33 times 33times3 and for several structured families, but the general case remains 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.