Shannon entropy estimation in data streams exhibits an exponential quantum space advantage over classical streaming algorithms.
We then describe how to obtain an ( ε,δ )-approximation of H(p), i.e., an estimate ˜H(p) that satisfies |˜H(p) − H(p)| ≤ εH(p) with probability at least 1 − δ
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
quant-ph 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Exponential quantum space advantage for Shannon entropy estimation in data streams
Shannon entropy estimation in data streams exhibits an exponential quantum space advantage over classical streaming algorithms.