The DOI matches its Crossref record; 21 of the 21 references it cites were found in a registry or an index.
The Operational Meaning of Min- and Max-Entropy
Open accessAbstract
In this paper, we show that the conditional min-entropyHmin(A|B) of a bipartite staterhoABis directly related to the maximum achievable overlap with a maximally entangled state if only local actions on theB-part ofrhoABare allowed. In the special case whereAis classical, this overlap corresponds to the probability of guessingAgivenB. In a similar vein, we connect the conditional max-entropyHmax(A|B) to the maximum fidelity ofrhoABwith a product state that is completely mixed onA. In the case whereAis classical, this corresponds to the security ofAwhen used as a secret key in the presence of an adversary holdingB. Because min- and max-entropies are known to characterize information-processing tasks such as randomness extraction and state merging, our results establish a direct connection between these tasks and basic operational problems. For example, they imply that the (logarithm of the) probability of guessingAgivenBis a lower bound on the number of uniform secret bits that can be extracted fromArelative to an adversary holdingB.
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
A Mathematical Theory of Communication
Shannon, C. E. (1948) · Bell System Technical Journal · doi:10.1002/j.1538-7305.1948.tb01338.x · Cited by 88,486
A Mathematical Theory of Communication
Shannon, C. E. (1948) · Bell System Technical Journal · doi:10.1002/j.1538-7305.1948.tb00917.x · Cited by 48,949
Linear transformations which preserve trace and positive semidefiniteness of operators
Jamiołkowski, A. (1972) · Reports on Mathematical Physics · doi:10.1016/0034-4877(72)90011-0 · Cited by 1,512
Generalized privacy amplification
Bennett, C. H., Brassard, G., Crepeau, C., & Maurer, U. M. (1995) · IEEE Transactions on Information Theory · doi:10.1109/18.476316 · Cited by 1,417
SECURITY OF QUANTUM KEY DISTRIBUTION
RENNER, R. (2008) · International Journal of Quantum Information · doi:10.1142/s0219749908003256 · Cited by 1,047
Self-citationA general formula for channel capacity
Verdu, S., & Han, T. S. (1994) · IEEE Transactions on Information Theory · doi:10.1109/18.335960 · Cited by 779
Pseudo-random generation from one-way functions
Impagliazzo, R., Levin, L. A., & Luby, M. (1989) · Proceedings of the twenty-first annual ACM symposium on Theory of computing - STOC '89 · doi:10.1145/73007.73009 · Cited by 724
Statistical decision theory for quantum systems
Holevo, A. S. (1973) · Journal of Multivariate Analysis · doi:10.1016/0047-259x(73)90028-6 · Cited by 645
Classical 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
Optimum testing of multiple hypotheses in quantum detection theory
Yuen, H., Kennedy, R., & Lax, M. (1975) · IEEE Transactions on Information Theory · doi:10.1109/tit.1975.1055351 · Cited by 495
A Fully Quantum Asymptotic Equipartition Property
Tomamichel, M., Colbeck, R., & Renner, R. (2009) · IEEE Transactions on Information Theory · doi:10.1109/tit.2009.2032797 · Cited by 356
Self-citationExact Cost of Redistributing Multipartite Quantum States
Devetak, I., & Yard, J. (2008) · Physical Review Letters · doi:10.1103/physrevlett.100.230501 · Cited by 181
Smooth renyi entropy and applications
Renner, R., & Wolf, S. (2004) · International Symposium onInformation Theory, 2004. ISIT 2004. Proceedings. · doi:10.1109/isit.2004.1365269 · Cited by 174
Self-citationCryptography from Noisy Storage
Wehner, S., Schaffner, C., & Terhal, B. M. (2008) · Physical Review Letters · doi:10.1103/physrevlett.100.220502 · Cited by 141
Self-citationA Tight High-Order Entropic Quantum Uncertainty Relation with Applications
Damgård, I., Fehr, S., Renner, R., Salvail, L., & Schaffner, C. (2007) · Lecture notes in computer science · doi:10.1007/978-3-540-74143-5_20 · Cited by 120
Self-citationSingle-shot Quantum State MergingPreprint
Berta, M. (2009) · arXiv (Cornell University) · doi:10.48550/arxiv.0912.4495 · Cited by 108
Smooth Entropies and the Quantum Information Spectrum
Datta, N., & Renner, R. (2009) · IEEE Transactions on Information Theory · doi:10.1109/tit.2009.2018340 · Cited by 89
Self-citationSampling of Min-Entropy Relative to Quantum Knowledge
König, R., & Renner, R. (2011) · IEEE Transactions on Information Theory · doi:10.1109/tit.2011.2146730 · Cited by 76
Self-citationRobust cryptography in the noisy-quantum-storage model
Schaffner, C., Terhal, B. M., & Wehner, S. (2009) · Quantum Information and Computation · doi:10.26421/qic9.11-12-4 · Cited by 44
Self-citationSecurity of Quantum Bit String Commitment Depends on the Information Measure
Buhrman, H., Christandl, M., Hayden, P. M., Lo, H., & Wehner, S. (2006) · Physical Review Letters · doi:10.1103/physrevlett.97.250501 · Cited by 38
Quantum Coding Theorem from Privacy and Distinguishability
Horodecki, M., Lloyd, S., & Winter, A. (2008) · Open Systems & Information Dynamics · doi:10.1142/s1230161208000067 · Cited by 15
Cited by
Brunner, N., Cavalcanti, D., Pironio, S., Scarani, V., & Wehner, S. (2014) · Reviews of Modern Physics · doi:10.1103/revmodphys.86.419 · Cited by 2,688
Random numbers certified by Bell’s theorem
Pironio, S., Acín, A., Massar, S., de la Giroday, A. B., Matsukevich, D. N., Maunz, P., Olmschenk, S., Hayes, D., Luo, L., Manning, T. A., et al. (2010) · Nature · doi:10.1038/nature09008 · Cited by 1,420
Chitambar, E., & Gour, G. (2019) · Reviews of Modern Physics · doi:10.1103/revmodphys.91.025001 · Cited by 1,276
Equilibration, thermalisation, and the emergence of statistical mechanics in closed quantum systems
Gogolin, C., & Eisert, J. (2016) · Reports on Progress in Physics · doi:10.1088/0034-4885/79/5/056001 · Cited by 999
The uncertainty principle in the presence of quantum memory
Berta, M., Christandl, M., Colbeck, R., Renes, J. M., & Renner, R. (2010) · Nature Physics · doi:10.1038/nphys1734 · Cited by 842
Self-citation
Metadata
- Authors
- Konig, R., Renner, R., & Schaffner, C.
- Venue
- IEEE Transactions on Information Theory
- Published
- 2009-09
- Volume
- 55
- Issue
- 9
- Pages
- 4337-4347
- ISSN
- 0018-9448 (ISSN-L)
- OpenAlex
- W2164253138
- Cited by
- 659
- References
- 21
- FWCI
- 33.25
- 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.