Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.

Tobias Rippchen

dblp:387/2803 · DBLP profile ↗
← Back
3ranked-venue papers
2as first author
3since 2021 · last 2025
0009-0008-8744-0514ORCID · corroborated

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

Applied, interdisciplinary, general and emerging computing · 2 · 1 first-author · 2 since 2021Theory of computation · 1 · 1 first-author · 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% Information theory · 33%

Topics — the 3 heaviest of 3, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Quantum computing and quantum information
quantum information theory
0.912025
Locally-Measured Rényi Divergences · IEEE Trans. Inf. Theory 2025
Quantum computing and quantum information › quantum measurement
quantum state discrimination
0.912025
Locally-Measured Rényi Divergences · IEEE Trans. Inf. Theory 2025
Information theory › information measures › divergence measures
rényi divergence
0.912025
Locally-Measured Rényi Divergences · IEEE Trans. Inf. Theory 2025

Methods — techniques the papers use, named apart from their topics

variational bounds · 0.9additivity · 0.9
YearPublicationVenuePosition
2025 Quantum Entropy Prover
abstract
Information inequalities govern the ultimate limitations in information theory and as such play a pivotal role in characterizing what values the entropy of multipartite states can take. Proving an information inequality, however, quickly becomes arduous when the number of involved parties increases. For classical systems, [Yeung, IEEE Trans. Inf. Theory (1997)] proposed a framework to prove Shannon-type inequalities via linear programming. Here, we derive an analogous framework for quantum systems, based on the strong sub-additivity and weak monotonicity inequalities for the von-Neumann entropy. Importantly, this also allows us to handle constrained inequalities, which - in the classical case - served as a crucial tool in proving the existence of non-standard, so-called non-Shannon-type inequalities [Zhang & Yeung, IEEE Trans. Inf. Theory (1998)]. Our main contribution is the Python package qITIP, for which we present the theory and demonstrate its capabilities with several illustrative examples.
Shao-Lun Huang, Tobias Rippchen, Mario Berta
ISIT2
2025 Locally-Measured Rényi Divergences
abstract
We propose an extension of the classical Rényi divergences to quantum states through an optimization over probability distributions induced by restricted sets of measurements. In particular, we define the notion of locally-measured Rényi divergences, where the set of allowed measurements originates from variants of locality constraints between (distant) partiesAandB. We then derive variational bounds on the locally-measured Rényi divergences and systematically discuss when these bounds become exact characterizations. As an application, we evaluate the locally-measured Rényi divergences on variants of highly symmetric data-hiding states, showcasing the reduced distinguishing power of locality-constrained measurements. For n-fold tensor powers, we further employ our variational formulae to derive corresponding additivity results, which gives the locally-measured Rényi divergences operational meaning as optimal rate exponents in asymptotic locally-measured hypothesis testing.
Tobias Rippchen, Sreejith Sreekumar, Mario Berta
IEEE Trans. Inf. Theory1
2024 Locally-Measured Rényi Divergences
abstract
We propose an extension of the classical Rényi divergences to quantum states through an optimization over probability distributions induced by restricted sets of measurements. In particular, we define the notion of locally-measured Rényi divergences, where the set of allowed measurements orig-inates from locality constraints between (distant) parties$A$and$B$. As our main result, we derive variational characterizations of these locally-measured Rényi divergences. We then evaluate them for variants of data-hiding states, showcasing the reduced distinguishing power of locality-constrained measurements, and give corresponding applications in locally-measured hypothesis testing.
Tobias Rippchen, Sreejith Sreekumar, Mario Berta
ISIT1