Answers are grounded in this paper and cite their sources.
Min-entropy plays a fundamental role in assessing the unpredictability of randomness sources. In particular, NIST SP 800-90B specifies min-entropy estimation as a key procedure for entropy sources used in cryptographic random bit generators, illustrating the practical importance of reliable min-entropy estimation. In this paper, we settle the sample complexity of min-entropy estimation with high probability in both the classical and quantum cases. Specifically, for min-entropy estimation with additive error ε and probability at least $1-δ$, the sample complexity is Θ(dlog(d/δ)/ε²) for classical distributions on d symbols and Θ((d²+dlog(1/δ))/ε²) for quantum states on a d-dimensional Hilbert space. Our results admit short and simple proofs.
No takes yet. Share an insight, caveat, or question.
Qisheng Wang (2026) studied this question.
Synapse has enriched 8 closely related papers on similar clinical questions. Consider them for comparative context: