Papers
Topics
Authors
Recent
Search
2000 character limit reached

Entangled edge states of corank one with positive partial transposes

Published 26 Mar 2019 in quant-ph and math.OA | (1903.10745v2)

Abstract: We construct a parameterized family of $n\otimes n$ PPT (positive partial transpose) states of corank one for each $n\ge 3$. With a suitable choice of parameters, we show that they are $n\otimes n$ PPT entangled edge states of corank one for $3\le n\le 1000$. They violate the range criterion for separability in the most extreme way. Note that corank one is the smallest possible corank for such states. The corank of the partial transpose is given by $2n-3$, which is also the smallest possible corank for the partial transposes of PPT entangled edge states of corank one. They provide the first explicit examples of such states for $n\ge 4$.

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.