CoChat

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

Open access
Horodecki, Paweł, Lewenstein, Maciej, Vidal, Guifré, Cirac, Ignacio · 2000 · Physical Review A
Cited by 149

The DOI matches its Crossref record; 12 of the 12 references it cites were found in a registry or an index.

Abstract

We consider low-rank density operators $\ensuremath{\varrho}$ supported on a $M\ifmmode\times\else\texttimes\fi{}N$ Hilbert space for arbitrary M and N $(M<~N),$ and with a positive partial transpose (PPT) ${\ensuremath{\varrho}}^{{T}_{A}}>~0.$ For rank $r(\ensuremath{\varrho})<~N$ we prove that having a PPT is necessary and sufficient for $\ensuremath{\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 $\ensuremath{\varrho}$ and ${\ensuremath{\varrho}}^{{T}_{A}}$ satisfies $r(\ensuremath{\varrho})+r({\ensuremath{\varrho}}^{{T}_{A}})<~2MN\ensuremath{-}M\ensuremath{-}N+2.$ This separability condition has the form of a constructive check, thus also providing 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.

Overview

The claims and statistics of this paper haven’t been checked yet.

Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1103/physreva.62.032310

Cites

12 of 12 references verified0 citation errors · 0 not checkable

Statistics

Verification

Claims the paper makes

The claims and statistics of this paper haven’t been checked yet.

Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.

A few free checks a day · papers already verified open instantly · results are public

Self-check

Percentages, sums and reported differences re-computed from the paper’s own numbers.

The self-check needs the paper’s full text.

Citations

Cites

Cited by

See all 149

Metadata

Authors
Horodecki, P., Lewenstein, M., Vidal, G., & Cirac, I.
Venue
Physical Review A
Published
2000-08-17
Volume
62
Issue
3
ISSN
  • 0556-2791 (ISSN-L)
  • 1050-2947
  • 1094-1622
OpenAlex
W1990758844
Cited by
149
References
12
FWCI
10.41
Type
journal article
Language
en
Open access
green

About these checks

Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.

Statistics and arithmetic are recomputed, not judged.

Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.

What counts as a claim ›How we measure confidence ›How we check this ›

Are you an author, or do you see a problem with this page? Request a review

Data sources

Bibliographic data: Semantic Scholar, OpenAlex, Crossref.

Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).

Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.