Andreas Bluhm

dblp:203/8412 · DBLP profile ↗
← Back
4ranked-venue papers
4as first author
4since 2021 · last 2024
0000-0003-4796-7633ORCID · verified

Domains — the database's venue-derived domains; a paper can count in several

Theory of computation · 2 · 2 first-author · 2 since 2021Applied, interdisciplinary, general and emerging computing · 2 · 2 first-author · 2 since 2021
YearPublicationVenuePosition
2024 Corrections to "Continuity of Quantum Entropic Quantities via Almost Convexity"
abstract
This note is intended to address some inaccuracies in [1]. In Lemma 5.8, eq. (52) of this paper, we originally derived the following erroneous inequality:.
Andreas Bluhm, Angela Capel, Paul Gondolf, Antonio Pérez-Hernández
IEEE Trans. Inf. Theory1
2023 General Continuity Bounds for Quantum Relative Entropies
abstract
In this article, we generalize a proof technique by Alicki, Fannes and Winter and introduce a method to prove continuity bounds for entropic quantities derived from different quantum relative entropies. For the Umegaki relative entropy, we mostly recover known almost optimal bounds, whereas, for the Belavkin-Staszewski relative entropy, our bounds are new. Finally, we use these continuity bounds to derive a new entropic uncertainty relation. This is a short version of [1].
Andreas Bluhm, Angela Capel, Paul Gondolf, Antonio Pérez-Hernández
ISIT1
2023 Continuity of Quantum Entropic Quantities via Almost Convexity
abstract
Based on the proofs of the continuity of the conditional entropy by Alicki, Fannes, and Winter, we introduce in this work the almost locally affine (ALAFF) method. This method allows us to prove a great variety of continuity bounds for the derived entropic quantities. First, we apply the ALAFF method to the Umegaki relative entropy. This way, we recover known almost tight bounds, but also some new continuity bounds for the relative entropy. Subsequently, we apply our method to the Belavkin-Staszewski relative entropy (BS-entropy). This yields novel explicit bounds in particular for the BS-conditional entropy, the BS-mutual and BS-conditional mutual information. On the way, we prove almost concavity for the Umegaki relative entropy and the BS-entropy, which might be of independent interest. We conclude by showing some applications of these continuity bounds in various contexts within quantum information theory.
Andreas Bluhm, Angela Capel, Paul Gondolf, Antonio Pérez-Hernández
IEEE Trans. Inf. Theory1
2021 Weak Quasi-Factorization for the Belavkin-Staszewski Relative Entropy
abstract
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. A more detailed version of this paper is accessible at: https://arxiv.org/pdf/2101.10312.pdf
Andreas Bluhm, Angela Capel, Zentrum Mathematik, Antonio Pérez-Hernández
ISIT1