Demo Data from EDBT 2026 / reviewers in the wild / expert
Naixu Guo
dblp:298/0924
· DBLP profile ↗
1ranked-venue papers
0as first author
1since 2021 · last 2025
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Artificial intelligence and machine learning · 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 · 100% |
Topics — the 2 heaviest of 2, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Quantum computing and quantum information › quantum state learning
online learning of quantum states |
0.9 | 1 | 2025 | Online Learning of Pure States is as Hard as Mixed States · NeurIPS 2025 |
Quantum computing and quantum information
quantum state tomography |
0.9 | 1 | 2025 | Online Learning of Pure States is as Hard as Mixed States · NeurIPS 2025 |
Methods — techniques the papers use, named apart from their topics
smoothed analysis · 0.9sequential fat-shattering dimension · 0.9regret analysis · 0.9
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2025 | Online Learning of Pure States is as Hard as Mixed StatesabstractQuantum state tomography, the task of learning an unknown quantum state, is a fundamental problem in quantum information. In standard settings, the complexity of this problem depends significantly on the type of quantum state that one is trying to learn, with pure states being substantially easier to learn than general mixed states. A natural question is whether this separation holds for any quantum state learning setting. In this work, we consider the online learning framework and prove the surprising result that learning pure states in this setting is as hard as learning mixed states. More specifically, we show that both classes share almost the same sequential fat-shattering dimension, leading to identical regret scaling. We also generalize previous results on full quantum state tomography in the online setting to (i) the $\epsilon$-realizable setting and (ii) learning the density matrix only partially, using smoothed analysis. Maxime Meyer, Soumik Adhikary, Naixu Guo, Patrick Rebentrost |
NeurIPS | 3 |