| 2026 | SODA | Quantum State Preparation with Optimal T-Count. | David Gosset, Robin Kothari, Kewen Wu |
| 2026 | STOC | No Exponential Quantum Speedup for SIS∞ Anymore. | Robin Kothari, Ryan O'Donnell, Kewen Wu |
| 2025 | SODA | Triply efficient shadow tomography. | Robbie King, David Gosset, Robin Kothari, Ryan Babbush |
| 2025 | SODA | Quartic quantum speedups for planted inference. | Alexander Schmidhuber, Ryan O'Donnell, Robin Kothari, Ryan Babbush |
| 2023 | FOCS | Exponential quantum speedup in simulating coupled classical oscillators | Ryan Babbush, Dominic W. Berry, Robin Kothari, Rolando D. Somma, Nathan Wiebe |
| 2023 | FOCS | Query-optimal estimation of unitary channels in diamond distance. | Jeongwan Haah, Robin Kothari, Ryan O'Donnell, Ewin Tang |
| 2023 | SODA | Mean estimation when you have the source code; or, quantum Monte Carlo methods. | Robin Kothari, Ryan O'Donnell |
| 2022 | FOCS | Optimal learning of quantum Hamiltonians from high-temperature Gibbs states. | Jeongwan Haah, Robin Kothari, Ewin Tang |
| 2021 | FOCS | Unambiguous DNFs and Alon-Saks-Seymour. | Kaspars Balodis, Shalev Ben-David, Mika Gs, Siddhartha Jain, Robin Kothari |
| 2021 | ICML | Quantum algorithms for reinforcement learning with a generative model. | Daochen Wang, Aarthi Sundaram, Robin Kothari, Ashish Kapoor, Martin Roetteler |
| 2021 | STOC | Degree vs. approximate degree and Quantum implications of Huang's sensitivity theorem. | Scott Aaronson, Shalev Ben-David, Robin Kothari, Shravas Rao, Avishay Tal |
| 2019 | SODA | Quantum algorithms and approximating polynomials for composed functions with shared inputs. | Mark Bun, Robin Kothari, Justin Thaler |
| 2019 | STOC | Exponential separation between shallow quantum circuits and unbounded fan-in shallow classical circuits. | Adam Bene Watts, Robin Kothari, Luke Schaeffer, Avishay Tal |
| 2018 | FOCS | Classical Lower Bounds from Quantum Upper Bounds. | Shalev Ben-David, Adam Bouland, Ankit Garg, Robin Kothari |
| 2018 | FOCS | Quantum Algorithm for Simulating Real Time Evolution of Lattice Hamiltonians. | Jeongwan Haah, Matthew B. Hastings, Robin Kothari, Guang Hao Low |
| 2018 | STOC | The polynomial method strikes back: tight quantum query bounds via dual polynomials. | Mark Bun, Robin Kothari, Justin Thaler |
| 2016 | FOCS | Separations in Communication Complexity Using Cheat Sheets and Information Complexity. | Anurag Anshu, Aleksandrs Belovs, Shalev Ben-David, Mika Gs, Rahul Jain, Robin Kothari, Troy Lee, Miklos Santha |
| 2016 | ICALP | Randomized Query Complexity of Sabotaged and Composed Functions. | Shalev Ben-David, Robin Kothari |
| 2016 | STOC | Separations in query complexity using cheat sheets. | Scott Aaronson, Shalev Ben-David, Robin Kothari |
| 2015 | FOCS | Hamiltonian Simulation with Nearly Optimal Dependence on all Parameters. | Dominic W. Berry, Andrew M. Childs, Robin Kothari |
| 2014 | STOC | Exponential improvement in precision for simulating sparse Hamiltonians. | Dominic W. Berry, Andrew M. Childs, Richard Cleve, Robin Kothari, Rolando D. Somma |
| 2014 | STACS | An optimal quantum algorithm for the oracle identification problem. | Robin Kothari |
| 2013 | ICALP | Time-Efficient Quantum Walks for 3-Distinctness. | Aleksandrs Belovs, Andrew M. Childs, Stacey Jeffery, Robin Kothari, Frdric Magniez |
| 2013 | SODA | Nested Quantum Walks with Quantum Data Structures. | Stacey Jeffery, Robin Kothari, Frdric Magniez |
| 2012 | ESA | The Quantum Query Complexity of Read-Many Formulas. | Andrew M. Childs, Shelby Kimmel, Robin Kothari |
| 2012 | ICALP | Improving Quantum Query Complexity of Boolean Matrix Multiplication Using Graph Collision. | Stacey Jeffery, Robin Kothari, Frdric Magniez |
| 2011 | STACS | Quantum query complexity of minor-closed graph properties. | Andrew M. Childs, Robin Kothari |