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.
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 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
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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Duality Between Smooth Min- and Max-Entropies. https://app.cochat.ai/papers/10.1109/tit.2010.2054130
- The paper
- Tomamichel, M., Colbeck, R., & Renner, R. (2010). Duality Between Smooth Min- and Max-Entropies. IEEE Transactions on Information Theory. https://doi.org/10.1109/tit.2010.2054130
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.