Uhlmann Theorem for Divergences

• Uhlmann theorem for divergences is a generalization of quantum fidelity, extending monotonicity to measures like Umegaki relative entropy and sandwiched Rényi divergences.
• It employs operator convexity, data-processing inequalities, and interpolation techniques to develop unified frameworks and sharp characterizations in quantum information theory.
• The theorem underpins practical approaches in quantum hypothesis testing, channel discrimination, and semidefinite programming relaxations for resource theoretic analyses.

The Uhlmann theorem for divergences generalizes Uhlmann's classical result on quantum fidelity to a broad class of quantum divergences, revealing deep connections between extension properties of quantum states, data-processing inequalities, and optimization characterizations for quantum divergences—including the Umegaki relative entropy, sandwiched Rényi relative entropies, and measured $f$-divergences. These generalizations yield unified frameworks for quantum information-theoretic analyses, enabling strong converse results, semidefinite programming (SDP) relaxations, and sharp characterizations in quantum hypothesis testing, channel discrimination, and resource theory.

1. Classical Uhlmann Theorem and Relative Entropy

A. Uhlmann's original theorem concerns the monotonicity of quantum relative entropy under completely positive, trace-preserving (CPTP) maps. For states $\omega, \nu$ on a unital C*-algebra $\mathfrak{A}$ and a CPTP map $\Phi: \mathfrak{A} \to \mathfrak{B}$, the relative entropy $S(\omega\|\nu)$ satisfies

$$S(\omega \circ \Phi \| \nu \circ \Phi) \leq S(\omega \| \nu)$$

with equality if $\Phi$ is a $*$-homomorphism. For density matrices $\rho, \sigma > 0$, this reduces to

$$S(\rho \| \sigma) = \mathrm{Tr}[\rho (\log \rho - \log \sigma)]$$

Key features of $\omega, \nu$0 are non-negativity, joint convexity, lower semicontinuity in the weak-$\omega, \nu$1 topology, and monotonicity under CPTP maps—the "data-processing inequality" (Pérez-Pardo, 2022).

Uhlmann's proof leverages the interpolation of positive quadratic forms using the Pusz–Woronowicz functional calculus. The data-processing property emerges via form-monotonicity and operator interpolation, and the result underpins major constraints in quantum information processing, including resource theories, error correction, and entropy inequalities.

2. Generalizations to $\omega, \nu$2-Divergences and Operator Convexity

Uhlmann's analytic framework extends beyond Umegaki relative entropy to a family of $\omega, \nu$3-divergences, constructed from operator-convex functions $\omega, \nu$4 on $\omega, \nu$5. The Petz quasi-entropy,

$\omega, \nu$6

and the class of Wigner–Yanase–Dyson-type quantities inherit data-processing inequalities under CPTP maps (Pérez-Pardo, 2022). The connection is mediated by operator-monotonicity, variational forms, and interpolation theorems. This generalizes foundational entropy inequalities (including strong subadditivity) and allows proofs of monotonicity for a wide class of quantum divergences.

3. Uhlmann-Type Theorems for Rényi and Measured Divergences

The classical Uhlmann theorem for fidelity ($\omega, \nu$7) finds its full quantum generalization in the context of Rényi divergences and measured $\omega, \nu$8-divergences. For $\omega, \nu$9, the sandwiched Rényi divergence is given by

$\mathfrak{A}$0

with special cases:

• $\mathfrak{A}$1: min-relative entropy (fidelity),
• $\mathfrak{A}$2: Umegaki relative entropy,
• $\mathfrak{A}$3: max-relative entropy.

These $\mathfrak{A}$4 satisfy the data-processing inequality and are non-decreasing in $\mathfrak{A}$5. The Uhlmann-type theorems for Rényi divergences are as follows (Mazzola et al., 3 Feb 2025):

• Regularized Uhlmann theorem: For every $\mathfrak{A}$6, $\mathfrak{A}$7, and $\mathfrak{A}$8,

$\mathfrak{A}$9

where $\Phi: \mathfrak{A} \to \mathfrak{B}$0.

• Measured (single-shot) Uhlmann theorem: For measured Rényi divergence $\Phi: \mathfrak{A} \to \mathfrak{B}$1,

$\Phi: \mathfrak{A} \to \mathfrak{B}$2

with equality for $\Phi: \mathfrak{A} \to \mathfrak{B}$3 (fidelity) and $\Phi: \mathfrak{A} \to \mathfrak{B}$4 (max-relative entropy).

Proofs exploit spectral pinching, operator anti-monotonicity, de Finetti/post-selection bounds, and minimax optimization via Sion's theorem. These theorems unify block-regularization and single-shot settings, providing sharp equality conditions in key quantum regimes, and forming the crux of resource-theoretic and hypothesis-testing applications (Mazzola et al., 3 Feb 2025).

4. Measured $\Phi: \mathfrak{A} \to \mathfrak{B}$5-Divergences and Variational Formulations

Measured $\Phi: \mathfrak{A} \to \mathfrak{B}$6-divergences extend these results further. For convex, lower-semicontinuous $\Phi: \mathfrak{A} \to \mathfrak{B}$7 with $\Phi: \mathfrak{A} \to \mathfrak{B}$8, and for quantum states $\Phi: \mathfrak{A} \to \mathfrak{B}$9,

$S(\omega\|\nu)$0

Adopting the Fenchel conjugate $S(\omega\|\nu)$1, variational expressions take the form (Fang et al., 11 Feb 2025): $S(\omega\|\nu)$2 Convex reformulations are available when $S(\omega\|\nu)$3 is operator convex for suitable $S(\omega\|\nu)$4, enabling efficient convex optimization (including SDP relaxation for measured Rényi divergences with $S(\omega\|\nu)$5). The class of measured $S(\omega\|\nu)$6-divergences thereby admits both analytic and computational tractability, and the measured and projective variants coincide when the above operator convexity holds (Fang et al., 11 Feb 2025).

5. Purification, Extension, and Minimax Structure

The generalized Uhlmann theorem for measured $S(\omega\|\nu)$7-divergences formalizes the extension property: for suitable $S(\omega\|\nu)$8 (e.g., with $S(\omega\|\nu)$9 operator convex and operator monotone),

$$S(\omega \circ \Phi \| \nu \circ \Phi) \leq S(\omega \| \nu)$$0

and, dually, for $$S(\omega \circ \Phi \| \nu \circ \Phi) \leq S(\omega \| \nu)$$1 operator concave,

$$S(\omega \circ \Phi \| \nu \circ \Phi) \leq S(\omega \| \nu)$$2

For $$S(\omega \circ \Phi \| \nu \circ \Phi) \leq S(\omega \| \nu)$$3-Rényi divergences, this structure covers all $$S(\omega \circ \Phi \| \nu \circ \Phi) \leq S(\omega \| \nu)$$4, with the classical Uhlmann theorem for fidelity recovered at $$S(\omega \circ \Phi \| \nu \circ \Phi) \leq S(\omega \| \nu)$$5. These identities are realized as min-max saddle-point problems, with Sion's theorem guaranteeing order exchange and compactness of the state set ensuring infimum attainment (Fang et al., 11 Feb 2025).

A geometric interpretation follows: for suitable $$S(\omega \circ \Phi \| \nu \circ \Phi) \leq S(\omega \| \nu)$$6, measured $$S(\omega \circ \Phi \| \nu \circ \Phi) \leq S(\omega \| \nu)$$7-divergences reduce (on one side) to a maximization over purifications, generalizing the overlap structure to a broader class of information measures.

6. Applications and Impact in Quantum Information Theory

These Uhlmann-type theorems for divergences, and the supporting variational/extension frameworks, underpin several central results and operational applications:

• Hypothesis testing: The regularized Rényi divergences set strong converse rates for error exponents.
• Resource theories: Minimal divergence from free sets, as characterized by support functionals and measured divergences, determines dilution and distillation rates, with SDP-based evaluation directly leveraging measured Uhlmann theorems.
• Channel capacities: SDP upper and lower bounds via measured Rényi divergences enable efficient certification of channel properties.
• Continuity: Support-function approximation (e.g., via post-selection) provides Fannes-type continuity bounds essential in asymptotic analyses.
• Strong subadditivity and recovery: Uhlmann's analytic constructs form the backbone of results such as strong subadditivity and Petz recovery, fundamentally constraining information dynamics under CPTP maps (Pérez-Pardo, 2022, Fang et al., 11 Feb 2025).

A selection of central results is summarized in the following table:

Theorem/Result	Setting	Divergence Type/Facts
Uhlmann monotonicity/data processing	CPTP maps, relative entropy	$$S(\omega \circ \Phi \| \nu \circ \Phi) \leq S(\omega \| \nu)$$8
Regularized Uhlmann theorem for Rényi divergences	Block-regularized over extensions	$$S(\omega \circ \Phi \| \nu \circ \Phi) \leq S(\omega \| \nu)$$9
Measured Uhlmann theorem for $\Phi$0-divergences	Measured divergence (POVM, PVM)	Extension property: equality after minimization
Variational formulation for measured divergences	Convex/SDP program	$\Phi$1

In summary, Uhlmann-type theorems for divergences unify the structure of quantum distinguishability measures, their operational interpretations, and their optimization-theoretic characterizations. They play a foundational role in quantum information science, from mathematical formalism to application in resource conversion, hypothesis testing, and channel analysis (Pérez-Pardo, 2022, Mazzola et al., 3 Feb 2025, Fang et al., 11 Feb 2025).