EDBT 2026 Demo / reviewers in the wild / expert
Gereon Koßmann
dblp:391/7044
· DBLP profile ↗
2ranked-venue papers
1as first author
2since 2021 · last 2026
0009-0001-7912-2347ORCID · corroborated
Domains — the database's venue-derived domains; a paper can count in several
Theory of computation · 1 · 1 first-author · 1 since 2021Applied, interdisciplinary, general and emerging computing · 1 · 1 since 2021
Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.
| Theoretical computer science
1 paper |
Quantum computing and quantum information · 67% Mathematical optimization · 33% |
Topics — the 3 heaviest of 3, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Quantum computing and quantum information
quantum information theory |
1.0 | 1 | 2026 | Semidefinite Optimization of the Quantum Relative Entropy of Channels · IEEE Trans. Inf. Theory 2026 |
Quantum computing and quantum information › quantum information theory
quantum relative entropy |
1.0 | 1 | 2026 | Semidefinite Optimization of the Quantum Relative Entropy of Channels · IEEE Trans. Inf. Theory 2026 |
Mathematical optimization
semidefinite programming |
1.0 | 1 | 2026 | Semidefinite Optimization of the Quantum Relative Entropy of Channels · IEEE Trans. Inf. Theory 2026 |
Methods — techniques the papers use, named apart from their topics
semidefinite programming · 1.0discretized linearization · 1.0
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2026 | A Collection of Pinsker-type Inequalities for Quantum DivergencesabstractPinsker's inequality sets a lower bound on the Umegaki divergence of two quantum states in terms of their trace distance. In this work, we formulate corresponding estimates for a variety of quantum and classical divergences including $f$-divergences like Hellinger and $χ^2$-divergences as well as Rényi divergences and special cases thereof like the Umegaki divergence, collision divergence, max divergence. We further provide a strategy on how to adapt these bounds to smoothed divergences. Kläre Wienecke, Gereon Koßmann, René Schwonnek |
ISIT | 2 |
| 2026 | Semidefinite Optimization of the Quantum Relative Entropy of ChannelsabstractThis paper introduces a method for calculating the quantum relative entropy of channels, an essential quantity in quantum channel discrimination and resource theories of quantum channels. By building on recent developments in the optimization of relative entropy for quantum states [Koßmann and Schwonnek, arXiv:2404.17016], we introduce a discretized linearization of the integral representation for the relative entropy of states, enabling us to handle maximization tasks for the relative entropy of channels. Our approach here extends previous work on minimizing relative entropy to the more complicated domain of maximization. It also provides efficiently computable upper and lower bounds that sandwich the true value with any desired precision, leading to a practical method for computing the relative entropy of channels. Gereon Koßmann, Mark M. Wilde |
IEEE Trans. Inf. Theory | 1 |