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
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
“[21] R.”
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-citationQuantum random number generators
Herrero-Collantes, M., & Garcia-Escartin, J. C. (2017) · Reviews of Modern Physics · doi:10.1103/revmodphys.89.015004 · Cited by 791
On quantum Rényi entropies: A new generalization and some properties
Müller-Lennert, M., Dupuis, F., Szehr, O., Fehr, S., & Tomamichel, M. (2013) · Journal of Mathematical Physics · doi:10.1063/1.4838856 · Cited by 729
Entropic uncertainty relations and their applications
Coles, P. J., Berta, M., Tomamichel, M., & Wehner, S. (2017) · Reviews of Modern Physics · doi:10.1103/revmodphys.89.015002 · Cited by 658
Tight finite-key analysis for quantum cryptography
Tomamichel, M., Lim, C. C. W., Gisin, N., & Renner, R. (2012) · Nature Communications · doi:10.1038/ncomms1631 · Cited by 634
Self-citation(2009) · Information Theory · doi:10.1109/9780470544907.ch24 · Cited by 533
Fully Device-Independent Quantum Key Distribution
Vazirani, U., & Vidick, T. (2014) · Physical Review Letters · doi:10.1103/physrevlett.113.140501 · Cited by 494
Min- and Max-Relative Entropies and a New Entanglement Monotone
Datta, N. (2009) · IEEE Transactions on Information Theory · doi:10.1109/tit.2009.2018325 · Cited by 491
Uncertainty Relation for Smooth Entropies
Tomamichel, M., & Renner, R. (2011) · Physical Review Letters · doi:10.1103/physrevlett.106.110506 · Cited by 461
Self-citationFinite-size analysis of a continuous-variable quantum key distribution
Leverrier, A., Grosshans, F., & Grangier, P. (2010) · Physical Review A · doi:10.1103/physreva.81.062343 · Cited by 460
Quantum majorization and a complete set of entropic conditions for quantum thermodynamics
Gour, G., Jennings, D., Buscemi, F., Duan, R., & Marvian, I. (2018) · Nature Communications · doi:10.1038/s41467-018-06261-7 · Cited by 454
The thermodynamic meaning of negative entropy
Rio, L. D., Åberg, J., Renner, R., Dahlsten, O., & Vedral, V. (2011) · Nature · doi:10.1038/nature10123 · Cited by 420
Self-citationComposable Security Proof for Continuous-Variable Quantum Key Distribution with Coherent States
Leverrier, A. (2015) · Physical Review Letters · doi:10.1103/physrevlett.114.070501 · Cited by 382
Secure device-independent quantum key distribution with causally independent measurement devices
Masanes, L., Pironio, S., & Acín, A. (2011) · Nature Communications · doi:10.1038/ncomms1244 · Cited by 376
Provably secure and high-rate quantum key distribution with time-bin qudits
Islam, N. T., Lim, C. C. W., Cahall, C., Kim, J., & Gauthier, D. J. (2017) · Science Advances · doi:10.1126/sciadv.1701491 · Cited by 355
Quantum Information Processing with Finite Resources
Tomamichel, M. (2016) · SpringerBriefs in Mathematical Physics · doi:10.1007/978-3-319-21891-5 · Cited by 329
Quantum state discrimination and its applications
Bae, J., & Kwek, L.-C. (2015) · Journal of Physics A: Mathematical and Theoretical · doi:10.1088/1751-8113/48/8/083001 · Cited by 320
Performance and structure of single-mode bosonic codes
Albert, V. V., Noh, K., Duivenvoorden, K., Young, D. J., Brierley, R. T., Reinhold, P., Vuillot, C., Li, L., Shen, C., Girvin, S. M., et al. (2018) · Physical Review A · doi:10.1103/physreva.97.032346 · Cited by 305
Leftover Hashing Against Quantum Side Information
Tomamichel, M., Schaffner, C., Smith, A., & Renner, R. (2011) · IEEE Transactions on Information Theory · doi:10.1109/tit.2011.2158473 · Cited by 303
Self-citationA Hierarchy of Information Quantities for Finite Block Length Analysis of Quantum Tasks
Tomamichel, M., & Hayashi, M. (2013) · IEEE Transactions on Information Theory · doi:10.1109/tit.2013.2276628 · Cited by 284
Self-Testing Quantum Random Number Generator
Lunghi, T., Brask, J. B., Lim, C. C. W., Lavigne, Q., Bowles, J., Martin, A., Zbinden, H., & Brunner, N. (2015) · Physical Review Letters · doi:10.1103/physrevlett.114.150501 · Cited by 206
Security of practical private randomness generation
Pironio, S., & Massar, S. (2013) · Physical Review A · doi:10.1103/physreva.87.012336 · Cited by 169
“tropy Hmin(R|E)ρ = max σE Hmin(R|E)ρ|σ , (3) where the maximisation is over normalised states σE and Hmin(R|E)ρ|σ = −log2 min{λ ∈ R: ρRE λIR ⊗σE}. (4) For a cq-state of the form (1), it is shown in [13] that Hmin(R|E)ρ = −log2 pguess(R|E), (5) 2 where pguess(R|E) = max ME X r P(r)tr[ρr EM r E] , (6) is the probability…”
BackgroundMethodTrevisan's Extractor in the Presence of Quantum Side Information
De, A., Portmann, C., Vidick, T., & Renner, R. (2012) · SIAM Journal on Computing · doi:10.1137/100813683 · Cited by 161
Self-citationMannalath, V., Mishra, S., & Pathak, A. (2023) · Quantum Information Processing · doi:10.1007/s11128-023-04175-y · Cited by 125
“In other words, 2−H∞(A|B)ρ gives the lower bound to the probability of guessing outcomes of A given complete knowledge of B [88].”
BackgroundSecurity and composability of randomness expansion from Bell inequalities
Fehr, S., Gelles, R., & Schaffner, C. (2013) · Physical Review A · doi:10.1103/physreva.87.012335 · Cited by 104
“= sup {Mx}x X x PX(x)tr(Mx ρxE), where the supremum is over all POVMs {Mx}x on HE. Definition 2.3. The min-entropy of X given E is given by Hmin(X | E) := −logGuess(X | E). This definition was shown in [KRS09] to coincide with the definition originally introduced by Renner [Ren05] which also coincides with the classical…”
ResultInfluentialSelf-citationThe decoupling approach to quantum information theory
Dupuis, F. (2010) · arXiv · doi:10.48550/arxiv.1004.1641 · Cited by 90
Certifiable quantum dice: or, true random number generation secure against quantum adversaries
Vazirani, U., & Vidick, T. (2012) · Proceedings of the forty-fourth annual ACM symposium on Theory of computing · doi:10.1145/2213977.2213984 · Cited by 80
“The conditional min-entropy can be defined through the guessing entropy as H∞(X|E)ρ = − log pguess(X|E)ρ [18].”
BackgroundVariations on classical and quantum extractors
Berta, M., Fawzi, O., Scholz, V., & Szehr, O. (2014) · 2014 IEEE International Symposium on Information Theory · doi:10.1109/isit.2014.6875078 · Cited by 10
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.