The positive partial transpose conjecture for n=3
classification
🪐 quant-ph
keywords
conjecturecasemathbbsquarestatesuller-hermesannouncedchristandl
read the original abstract
We present the PPT square conjecture introduced by M. Christandl. We prove the conjecture in the case $n=3$ as a consequence of the fact that two-qutrit PPT states have Schmidt at most two. Our result in Lemma 3 is independent from the proof found M\"uller-Hermes. M\"uller-Hermes announced that this conjecture is true for the states on $\mathbb{C}_3\otimes\mathbb{C}_3$ \cite{hermes} recently. The PPT square conjecture in the case $n\ge4$ is still open.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.