Operational criterion and constructive checks for the separability of low-rank density matrices
Open accessThe 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.
Integrity signals
Registry
Cites
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.
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
Can Quantum-Mechanical Description of Physical Reality Be Considered Complete?
Einstein, A., Podolsky, B., & Rosen, N. (1935) · Physical Review · doi:10.1103/physrev.47.777 · Cited by 16,654
Teleporting an unknown quantum state via dual classical and Einstein-Podolsky-Rosen channels
Bennett, C. H., Brassard, G., Crépeau, C., Jozsa, R., Peres, A., & Wootters, W. K. (1993) · Physical Review Letters · doi:10.1103/physrevlett.70.1895 · Cited by 13,703
Quantum cryptography based on Bell’s theorem
Ekert, A. K. (1991) · Physical Review Letters · doi:10.1103/physrevlett.67.661 · Cited by 10,777
Separability Criterion for Density Matrices
Peres, A. (1996) · Physical Review Letters · doi:10.1103/physrevlett.77.1413 · Cited by 5,191
Quantum states with Einstein-Podolsky-Rosen correlations admitting a hidden-variable model
Werner, R. F. (1989) · Physical Review A · doi:10.1103/physreva.40.4277 · Cited by 4,062
Separability of mixed states: necessary and sufficient conditions
Horodecki, M., Horodecki, P., & Horodecki, R. (1996) · Physics Letters A · doi:10.1016/s0375-9601(96)00706-2 · Cited by 3,649
Self-citationDiscussion of Probability Relations between Separated Systems
Schrödinger, E. (1935) · Mathematical Proceedings of the Cambridge Philosophical Society · doi:10.1017/s0305004100013554 · Cited by 3,124
Quantum Privacy Amplification and the Security of Quantum Cryptography over Noisy Channels
Deutsch, D., Ekert, A., Jozsa, R., Macchiavello, C., Popescu, S., & Sanpera, A. (1996) · Physical Review Letters · doi:10.1103/physrevlett.77.2818 · Cited by 1,268
Mixed-state entanglement and distillation: Is there a ‘bound’ entanglement in nature?
Horodecki, M., Horodecki, P., & Horodecki, R. (1998) · Physical Review Letters · doi:10.1103/physrevlett.80.5239 · Cited by 1,208
Self-citationSeparability of Very Noisy Mixed States and Implications for NMR Quantum Computing
Braunstein, S. L., Caves, C. M., Jozsa, R., Linden, N., Popescu, S., & Schack, R. (1999) · Physical Review Letters · doi:10.1103/physrevlett.83.1054 · Cited by 566
Inseparable Two Spin-12Density Matrices Can Be Distilled to a Singlet Form
Horodecki, M., Horodecki, P., & Horodecki, R. (1997) · Physical Review Letters · doi:10.1103/physrevlett.78.574 · Cited by 402
Self-citationBound entanglement can be activated
Horodecki, P., Horodecki, M., & Horodecki, R. (1999) · Physical Review Letters · doi:10.1103/physrevlett.82.1056 · Cited by 399
Self-citation
Cited by
Horodecki, R., Horodecki, P., Horodecki, M., & Horodecki, K. (2009) · Reviews of Modern Physics · doi:10.1103/revmodphys.81.865 · Cited by 10,118
Self-citationGühne, O., & Tóth, G. (2009) · Physics Reports · doi:10.1016/j.physrep.2009.02.004 · Cited by 2,401
“This state has also the minimal possible rank, since the minimal rank of a PPT entangled state in a dA × dB-system is max{dA, dB} + 1 [129].”
BackgroundEntanglement Breaking Channels
Horodecki, M., Shor, P. W., & Ruskai, M. B. (2003) · Reviews in Mathematical Physics · doi:10.1142/s0129055x03001709 · Cited by 604
Bengtsson, I., & Życzkowski, K. (2006) · doi:10.2277/0521814510 · Cited by 449
Quantum Correlations in Systems of Indistinguishable Particles
Eckert, K., Schliemann, J., Bruß, D., & Lewenstein, M. (2002) · Annals of Physics · doi:10.1006/aphy.2002.6268 · Cited by 397
Self-citation
Metadata
- Authors
- Horodecki, P., Lewenstein, M., Vidal, G., & Cirac, I.
- Venue
- Physical Review A
- Publisher
- American Physical Society (APS)
- 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.