Defining quantum divergences via convex optimization - INRIA - Institut National de Recherche en Informatique et en Automatique Accéder directement au contenu
Article Dans Une Revue Quantum Année : 2021

Defining quantum divergences via convex optimization

Résumé

We introduce a new quantum R\'enyi 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\'enyi 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\'enyi divergence between quantum channels for $\alpha > 1$. Second it allows us to prove a chain rule property for the sandwiched $\alpha$-R\'enyi 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.
Fichier principal
Vignette du fichier
renyi_divergence.pdf (700.41 Ko) Télécharger le fichier
Origine : Publication financée par une institution

Dates et versions

hal-03110737 , version 1 (03-02-2021)

Licence

Paternité

Identifiants

Citer

Hamza Fawzi, Omar Fawzi. Defining quantum divergences via convex optimization. Quantum, 2021, 5, pp.1-26. ⟨10.22331/q-2021-01-26-387⟩. ⟨hal-03110737⟩
64 Consultations
143 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More