Pith. sign in

REVIEW

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

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv quant-ph/0002089 v1 pith:JCHV67FG submitted 2000-02-28 quant-ph

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

classification quant-ph
keywords varrhorankdensityseparabilitystatescasesconditionconstructive
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved
0 comments
read the original abstract

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.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.