The DOI matches its Crossref record; 3 of the 3 references it cites were found in a registry or an index.
Lower bound for accessible information in quantum mechanics
Abstract
It has long been known that the von Neumann entropy S is an upper bound on the information one can extract from a quantum system in an unknown pure state. In this paper we define the ``subentropy'' Q, which we prove to be a lower bound on this information. Moreover, just as the von Neumann entropy is the best upper bound that depends only on the density matrix, we show that Q is the best lower bound that depends only on the density matrix. Other parallels between S and Q are also demonstrated.
Overview
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
Verification
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.
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
Quantum cryptography based on Bell’s theorem
Ekert, A. K. (1991) · Physical Review Letters · doi:10.1103/physrevlett.67.661 · Cited by 10,777
Quantum theory, the Church–Turing principle and the universal quantum computer
Deutsch, D. (1985) · Proceedings of the Royal Society of London. A. Mathematical and Physical Sciences · doi:10.1098/rspa.1985.0070 · Cited by 4,597
Practical quantum cryptography based on two-photon interferometry
Ekert, A. K., Rarity, J. G., Tapster, P. R., & Massimo Palma, G. (1992) · Physical Review Letters · doi:10.1103/physrevlett.69.1293 · Cited by 340
Cited by
A complete classification of quantum ensembles having a given density matrix
Hughston, L. P., Jozsa, R., & Wootters, W. K. (1993) · Physics Letters A · doi:10.1016/0375-9601(93)90880-9 · Cited by 649
Self-citationClassical information capacity of a quantum channel
Hausladen, P., Jozsa, R., Schumacher, B., Westmoreland, M., & Wootters, W. K. (1996) · Physical Review A · doi:10.1103/physreva.54.1869 · Cited by 498
Self-citationBengtsson, I., & Życzkowski, K. (2006) · doi:10.2277/0521814510 · Cited by 449
Quantum limits on bosonic communication rates
Caves, C. M., & Drummond, P. D. (1994) · Reviews of Modern Physics · doi:10.1103/revmodphys.66.481 · Cited by 432
Measures and dynamics of entangled states
Mintert, F., Carvalho, A. R. R., Kuś, M., & Buchleitner, A. (2005) · Physics Reports · doi:10.1016/j.physrep.2005.04.006 · Cited by 420
Metadata
- Authors
- Jozsa, R., Robb, D., & Wootters, W. K.
- Venue
- Physical Review A
- Publisher
- American Physical Society (APS)
- Published
- 1994-02-01
- Volume
- 49
- Issue
- 2
- Pages
- 668-677
- ISSN
- 0556-2791 (ISSN-L)
- 1050-2947
- 1094-1622
- OpenAlex
- W2086452860
- Cited by
- 159
- References
- 3
- FWCI
- 8.15
- Type
- journal article
- Language
- en
- Open access
- closed
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.