Robin Kothari
Robin Kothari
Senior Researcher, Microsoft Quantum and Microsoft Research
Verified email at - Homepage
Cited by
Cited by
Simulating Hamiltonian dynamics with a truncated Taylor series
DW Berry, AM Childs, R Cleve, R Kothari, RD Somma
Physical review letters 114 (9), 090502, 2015
Quantum algorithm for systems of linear equations with exponentially improved dependence on precision
AM Childs, R Kothari, RD Somma
SIAM Journal on Computing 46 (6), 1920-1950, 2017
Exponential improvement in precision for simulating sparse Hamiltonians
DW Berry, AM Childs, R Cleve, R Kothari, RD Somma
Forum of Mathematics, Sigma 5, 2017
Hamiltonian simulation with nearly optimal dependence on all parameters
DW Berry, AM Childs, R Kothari
2015 IEEE 56th Annual Symposium on Foundations of Computer Science, 792-809, 2015
Simulating sparse Hamiltonians with star decompositions
AM Childs, R Kothari
Conference on Quantum Computation, Communication, and Cryptography, 94-103, 2010
Separations in query complexity using cheat sheets
S Aaronson, S Ben-David, R Kothari
Proceedings of the forty-eighth annual ACM symposium on Theory of Computing …, 2016
Dissipation in circuit quantum electrodynamics: lasing and cooling of a low-frequency oscillator
J Hauss, A Fedorov, S André, V Brosco, C Hutter, R Kothari, S Yeshwanth, ...
New Journal of Physics 10 (9), 095018, 2008
Quantum algorithm for simulating real time evolution of lattice Hamiltonians
J Haah, MB Hastings, R Kothari, GH Low
SIAM Journal on Computing, FOCS18-250-FOCS18-284, 2021
Limitations on the simulation of non-sparse Hamiltonians
AM Childs, R Kothari
Quantum Information & Computation 10 (7), 669-684, 2009
Time-efficient quantum walks for 3-distinctness
A Belovs, AM Childs, S Jeffery, R Kothari, F Magniez
International Colloquium on Automata, Languages, and Programming, 105-122, 2013
Quantum query complexity of minor-closed graph properties
AM Childs, R Kothari
SIAM Journal on Computing 41 (6), 1426-1450, 2012
The polynomial method strikes back: Tight quantum query bounds via dual polynomials
M Bun, R Kothari, J Thaler
Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing …, 2018
Nested quantum walks with quantum data structures
S Jeffery, R Kothari, F Magniez
Proceedings of the twenty-fourth annual ACM-SIAM symposium on Discrete …, 2013
An optimal quantum algorithm for the oracle identification problem
R Kothari
Proceedings of the 31st International Symposium on Theoretical Aspects of …, 2013
Nearly optimal separations between communication (or query) complexity and partitions
A Ambainis, M Kokainis, R Kothari
31st Conference on Computational Complexity (CCC 2016), Leibniz …, 2015
Exponential separation between shallow quantum circuits and unbounded fan-in shallow classical circuits
AB Watts, R Kothari, L Schaeffer, A Tal
Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing …, 2019
Separations in communication complexity using cheat sheets and information complexity
A Anshu, A Belovs, S Ben-David, M Göös, R Jain, R Kothari, T Lee, ...
2016 IEEE 57th Annual Symposium on Foundations of Computer Science (FOCS …, 2016
Efficient algorithms in quantum query complexity
R Kothari
University of Waterloo, 2014
Randomized Query Complexity of Sabotaged and Composed Functions
S Ben-David, R Kothari
43rd International Colloquium on Automata, Languages, and Programming (ICALP …, 2016
Improving quantum query complexity of Boolean matrix multiplication using graph collision
S Jeffery, R Kothari, F Le Gall, F Magniez
Algorithmica 76 (1), 1-16, 2016
The system can't perform the operation now. Try again later.
Articles 1–20