Robin Kothari
where else to find them
no profile links on file
what they talk about
where they keep going back
no series more than once — all 3 in the filters
on a stage with
- Ankit Gargonce
- Praneeth Netrapallionce
- Suhail Sherifonce
who talks about the same things
nobody close enough yet
| title | conference | date |
|---|---|---|
| How Simulating Balls and Springs Captures the Power of Quantum Computing | Quantum Summer Cluster Workshop 2023 | 2023-07-10 |
Defines a classical decision problem: predict one coordinate of the time evolution of 2^n coupled oscillators where inputs are given by a succinct circuit… | ||
| No Quantum Speedup Over Gradient Descent for Non-Smooth Convex Optimization | Quantum Wave in Computing Reunion 2021 | 2021-07-15 |
Claim: in the standard first-order black-box model for constrained non-smooth convex optimization, quantum algorithms need the same Theta((GR/ε)^2) oracle… | ||
| No quantum speedup over gradient descent for non-smooth convex optimization | ITCS 2021 | 2021-01-06 |
Proves that quantum algorithms give no asymptotic advantage for non‑smooth 1‑Lipschitz convex optimization in high dimension by showing a matching 1/epsilon^2… | ||
| nothing matches | ||