Convex Split Lemma without Inequalities

TL;DR

A universal upper bound on the smoothed max mutual information is derived, where "universal"signifies that the bound depends exclusively on R\'enyi entropies and is independent of the system's dimensions.

Abstract

We introduce a refinement to the convex split lemma by replacing the max mutual information with the collision mutual information, transforming the inequality into an equality. This refinement yields tighter achievability bounds for quantum source coding tasks, including state merging and state splitting. Furthermore, we derive a universal upper bound on the smoothed max mutual information, where "universal" signifies that the bound depends exclusively on Rényi entropies and is independent of the system's dimensions. This result has significant implications for quantum information processing, particularly in applications such as the reverse quantum Shannon theorem.

Figures (2)

• Figure 1: Heuristic description of quantum state splitting.
• Figure 2: An LOSE superchannel $\Theta$ (comprising of the channels $\mathcal{E}$ and $\mathcal{F}$, and the state $\varphi$) acting on a communication resource $\mathsf{id}_m$.

Theorems & Definitions (17)

• Lemma 1
• Corollary 1
• Theorem 1
• Theorem 2
• Theorem 3
• proof
• proof
• Definition 1
• proof
• Lemma 2