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

Giulia Mazzola

dblp:414/6735 · DBLP profile ↗
← Back
1ranked-venue papers
1as first author
1since 2021 · last 2025
0000-0002-0963-5518ORCID · reported

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

Theory 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 · 100%

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

TopicWeightPapersLastEvidence papers
Quantum computing and quantum information
quantum information theory
0.912025
Uhlmann's Theorem for Relative Entropies · IEEE Trans. Inf. Theory 2025
Quantum computing and quantum information › quantum information theory
quantum relative entropy
0.912025
Uhlmann's Theorem for Relative Entropies · IEEE Trans. Inf. Theory 2025
YearPublicationVenuePosition
2025 Uhlmann's Theorem for Relative Entropies
abstract
Uhlmann’s theorem states that, for any two quantum states ρABand σA, there exists an extension σABof σAsuch that the fidelity between ρABand σABequals the fidelity between their reduced states ρAand σA. In this work, we generalize Uhlmann’s theorem to α-R´enyi relative entropies for α ∈ [1/2, ∞], a family of divergences that encompasses fidelity, relative entropy, and max-relative entropy corresponding to α = 1/2, α = 1, and α = ∞, respectively.
Giulia Mazzola, David Sutter, Renato Renner
IEEE Trans. Inf. Theory1