The DOI matches its Crossref record; 3 of the 3 references it cites were found in a registry or an index.
Duality Between Smooth Min- and Max-Entropies
Open accessAbstract
In classical and quantum information theory, operational quantities such as the amount of randomness that can be extracted from a given source or the amount of space needed to store given data are normally characterized by one of two entropy measures, called smooth min-entropy and smooth max-entropy, respectively. While both entropies are equal to the von Neumann entropy in certain special cases (e.g., asymptotically, for many independent repetitions of the given data), their values can differ arbitrarily in the general case. In this paper, a recently discovered duality relation between (nonsmooth) min- and max-entropies is extended to the smooth case. More precisely, it is shown that the smooth min-entropy of a systemAconditioned on a systemBequals the negative of the smooth max-entropy ofAconditioned on a purifying systemC. This result immediately implies that certain operational quantities (such as the amount of compression and the amount of randomness that can be extracted from given data) are related. We explain how such relations have applications in cryptographic security proofs.
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
Quantum Computation and Quantum Information
Nielsen, M. A., Chuang, I., & Grover, L. K. (2002) · American Journal of Physics · doi:10.1119/1.1463744 · Cited by 21,895
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-citationUniversally Composable Privacy Amplification Against Quantum Adversaries
Renner, R., & König, R. (2005) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-30576-7_22 · Cited by 337
Self-citation
Cited by
Chitambar, E., & Gour, G. (2019) · Reviews of Modern Physics · doi:10.1103/revmodphys.91.025001 · Cited by 1,276
Wilde, M. M. (2013) · doi:10.1017/cbo9781139525343 · Cited by 1,138
Vinjanampathy, S., & Anders, J. (2016) · Contemporary Physics · doi:10.1080/00107514.2016.1201896 · Cited by 937
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-citationBranciard, C., Cavalcanti, E. G., Walborn, S. P., Scarani, V., & Wiseman, H. M. (2012) · Physical Review A · doi:10.1103/physreva.85.010301 · Cited by 762
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
Self-citationTight 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
Uncertainty Relation for Smooth Entropies
Tomamichel, M., & Renner, R. (2011) · Physical Review Letters · doi:10.1103/physrevlett.106.110506 · Cited by 461
Self-citationThe 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-citationFinite-key analysis for measurement-device-independent quantum key distribution
Curty, M., Xu, F., Cui, W., Lim, C. C. W., Tamaki, K., & Lo, H.-K. (2014) · Nature Communications · doi:10.1038/ncomms4732 · Cited by 409
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-citationPrivate randomness expansion with untrusted devices
Colbeck, R., & Kent, A. (2011) · Journal of Physics A: Mathematical and Theoretical · doi:10.1088/1751-8113/44/9/095305 · Cited by 333
Self-citationQuantum Information Processing with Finite Resources
Tomamichel, M. (2016) · SpringerBriefs in Mathematical Physics · doi:10.1007/978-3-319-21891-5 · Cited by 329
Self-citationLeftover 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-citationPractical device-independent quantum cryptography via entropy accumulation
Arnon-Friedman, R., Dupuis, F., Fawzi, O., Renner, R., & Vidick, T. (2018) · Nature Communications · doi:10.1038/s41467-017-02307-4 · Cited by 269
Self-citationTrevisan'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-citationThe decoupling approach to quantum information theory
Dupuis, F. (2010) · arXiv · doi:10.48550/arxiv.1004.1641 · Cited by 90
Identifying the Information Gain of a Quantum Measurement
Berta, M., Renes, J. M., & Wilde, M. M. (2014) · IEEE Transactions on Information Theory · doi:10.1109/tit.2014.2365207 · Cited by 60
The information theoretic interpretation of the length of a curve
Czech, B., Hayden, P., Lashkari, N., & Swingle, B. (2015) · Journal of High Energy Physics · doi:10.1007/jhep06(2015)157 · Cited by 45
Metadata
- Authors
- Tomamichel, M., Colbeck, R., & Renner, R.
- Venue
- IEEE Transactions on Information Theory
- Published
- 2010-09
- Volume
- 56
- Issue
- 9
- Pages
- 4674-4681
- ISSN
- 0018-9448 (ISSN-L)
- 1557-9654
- OpenAlex
- W2166302514
- Cited by
- 236
- References
- 3
- FWCI
- 20.07
- 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.