In this paper, we provide estimators for quantum Rényi and Tsallis entropies with nearly optimal sample complexity. Specifically, for order
α, dimension
d, and additive error
ε,
1. For
0<α<1, the sample complexity is
O(d1+1/α/ε1/α+d1/α−1/ε2) for Rényi entropy and
O(d1+1/α/ε1/α+d2−2α/ε2) for Tsallis entropy. In particular, for
0<α≤1/2, the sample complexity for both entropies is
O(d1+1/α/ε1/α).
2. For non-integer
α>1, the sample complexity is
O(d2/ε1/α+d1−1/α/ε2) for Rényi entropy.
Our upper bounds improve the quantum Rényi entropy estimators due to Acharya, Issa, Shende, and Wagner (2017) and the quantum Tsallis entropy estimators due to Chen, Liu, and Wang (2026), and match the lower bounds recently established by Wang (2026).
Entropy is a key concept of quantum information theory. The entropy of a quantum system is a measure of its randomness and has many applications in quantum communication protocols, quantum coherence, and so on. In this paper, based on the Rényi entropy and Tsallis entropy, we derive the bounds of the expectation value and variance of a quantum observable. By the maximal value of Rényi entropy, we show an upper bound on the product of variance and entropy. Furthermore, we obtain the reverse uncertainty relation for the product and sum of the variances for [Formula: see text] observables respectively.