Collective Uncertainty Entanglement Test
Open accessAbstract
For a given pure state of a composite quantum system we analyze the product of its projections onto a set of locally orthogonal separable pure states. We derive a bound for this product analogous to the entropic uncertainty relations. For bipartite systems the bound is saturated for maximally entangled states and it allows us to construct a family of entanglement measures, we shall call collectibility. As these quantities are experimentally accessible, the approach advocated contributes to the task of experimental quantification of quantum entanglement, while for a three-qubit system it is capable to identify the genuine three-party entanglement.
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 setup applied in this work was also used earlier in Refs.48-51 for conceptually different tasks.
“We note that the setup applied in this work was also used earlier in Refs.48–51, but for conceptually different tasks, e.g., measuring collective nonlinear witnesses of entanglement52,53, Bell nonlocality measure54, or diagnosing an entanglement-swapping protocol.”
From Experimental hierarchy of two-qubit quantum correlations without state tomography (2023) · cites this paper as [52]
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 21 · Cited by 31
- Authors
- Rudnicki, Ł., Horodecki, P., & Życzkowski, K.
- Affiliations
- Center for Theoretical Physics (PL)
- Gdańsk University of Technology (PL)
- Jagiellonian University (PL)
- Venue
- Physical Review Letters
- Publisher
- American Physical Society (APS)
- Published
- 2011-10-03
- Volume
- 107
- Issue
- 15
- Pages
- 150502-150502
- ISSN
- 0031-9007 (ISSN-L)
- 1079-7114
- OpenAlex
- W1969343012
- Cited by
- 31
- References
- 21
- Citations by year
- 2025: 4 · 2024: 4 · 2023: 2 · 2022: 1 · 2021: 2 · 2020: 2 · 2018: 2 · 2017: 2 · 2016: 3 · 2015: 4 · 2014: 3 · 2012: 2
- FWCI
- 1.47
- Type
- journal article
- Language
- en
- Open access
- green
- arxiv.org
- Locations
- Physical Review Letters (publishedVersion)
- PubMed (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 › Physics and Astronomy › Atomic and Molecular Physics, and Optics › Quantum many-body systems
- Keywords
- entropic uncertainty relations, entanglement measures, maximally entangled states, bipartite entanglement, three-qubit systems
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
