EDBT 2026 Demo / reviewers in the wild / expert
Senrui Chen
dblp:296/6460
· DBLP profile ↗
1ranked-venue papers
1as first author
1since 2021 · last 2026
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Artificial intelligence and machine learning · 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
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Information theory › information measures
fisher information |
1.0 | 1 | 2026 | Instance-optimal high-precision shadow tomography with few-copy measurements: A metrological approach · COLT 2026 |
Quantum computing and quantum information
quantum learning |
1.0 | 1 | 2026 | Instance-optimal high-precision shadow tomography with few-copy measurements: A metrological approach · COLT 2026 |
Quantum computing and quantum information › quantum state tomography
shadow tomography |
1.0 | 1 | 2026 | Instance-optimal high-precision shadow tomography with few-copy measurements: A metrological approach · COLT 2026 |
Methods — techniques the papers use, named apart from their topics
sample complexity analysis · 1.0metrological approach · 1.0
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2026 | Instance-optimal high-precision shadow tomography with few-copy measurements: A metrological approachabstractWe give the first instance-optimal sample complexity bounds for shadow tomography using few-copy measurements in the high-precision regime. More concretely, we study the problem of learning expectation values of a given set of observables of an unknown quantum state to precision $\epsilon$ in $L_p$-norm, using (possibly adaptive) measurements that act on one or a few copies at a time, and we are interested in the regime that $\epsilon$ is below some concrete and potentially dimension-dependent threshold. In this setup, we prove the necessary and sufficient number of copies, for any given set of observables, is characterized by a simple optimization formula involving a quadratic form of the inverse Fisher information matrix up to a logarithmic factor. Our results establish a rigorous correspondence between quantum learning and quantum metrology. Senrui Chen, Weiyuan Gong |
COLT | 1 |