Entangled edge states of corank one with positive partial transposes
Abstract
We construct a parameterized family of n n PPT (positive partial transpose) states of corank one for each n 3. With a suitable choice of parameters, we show that they are n n PPT entangled edge states of corank one for 3 n 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 4.
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.