| Publication | Date of Publication | Type |
|---|
| Optimal tradeoffs for estimating Pauli observables | 2026-06-23 | Paper |
The log log jam in Gaussian state tomography
(available as arXiv preprint) | 2026-01-01 | Paper |
Finding Gaussian Structure in Bosonic States
(available as arXiv preprint) | 2026-01-01 | Paper |
| When does adaptivity help for quantum state learning? | 2025-08-15 | Paper |
| Tight bounds for quantum state certification with incoherent measurements | 2025-08-15 | Paper |
| Learning deep ReLu networks is fixed-parameter tractable | 2025-08-13 | Paper |
| Online and distribution-free robustness: regression and contextual bandits with Huber contamination | 2025-08-13 | Paper |
| Exponential separations between learning with and without quantum memory | 2025-08-13 | Paper |
| Entanglement is necessary for optimal quantum property testing | 2025-08-12 | Paper |
A Provably Efficient Method for Tensor Ring Decomposition and Its Applications
(available as arXiv preprint) | 2025-01-01 | Paper |
| Learning polynomial transformations via generalized tensor decompositions | 2024-05-08 | Paper |
scientific article; zbMATH DE number 7829278 (Why is no real title available?)
(available as arXiv preprint) | 2024-04-09 | Paper |
Kalman filtering with adversarial corruptions
Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing | 2023-12-08 | Paper |
Quantum advantage in learning from experiments
Science | 2023-11-24 | Paper |
Algorithmic foundations for the diffraction limit
Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing | 2023-11-14 | Paper |
Learning mixtures of linear regressions in subexponential time via Fourier moments
Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing | 2021-01-19 | Paper |
Efficiently learning structured distributions from untrusted batches
Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing | 2021-01-19 | Paper |
Beyond the low-degree algorithm: mixtures of subcubes and their applications
Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing | 2020-01-30 | Paper |
Improved bounds for randomly sampling colorings via linear programming
Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms | 2019-10-15 | Paper |
| Linear Programming Bounds for Randomly Sampling Colorings | 2018-04-09 | Paper |
Linear Programming Bounds for Randomly Sampling Colorings
(available as arXiv preprint) | 2018-01-01 | Paper |
Basis collapse for holographic algorithms over all domain sizes
Proceedings of the forty-eighth annual ACM symposium on Theory of Computing | 2017-09-29 | Paper |
| Cellular Automata to More Efficiently Compute the Collatz Map | 2013-01-14 | Paper |
Cellular Automata to More Efficiently Compute the Collatz Map
(available as arXiv preprint) | 2013-01-01 | Paper |
| On the Rank Number of Grid Graphs | 2012-08-09 | Paper |
On the Rank Number of Grid Graphs
(available as arXiv preprint) | 2012-01-01 | Paper |
