Convexity and the separability problem of quantum mechanical density matrices
Open accessThe DOI matches its Crossref record; 10 of the 10 references it cites were found in a registry or an index.
Abstract
A finite-dimensional quantum mechanical system is modelled by a density ρ, a trace one, positive semi-definite matrix on a suitable tensor product space H[N]. For the system to demonstrate experimentally certain non-classical behavior, ρ cannot be in S, a closed convex set of densities whose extreme points have a specificed tensor product form. Two mathematical problems in the quantum computing literature arise from this context: 1. the determination whether a given ρ is in S, and 2. a measure of the “entanglement” of such a ρ in terms of its distance from S. In this paper we describe these two problems in detail for a linear algebra audience, discuss some recent results from the quantum computing literature, and prove some new results. We emphasize the roles of densities ρ as both operators on the Hilbert space H[N] and also as points in a real Hilbert space M. We are able to compute the nearest separable densities τ0 to ρ0 in particular classes of inseparable densities and we use the Euclidean distance between the two in M to quantify the entanglement of ρ0. We also show the role of τ0 in the construction of separating hyperplanes, so-called entanglement witnesses in the quantum computing literature.
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 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
Entanglement measures and purification procedures
Vedral, V., & Plenio, M. B. (1998) · Physical Review A · doi:10.1103/physreva.57.1619 · Cited by 1,419 · cited 9×
“Invoking the idea of minimal distance from S [35], we use the Frobenius or Hilbert-Schmidt norm and define a measure of entanglement as the minimal distance of a density ρ from the set of separable states: m [ρ] = inf τ∈S ‖ρ− τ‖ = inf τ∈S √”
BackgroundMethodInfluentialVidal, G. (2000) · Journal of Modern Optics · doi:10.1080/09500340008244048 · Cited by 821
Optimization of entanglement witnesses
Lewenstein, M., Kraus, B., Cirac, J. I., & Horodecki, P. (2000) · Physical Review A · doi:10.1103/physreva.62.052310 · Cited by 684 · cited 4×
“Recent relevant papers which contain further references include [14, 15, 16, 31, 32].”
BackgroundMethodInfluentialSeparability 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
Separability and Distillability of Multiparticle Quantum Systems
Dür, W., Cirac, J. I., & Tarrach, R. (1999) · Physical Review Letters · doi:10.1103/physrevlett.83.3562 · Cited by 279 · cited 1×
“y entangled state ρ0(d). The analogous assertion is false if the number of product states nis bigger than 2. Proof : The proof that τ0(d) is separable has been given in a number of references such as [5, 17, 27, 8] among others. Dropping explicit mention of d, we thus need to prove that for all separable projections τ…”
Lloyd, S. (1995) · Scientific American · doi:10.1038/scientificamerican1095-140 · Cited by 150
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
Gühne, O., & Tóth, G. (2009) · Physics Reports · doi:10.1016/j.physrep.2009.02.004 · Cited by 2,401
Bengtsson, I., & Życzkowski, K. (2006) · doi:10.2277/0521814510 · Cited by 449
Volume of separable states is super-doubly-exponentially small in the number of qubits
Szarek, S. J. (2005) · Physical Review A · doi:10.1103/physreva.72.032304 · Cited by 62
Metadata
- Authors
- Pittenger, A. O., & Rubin, M. H.
- Venue
- Linear Algebra and its Applications
- Publisher
- Elsevier BV
- Published
- 2002-05
- Volume
- 346
- Issue
- 1-3
- Pages
- 47-71
- ISSN
- 0024-3795 (ISSN-L)
- OpenAlex
- W2069478016
- Cited by
- 41
- References
- 10
- FWCI
- 3.01
- Type
- journal article
- Language
- en
- Open access
- bronze
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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Convexity and the separability problem of quantum mechanical density matrices. https://app.cochat.ai/papers/10.1016/s0024-3795(01)00524-9
- The paper
- Pittenger, A. O., & Rubin, M. H. (2002). Convexity and the separability problem of quantum mechanical density matrices. Linear Algebra and its Applications. https://doi.org/10.1016/s0024-3795(01)00524-9
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.