Operational criterion and constructive checks for the separability of low rank density matrices

Physics – Quantum Physics

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

RevTex, 10 pages, no figures

Scientific paper

10.1103/PhysRevA.62.032310

We consider low rank density operators $\varrho$ supported on a $M\times N$ Hilbert space for arbitrary $M$ and $N$ ($M\leq N$) and with a positive partial transpose (PPT) $\varrho^{T_A}\ge 0$. For rank $r(\varrho) \leq N$ we prove that having a PPT is necessary and sufficient for $\varrho$ to be separable; in this case we also provide its minimal decomposition in terms of pure product states. It follows from this result that there is no rank 3 bound entangled states having a PPT. We also present a necessary and sufficient condition for the separability of generic density matrices for which the sum of the ranks of $\varrho$ and $\varrho^{T_A}$ satisfies $r(\varrho)+r(\varrho^{T_A}) \le 2MN-M-N+2$. This separability condition has the form of a constructive check, providing thus also a pure product state decomposition for separable states, and it works in those cases where a system of couple polynomial equations has a finite number of solutions, as expected in most cases.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

Operational criterion and constructive checks for the separability of low rank density matrices does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Operational criterion and constructive checks for the separability of low rank density matrices, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Operational criterion and constructive checks for the separability of low rank density matrices will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-565851

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.