Weak quasi-factorization for the Belavkin-Staszewski relative entropy
Research output: Chapter in Book/Report/Conference proceeding › Article in proceedings › Research › peer-review
Standard
Weak quasi-factorization for the Belavkin-Staszewski relative entropy. / Bluhm, Andreas; Capel, Ángela; Pérez-Hernández, Antonio.
2021 IEEE International Symposium on Information Theory (ISIT). IEEE, 2021. p. 118-123.Research output: Chapter in Book/Report/Conference proceeding › Article in proceedings › Research › peer-review
Harvard
APA
Vancouver
Author
Bibtex
}
RIS
TY - GEN
T1 - Weak quasi-factorization for the Belavkin-Staszewski relative entropy
AU - Bluhm, Andreas
AU - Capel, Ángela
AU - Pérez-Hernández, Antonio
N1 - preprint
PY - 2021
Y1 - 2021
N2 - Quasi-factorization-type inequalities for the relative entropy have recently proven to be fundamental in modern proofs of modified logarithmic Sobolev inequalities for quantum spin systems. In this paper, we show some results of weak quasi-factorization for the Belavkin-Staszewski relative entropy, i.e. upper bounds for the BS-entropy between two bipartite states in terms of the sum of two conditional BS-entropies, up to some multiplicative and additive factors.
AB - Quasi-factorization-type inequalities for the relative entropy have recently proven to be fundamental in modern proofs of modified logarithmic Sobolev inequalities for quantum spin systems. In this paper, we show some results of weak quasi-factorization for the Belavkin-Staszewski relative entropy, i.e. upper bounds for the BS-entropy between two bipartite states in terms of the sum of two conditional BS-entropies, up to some multiplicative and additive factors.
KW - math-ph
KW - math.MP
KW - quant-ph
M3 - Article in proceedings
SP - 118
EP - 123
BT - 2021 IEEE International Symposium on Information Theory (ISIT)
PB - IEEE
T2 - 2021 IEEE International Symposium on Information Theory
Y2 - 12 July 2021 through 20 July 2021
ER -
ID: 289464599