Defining quantum divergences via convex optimization

Abstract

We introduce a new quantum Rényi divergence $D_{\alpha }^{\#}$ for $\alpha \in (1,\infty )$ defined in terms of a convex optimization program. This divergence has several desirable computational and operational properties such as an efficient semidefinite programming representation for states and channels, and a chain rule property. An important property of this new divergence is that its regularization is equal to the sandwiched (also known as the minimal) quantum Rényi divergence. This allows us to prove several results. First, we use it to get a converging hierarchy of upper bounds on the regularized sandwiched $\alpha$-Rényi divergence between quantum channels for $\alpha >1$. Second it allows us to prove a chain rule property for the sandwiched $\alpha$-Rényi divergence for $\alpha >1$ which we use to characterize the strong converse exponent for channel discrimination. Finally it allows us to get improved bounds on quantum channel capacities.

v2: 26 pages

References in corpus (3)

• Computing conditional entropies for quantum correlations
• Geometric distinguishability measures limit quantum channel estimation and discrimination
• Amortized entanglement of a quantum channel and approximately teleportation-simulable channels

Cited by in corpus (22)

• Semidefinite programming relaxations for quantum correlations
• Computing conditional entropies for quantum correlations
• Quantum NETwork: from theory to practice
• Generalised entropy accumulation
• Computable Rényi mutual information: Area laws and correlations
• Continuity of quantum entropic quantities via almost convexity
• Ultimate limits for quickest quantum change-point detection
• Bounding the forward classical capacity of bipartite quantum channels
• Test-measured Rényi divergences
• Monotonic multi-state quantum $f$-divergences
• Some continuity properties of quantum Rényi divergences
• Parallelization of Adaptive Quantum Channel Discrimination in the Non-Asymptotic Regime
• A hierarchy of efficient bounds on quantum capacities exploiting symmetry
• Geometric relative entropies and barycentric Rényi divergences
• Quantum Network Discrimination
• Computable entanglement cost under positive partial transpose operations
• Chain rules for quantum channels
• The $\alpha \to 1$ Limit of the Sharp Quantum Rényi Divergence
• Towards the ultimate limits of quantum channel discrimination and quantum communication
• Sufficiency of Rényi divergences
• Unextendible entanglement of quantum channels
• Asymptotic Equipartition Theorems in von Neumann algebras