2021
DOI: 10.22331/q-2021-01-26-387
|View full text |Cite
|
Sign up to set email alerts
|

Defining quantum divergences via convex optimization

Abstract: We introduce a new quantum Rényi divergence Dα# for α∈(1,∞) 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 t… Show more

Help me understand this report
View preprint versions

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
31
0

Year Published

2021
2021
2024
2024

Publication Types

Select...
6
3

Relationship

1
8

Authors

Journals

citations
Cited by 27 publications
(31 citation statements)
references
References 41 publications
0
31
0
Order By: Relevance
“…( 4) could be removed and thus delivers the desirable quantum channel Stein's Lemma. As a byproduct, the exponentially strong converse property also implies the continuity of the regularized (amortized) Sandwiched Rényi channel divergence at α = 1, resolving an open question in [FF21]. These results extend and deepen our understanding of quantum channel discrimination and quantum channel divergences in the asymptotic regime.…”
Section: Main Contributionsmentioning
confidence: 54%
“…( 4) could be removed and thus delivers the desirable quantum channel Stein's Lemma. As a byproduct, the exponentially strong converse property also implies the continuity of the regularized (amortized) Sandwiched Rényi channel divergence at α = 1, resolving an open question in [FF21]. These results extend and deepen our understanding of quantum channel discrimination and quantum channel divergences in the asymptotic regime.…”
Section: Main Contributionsmentioning
confidence: 54%
“…The following proof resembles a proof from [17], where analogous relations are given for I opt α (A : B) (see (33)), which even show that Theorem 5 can be extended to I opt ∞ (A : B) as they hold for all α. We start with the sandwiched Rényi divergence and use the Schmidt decomposition…”
Section: C4 Proof Of Theoremmentioning
confidence: 68%
“…These are measures of distinguishability of quantum states, which play a pivotal role in information-theoretic tasks, such as single-shot communication protocols [18,19], channel coding [20][21][22][23][24][25] or hypothesis testing [26,27]. In principle, each of the many variants of quantum Rényi divergences [20,[28][29][30][31][32][33] allows us to define a mutual information as we explain in Appendix A. Here, we focus on two particular cases and explain how to compute them in practice, at least when the input state is represented via tensor networks.…”
Section: Introductionmentioning
confidence: 99%
“…We postpone this question to future work. Recently, Fawzi and Fawzi used the Kubo-Ando geometric to define new quantum Rényi divergences in terms of a convex optimization program and proved that they satisfy the data processing inequality [43]. It would be interesting to use the non-commutative L p ω spaces to rewrite their expressions as (p, ω)-norms and explore their potential multi-state generalizations.…”
Section: Discussionmentioning
confidence: 99%