Positive-partial-transpose square conjecture for n=3

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≥4 is still open. We present an example to support the conjecture for n=4.