A new sample-efficient estimator achieves subquadratic sample complexity for von Neumann entropy, O(d^2(log log d)^2/(epsilon^2 log^2 d) + log^2(d/epsilon)/epsilon^2).
IEEE Transactions on Information Theory , volume =
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
quant-ph 1years
2026 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Breaking the Quadratic Barrier for von Neumann Entropy Estimation
A new sample-efficient estimator achieves subquadratic sample complexity for von Neumann entropy, O(d^2(log log d)^2/(epsilon^2 log^2 d) + log^2(d/epsilon)/epsilon^2).