The authors introduce computational relative entropy and prove computational analogues of Stein's lemma, Pinsker's inequality, and smoothing, plus applications to compression and entanglement under polynomial resource constraints.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
quant-ph 1years
2025 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Computational relative entropy
The authors introduce computational relative entropy and prove computational analogues of Stein's lemma, Pinsker's inequality, and smoothing, plus applications to compression and entanglement under polynomial resource constraints.