Classification of multiqubit mixed states: Separability and distillability properties
Open accessAbstract
We give a complete, hierarchic classification for arbitrary multiqubit mixed states based on the separability properties of certain partitions. We introduce a family of N-qubit states to which any arbitrary state can be depolarized. This family can be viewed as the generalization of Werner states to multiqubit systems. We fully classify those states with respect to their separability and distillability properties. This provides sufficient conditions for nonseparability and distillability for arbitrary states.
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Claims other papers make about this one
Each is checked against this paper’s own text: does it say what the citing paper says it does?
The state |φ_4〉 is not equivalent to a 4-qubit GHZ state.
“| φ 4 〉 is not equivalent to a 4-qubit GHZ state [4].”
From Persistent Entanglement in Arrays of Interacting Particles (2001) · cites this paper as [4]
The fragility of GHZ states was also observed in [86] by an analysis based on their separability and distillability properties [87,88] rather than a dynamical approach.
“In addition, this fragility of GHZ states was also observed in [86] by an analysis based on their separability and distillability properties [87,88] rather than a dynamical approach.”
From Measures and dynamics of entangled states (2005) · cites this paper as [88]
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
The citation lists haven’t been fetched yet
References 26 · Cited by 291
Research works printed but not linked: 1
- [19]G. E. Andrews, The theory of partitions, Encyclopedia of mathematics and its applications, Addison-Wesley Publishing Company 1976
- Authors
- Dür, W., & Cirac, J. I.
- Affiliations
- Universität Innsbruck (AT)
- ORCID
- Venue
- Physical Review A
- Publisher
- American Physical Society (APS)
- Published
- 2000-03-17
- Volume
- 61
- Issue
- 4
- ISSN
- 0556-2791 (ISSN-L)
- 1050-2947
- 1094-1622
- OpenAlex
- W2052912259
- Cited by
- 291
- References
- 26
- Citations by year
- 2026: 4 · 2025: 14 · 2024: 12 · 2023: 10 · 2022: 14 · 2021: 12 · 2020: 11 · 2019: 11 · 2018: 10 · 2017: 11 · 2016: 10 · 2015: 13 · 2014: 7 · 2013: 5 · 2012: 11
- FWCI
- 16.20
- Type
- journal article
- Language
- en
- Open access
- green
- arxiv.org
- Locations
- Physical Review A (publishedVersion)
- arXiv (Cornell University) (submittedVersion)
- arXiv (Cornell University)
- Topics
- Physical Sciences › Computer Science › Artificial Intelligence › Quantum Information and Cryptography
- Physical Sciences › Physics and Astronomy › Atomic and Molecular Physics, and Optics › Quantum Mechanics and Applications
- Physical Sciences › Computer Science › Artificial Intelligence › Quantum Computing Algorithms and Architecture
- Keywords
- separability, distillability, depolarization, Werner states, non-separability, quantum entanglement
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
