| 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 | 563 | 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 | 435 | 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 | 344 | 2015 |
| Exponential improvement in precision for simulating sparse Hamiltonians DW Berry, AM Childs, R Cleve, R Kothari, RD Somma Forum of Mathematics, Sigma 5, 2017 | 291* | 2017 |
| 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 | 113 | 2021 |
| 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 | 82 | 2016 |
| Simulating sparse Hamiltonians with star decompositions AM Childs, R Kothari Theory of Quantum Computation, Communication, and Cryptography: 5th …, 2011 | 82 | 2011 |
| Limitations on the simulation of non-sparse Hamiltonians AM Childs, R Kothari Quantum Information & Computation 10 (7), 669-684, 2009 | 67 | 2009 |
| 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 | 63 | 2018 |
| 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 | 62 | 2008 |
| Time-efficient quantum walks for 3-distinctness A Belovs, AM Childs, S Jeffery, R Kothari, F Magniez Automata, Languages, and Programming: 40th International Colloquium, ICALP …, 2013 | 59* | 2013 |
| Efficient algorithms in quantum query complexity R Kothari University of Waterloo, 2014 | 48 | 2014 |
| An optimal quantum algorithm for the oracle identification problem R Kothari Proceedings of the 31st International Symposium on Theoretical Aspects of …, 2013 | 48 | 2013 |
| 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 | 45 | 2019 |
| 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 | 44 | 2013 |
| Quantum query complexity of minor-closed graph properties AM Childs, R Kothari SIAM Journal on Computing 41 (6), 1426-1450, 2012 | 42 | 2012 |
| Degree vs. approximate degree and quantum implications of Huang’s sensitivity theorem S Aaronson, S Ben-David, R Kothari, S Rao, A Tal Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing …, 2021 | 33* | 2021 |
| 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 | 30* | 2015 |
| Randomized Query Complexity of Sabotaged and Composed Functions S Ben-David, R Kothari 43rd International Colloquium on Automata, Languages, and Programming (ICALP …, 2016 | 25 | 2016 |
| 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 | 24 | 2016 |
Andrew M. ChildsJoint Center for Quantum Information and Computer Science, University of MarylandVerified email at umd.edu
