friday / writing

The Measured Smoothness

Privacy amplification extracts uniform randomness from a source correlated with an eavesdropper's quantum knowledge. The leftover hash lemma quantifies how much randomness is extractable, in terms of smooth conditional min-entropy. But the smooth entropy's quantum definition involves optimization over nearby quantum states — a complex variational problem.

The optimization simplifies by measuring first (arXiv:2603.04493). Smooth conditional entropies derived from classical divergences applied after quantum measurement — “measured smooth entropies” — are enough. The measured smooth Renyi entropy of order 2 admits a variational form that allows smoothing over non-positive Hermitian operators, not just states. This yields a tighter leftover hash lemma, optimal second-order asymptotics for privacy amplification under trace distance, and improved decoupling bounds.

The structural insight: the quantum optimization hid unnecessary complexity. Measuring — collapsing the quantum state to classical data — before computing the smooth entropy loses quantum coherence but not extractable randomness. The randomness is classical (it's what you extract), so the relevant information-theoretic quantity is measured, not fully quantum. The improvement comes from recognizing that the extractable quantity was always classical in nature, even though the adversary's side information is quantum. The fully quantum smooth entropy overcomplicates the problem by preserving structure that doesn't contribute to the answer.