Sampling of Min-Entropy Relative to Quantum Knowledge
Open accessThe DOI matches its Crossref record; 2 of the 2 references it cites were found in a registry or an index.
Abstract
Let$X_1, \ldots, X_n$be a sequence of$n$classical random variables and consider a sample$X_{s_1}, \ldots, X_{s_r}$of$r \leq n$positions selected at random. Then, except with (exponentially in$r$) small probability, the min-entropy$H_{\min}(X_{s_1} \cdots X_{s_r})$of the sample is not smaller than, roughly, a fraction${r\over n}$of the overall entropy$H_{\min}(X_1 \cdots X_n)$, which is optimal. Here, we show that this statement, originally proved in [S. Vadhan, LNCS 2729, Springer, 2003] for the purely classical case, is still true if the min-entropy$H_{\min}$is measured relative to a quantum system. Because min-entropy quantifies the amount of randomness that can be extracted from a given random variable, our result can be used to prove the soundness of locally computable extractors in a context where side information might be quantum-mechanical. In particular, it implies that key agreement in the bounded-storage model—using a standard sample-and-hash protocol—is fully secure against quantum adversaries, thus solving a long-standing open problem.
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
Universally 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 · cited 2×
“It relies on the leftover-hash lemma [17] (see also [4]), or, more precisely, its quantum generalization [29] (see also [18], [31]), saying that the randomness of a classical random variable , measured in terms of the min-entropy, can be extracted by applying a suitable hash function.”
BackgroundMethodSelf-citationThe Bounded-Storage Model in the Presence of a Quantum Adversary
Konig, R. T., & Terhal, B. M. (2008) · IEEE Transactions on Information Theory · doi:10.1109/tit.2007.913245 · Cited by 65 · cited 2×
“König and Terhal [20] showed that strong extractors with binary output also extract secure bits against quantum adversaries; this provides quantum extractors with short seeds, but does not achieve significant key expansion in the bounded storage model.”
Background
Cited by
The security of practical quantum key distribution
Scarani, V., Bechmann-Pasquinucci, H., Cerf, N. J., Dušek, M., Lütkenhaus, N., & Peev, M. (2009) · Reviews of Modern Physics · doi:10.1103/revmodphys.81.1301 · Cited by 3,726
Quantum random number generators
Herrero-Collantes, M., & Garcia-Escartin, J. C. (2017) · Reviews of Modern Physics · doi:10.1103/revmodphys.89.015004 · Cited by 791
The Operational Meaning of Min- and Max-Entropy
Konig, R., Renner, R., & Schaffner, C. (2009) · IEEE Transactions on Information Theory · doi:10.1109/tit.2009.2025545 · Cited by 659
Self-citationEntropic 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
Fully Device-Independent Quantum Key Distribution
Vazirani, U., & Vidick, T. (2014) · Physical Review Letters · doi:10.1103/physrevlett.113.140501 · Cited by 494
Metadata
- Authors
- Konig, R., & Renner, R.
- Venue
- IEEE Transactions on Information Theory
- Published
- 2011-07
- Volume
- 57
- Issue
- 7
- Pages
- 4760-4787
- ISSN
- 0018-9448 (ISSN-L)
- 1557-9654
- OpenAlex
- W2099340097
- Cited by
- 64
- References
- 2
- FWCI
- 5.91
- 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: Sampling of Min-Entropy Relative to Quantum Knowledge. https://app.cochat.ai/papers/10.1109/tit.2011.2146730
- The paper
- Konig, R., & Renner, R. (2011). Sampling of Min-Entropy Relative to Quantum Knowledge. IEEE Transactions on Information Theory. https://doi.org/10.1109/tit.2011.2146730
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.