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.
? Tutorial for this page

Anna Vershynina

dblp:76/9375 · DBLP profile ↗
← Back
1ranked-venue papers
0as first author
0since 2021 · last 2018
0000-0001-5108-1531ORCID · reported

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

Theory of computation · 1

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
Information theory · 54% Quantum computing and quantum information · 23% Algorithmic game theory and mechanism design · 23%

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

TopicWeightPapersLastEvidence papers
Information theory › information measures
data processing inequality
0.312018
Recovery and the Data Processing Inequality for Quasi-Entropies · IEEE Trans. Inf. Theory 2018
Information theory › information measures › divergence measures
kullback-leibler divergence
0.312018
Recovery and the Data Processing Inequality for Quasi-Entropies · IEEE Trans. Inf. Theory 2018
Algorithmic game theory and mechanism design › social choice
monotonicity
0.312018
Recovery and the Data Processing Inequality for Quasi-Entropies · IEEE Trans. Inf. Theory 2018
Quantum computing and quantum information
quantum information theory
0.312018
Recovery and the Data Processing Inequality for Quasi-Entropies · IEEE Trans. Inf. Theory 2018
Information theory › information measures
information inequalities
0.112018
Recovery and the Data Processing Inequality for Quasi-Entropies · IEEE Trans. Inf. Theory 2018

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

von neumann algebra · 0.3petz recovery map · 0.3operator monotone function · 0.3
YearPublicationVenuePosition
2018 Recovery and the Data Processing Inequality for Quasi-Entropies
abstract
We prove a number of quantitative stability bounds for the cases of equality in Petz's monotonicity theorem for quasi-relative entropies Sf(p||σ) defined in terms of an operator monotone decreasing functions f and, in particular, the Rényi relative entropies. Included in our results are bounds in terms of the Petz recovery map, but we obtain more general results. The present treatment is entirely elementary and developed in the context of finite dimensional von Neumann algebras, where the results are already non-trivial and of interest in quantum information theory.
Eric A. Carlen, Anna Vershynina
IEEE Trans. Inf. Theory2