betaFeedback

WorksComputer Science

Optimal Min-Entropy Estimation with High Probability

Abstract

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 ε\varepsilon and probability at least 1−δ1-δ, the sample complexity is Θ(dlog⁡(d/δ)/ε2)Θ(d\log(d/δ)/\varepsilon^2) for classical distributions on dd symbols and Θ((d2+dlog⁡(1/δ))/ε2)Θ((d^2+d\log(1/δ))/\varepsilon^2) for quantum states on a dd-dimensional Hilbert space. Our results admit short and simple proofs.

Paper details

vlnc:W_rtjv9vnc
Version
v1 · latest
Published
Fresh — added to the Hub within the last 30 days
Added
License
arXiv nonexclusive license
Usage

views · 0

downloads · 0

A view counts once per browser per day, a download each time the PDF is requested.

  • Computer Science

Large Language Models

View statement
Looking for related papers…