Measured Smooth Entropies

• Measured smooth entropies are operational measures that refine classical and quantum Rényi entropies through smoothing of nearby states and measurement lifting.
• They underpin finite blocklength tasks—such as privacy amplification, channel simulation, and source coding—by enabling tight one-shot and second-order analyses.
• Their key properties, including data-processing monotonicity and hypothesis-testing duality, improve the precision and security of both quantum and classical information protocols.

Measured smooth entropies are a class of operationally motivated entropy measures originating from the quantum and classical one-shot information theory literature. They refine standard (Rényi) entropic quantities via two key mechanisms: (1) optimization/smoothing over nearby sub-normalized states or probability distributions, and (2) lifting of classical divergence and entropy formulations to the quantum setting via measurement optimization. These entropies, including measured smooth max-relative entropy and measured smooth conditional Rényi entropy, play a central role in quantifying resources in tasks such as privacy amplification, data compression, and channel simulation, especially under non-asymptotic (finite blocklength) constraints (Tomamichel et al., 2010, Regula et al., 21 Jan 2025, Regula et al., 4 Mar 2026, Sakai et al., 2020).

1. Formal Definitions and Construction

Measured smooth entropies generalize classical and quantum Rényi entropies by introducing smoothing (allowing small perturbations in total variation/trace/purified distance) and measurement lifting.

• Measured Smooth Max-Relative Entropy:

Given quantum states $\rho, \sigma$ on a finite-dimensional Hilbert space, and $\varepsilon \in [0,1]$, the measured smooth max-relative entropy is

$$D_{\max,\,\mathbb{M}}^\varepsilon(\rho\|\sigma) = \sup_{M \in \mathbb{M}} D_{\max}^\varepsilon\bigl(p_{\rho, M} \| p_{\sigma, M}\bigr) = \widetilde D_{\max}^\varepsilon(\rho\|\sigma)$$

where $D_{\max}^\varepsilon(p\|q)$ is the smoothed max-relative entropy between classical distributions $p, q$ and $p_{\rho, M}$ is the POVM-induced distribution. The $\widetilde D_{\max}^\varepsilon$ "information-spectrum" form is

$\widetilde D_{\max}^\varepsilon(\rho\|\sigma) = \log \min\{\lambda \geq 0 : \Tr[\rho - \lambda\sigma]_+ \leq \varepsilon\}$

(Regula et al., 21 Jan 2025).

• Measured Smooth Conditional Rényi Entropy:

For a classical-quantum state $\rho_{XE}$ and order $\alpha > 1$,

$\varepsilon \in [0,1]$0

with the measured smooth divergence

$\varepsilon \in [0,1]$1

(Regula et al., 4 Mar 2026).

• Smoothing Paradigm:

Smoothing is performed by optimizing over nearby states $\varepsilon \in [0,1]$2 with $\varepsilon \in [0,1]$3 (trace, purified, or total variation distance) or, for measured or information-spectrum variants, via truncation or sub-operators constrained in distance.

2. Key Properties and Theoretical Relations

Measured smooth entropies satisfy several information-theoretic properties central for operational tasks:

1. Data-Processing Monotonicity: For any CPTP map $\varepsilon \in [0,1]$4,

$\varepsilon \in [0,1]$5

(Regula et al., 4 Mar 2026).

2. Duality and Information Spectrum Equivalence: Measured smooth max-relative entropies are in exact two-way equivalence with hypothesis-testing relative entropy, facilitating tight conversion between achievability and converse in one-shot settings:

$\varepsilon \in [0,1]$6

$\varepsilon \in [0,1]$7

(Regula et al., 21 Jan 2025).

3. Interpolation and Large Deviations: For $\varepsilon \in [0,1]$8,

$\varepsilon \in [0,1]$9

supporting exponential error bounds in hypothesis testing and privacy amplification (Regula et al., 4 Mar 2026).

4. Tightened Gentle Measurement and Datta–Renner Lemmas:

Improvements to fundamental lemmas underpin tighter fidelity and trace-distance approximations: - For $$D_{\max,\,\mathbb{M}}^\varepsilon(\rho\|\sigma) = \sup_{M \in \mathbb{M}} D_{\max}^\varepsilon\bigl(p_{\rho, M} \| p_{\sigma, M}\bigr) = \widetilde D_{\max}^\varepsilon(\rho\|\sigma)$$0, then the fidelity

$$D_{\max,\,\mathbb{M}}^\varepsilon(\rho\|\sigma) = \sup_{M \in \mathbb{M}} D_{\max}^\varepsilon\bigl(p_{\rho, M} \| p_{\sigma, M}\bigr) = \widetilde D_{\max}^\varepsilon(\rho\|\sigma)$$1

(Regula et al., 21 Jan 2025).

3. Measured Smooth Rényi Entropy in Classical and Quantum Regimes

Measured smooth Rényi entropy generalizes both the operational and asymptotic behavior of smooth entropies across classical and quantum settings:

• Classical (Commuting) Case:

For commuting states, measured smoothing reduces to classical information-spectrum quantities, and trace- or total-variation smoothing suffices (Regula et al., 21 Jan 2025, Sakai et al., 2020). The asymptotics yield direct strong-converse exponent relations and second-order refinements.

• Quantum Measurement Lifting:

The quantum version is defined by the supremum over all POVMs applied to $$D_{\max,\,\mathbb{M}}^\varepsilon(\rho\|\sigma) = \sup_{M \in \mathbb{M}} D_{\max}^\varepsilon\bigl(p_{\rho, M} \| p_{\sigma, M}\bigr) = \widetilde D_{\max}^\varepsilon(\rho\|\sigma)$$2, capturing the optimal information extractable via measurement. This is crucial for operationalizing entropy in scenarios where quantum side-information persists, such as privacy amplification and decoupling (Regula et al., 4 Mar 2026).

• Conditional and One-Shot Forms:

Conditional measured smooth entropies appear by minimizing over states on side-information systems, yielding tight one-shot characterizations for tasks involving eavesdroppers and adversaries.

4. Operational Applications: Privacy Amplification, Coding, and Guessing

Measured smooth entropies are central to one-shot and finite-blocklength protocols in information theory and quantum cryptography:

• Privacy Amplification:

The measured-smooth leftover hash lemma demonstrates that the extractable key length up to trace distance $$D_{\max,\,\mathbb{M}}^\varepsilon(\rho\|\sigma) = \sup_{M \in \mathbb{M}} D_{\max}^\varepsilon\bigl(p_{\rho, M} \| p_{\sigma, M}\bigr) = \widetilde D_{\max}^\varepsilon(\rho\|\sigma)$$3 is

$$D_{\max,\,\mathbb{M}}^\varepsilon(\rho\|\sigma) = \sup_{M \in \mathbb{M}} D_{\max}^\varepsilon\bigl(p_{\rho, M} \| p_{\sigma, M}\bigr) = \widetilde D_{\max}^\varepsilon(\rho\|\sigma)$$4

surpassing previous smooth-min-entropy-based results, and achieving optimality up to logarithmic terms (Regula et al., 4 Mar 2026).

• Channel Simulation and Resource Transformation:

The achievability/converse duality implies that every one-shot coding bound in terms of observed smooth entropies can be tightly matched to hypothesis-testing converses and vice versa (Regula et al., 21 Jan 2025).

• Source Coding and Guessing:

Asymptotic expansions for smooth Rényi entropies translate directly to precise second-order and moderate deviation bounds for variable-length source coding, task encoding, and guessing with giving-up (Sakai et al., 2020).

Task	Key Measured Smooth Entropy	Reference
Privacy Amplification	$$D_{\max,\,\mathbb{M}}^\varepsilon(\rho\|\sigma) = \sup_{M \in \mathbb{M}} D_{\max}^\varepsilon\bigl(p_{\rho, M} \| p_{\sigma, M}\bigr) = \widetilde D_{\max}^\varepsilon(\rho\|\sigma)$$5	(Regula et al., 4 Mar 2026)
Channel Simulation	$$D_{\max,\,\mathbb{M}}^\varepsilon(\rho\|\sigma) = \sup_{M \in \mathbb{M}} D_{\max}^\varepsilon\bigl(p_{\rho, M} \| p_{\sigma, M}\bigr) = \widetilde D_{\max}^\varepsilon(\rho\|\sigma)$$6, $$D_{\max,\,\mathbb{M}}^\varepsilon(\rho\|\sigma) = \sup_{M \in \mathbb{M}} D_{\max}^\varepsilon\bigl(p_{\rho, M} \| p_{\sigma, M}\bigr) = \widetilde D_{\max}^\varepsilon(\rho\|\sigma)$$7	(Regula et al., 21 Jan 2025)
Source Coding	$$D_{\max,\,\mathbb{M}}^\varepsilon(\rho\|\sigma) = \sup_{M \in \mathbb{M}} D_{\max}^\varepsilon\bigl(p_{\rho, M} \| p_{\sigma, M}\bigr) = \widetilde D_{\max}^\varepsilon(\rho\|\sigma)$$8	(Sakai et al., 2020)
Guessing	$$D_{\max,\,\mathbb{M}}^\varepsilon(\rho\|\sigma) = \sup_{M \in \mathbb{M}} D_{\max}^\varepsilon\bigl(p_{\rho, M} \| p_{\sigma, M}\bigr) = \widetilde D_{\max}^\varepsilon(\rho\|\sigma)$$9, $D_{\max}^\varepsilon(p\|q)$0	(Sakai et al., 2020)

Tight duality and moderate deviation analysis facilitate the precise quantification of security, efficiency, and reliability under resource constraints.

5. Asymptotic Expansions and Second-Order Analysis

Measured smooth entropies exhibit refined asymptotics for i.i.d. sources:

• Second-Order Expansions:

For $D_{\max}^\varepsilon(p\|q)$1, the measured smooth Rényi (especially for $D_{\max}^\varepsilon(p\|q)$2) matches the hypothesis-testing divergence up to $D_{\max}^\varepsilon(p\|q)$3, yielding for privacy amplification:

$D_{\max}^\varepsilon(p\|q)$4

(Regula et al., 4 Mar 2026).

• Large-Deviation Regime:

The error exponent for key extraction or error probabilities is determined by the measured Rényi spectrum:

$D_{\max}^\varepsilon(p\|q)$5

(Regula et al., 4 Mar 2026).

6. Broader Structural Properties and Dynamical Generalizations

Sub-additivity, concavity, and additivity properties are inherited by measured smooth entropies under composition and product structure. The extension of entropy sub-additivity to commuting smooth transformations on Banach spaces (Luo et al., 2022) demonstrates that the essential monotonicity and structural features of entropies are preserved even in infinite-dimensional dynamical contexts, underpinning their robustness as measures of disorder and resource.

7. Significance and Impact

Measured smooth entropies unify operational one-shot information measures with asymptotic, spectrum-based approaches, eliminating previous technical gaps between achievability and converse. They yield:

• The tightest known one-shot and second-order characterizations under trace distance for quantum cryptographic and information-theoretic tasks (Regula et al., 4 Mar 2026).
• A precise map between operational tasks governed by different entropy types (e.g., covering vs. packing protocols) (Regula et al., 21 Jan 2025).
• Enhanced protocols for privacy amplification and decoupling, optimal up to constant-order corrections even in quantum settings.
• Theoretical tools for the analysis of entropy in smooth dynamical systems and infinite-dimensional analysis (Luo et al., 2022).

Measured smooth entropies thus form a foundational toolkit for modern quantum and classical information theory, bridging operational security, coding, and resource conversion in both finite and asymptotic domains.