The DOI matches its Crossref record; 2 of the 2 references it cites were found in a registry or an index.
Hiding Classical Data in Multipartite Quantum States
Open accessAbstract
We present a general technique for hiding a classical bit in multipartite quantum states. The hidden bit, encoded in the choice of one of two possible density operators, cannot be recovered by local operations and classical communication without quantum communication. The scheme remains secure if quantum communication is allowed between certain partners, and can be designed for any choice of quantum communication patterns to be secure, but to allow near perfect recovery for all other patterns. No entanglement is needed since the hiding states can be chosen to be separable. A single ebit of prior entanglement is not sufficient to break the scheme.
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
Shamir, A. (1979) · Communications of the ACM · doi:10.1145/359168.359176 · Cited by 13,756
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
Self-citation
Cited by
Everything You Always Wanted to Know About LOCC (But Were Afraid to Ask)
Chitambar, E., Leung, D., Mančinska, L., Ozols, M., & Winter, A. (2014) · Communications in Mathematical Physics · doi:10.1007/s00220-014-1953-9 · Cited by 413
Randomizing Quantum States: Constructions and Applications
Hayden, P., Leung, D., Shor, P. W., & Winter, A. (2004) · Communications in Mathematical Physics · doi:10.1007/s00220-004-1087-6 · Cited by 345
Secure Key from Bound Entanglement
Horodecki, K., Horodecki, M., Horodecki, P., & Oppenheim, J. (2005) · Physical Review Letters · doi:10.1103/physrevlett.94.160502 · Cited by 340
Metadata
- Authors
- Eggeling, T., & Werner, R. F.
- Venue
- Physical Review Letters
- Publisher
- American Physical Society (APS)
- Published
- 2002-08-13
- Volume
- 89
- Issue
- 9
- Pages
- 097905-097905
- ISSN
- 0031-9007 (ISSN-L)
- 1079-7114
- OpenAlex
- W2040790342
- Cited by
- 180
- References
- 2
- FWCI
- 4.01
- 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.