Seguir
Robin Kothari
Robin Kothari
Staff Research Scientist, Google Quantum AI
Dirección de correo verificada de robinkothari.com - Página principal
Título
Citado por
Citado por
Año
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
8532015
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
7652017
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
542*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
430*2017
Quantum algorithm for simulating real time evolution of lattice Hamiltonians
J Haah, MB Hastings, R Kothari, GH Low
SIAM Journal on Computing 52 (6), FOCS18-250-FOCS18-284, 2021
2142021
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
1032016
Simulating sparse Hamiltonians with star decompositions
AM Childs, R Kothari
Theory of Quantum Computation, Communication, and Cryptography: 5th …, 2011
962011
Learning quantum Hamiltonians from high-temperature Gibbs states and real-time evolutions
J Haah, R Kothari, E Tang
Nature Physics, 1-5, 2024
94*2024
Limitations on the simulation of non-sparse Hamiltonians
AM Childs, R Kothari
Quantum Information & Computation 10 (7), 669-684, 2009
872009
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
812019
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
812018
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
76*2021
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
68*2013
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
642008
Exponential quantum speedup in simulating coupled classical oscillators
R Babbush, DW Berry, R Kothari, RD Somma, N Wiebe
Physical Review X 13 (4), 041041, 2023
622023
An optimal quantum algorithm for the oracle identification problem
R Kothari
Proceedings of the 31st International Symposium on Theoretical Aspects of …, 2013
612013
Efficient algorithms in quantum query complexity
R Kothari
University of Waterloo, 2014
602014
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
572013
Quantum query complexity of minor-closed graph properties
AM Childs, R Kothari
SIAM Journal on Computing 41 (6), 1426-1450, 2012
492012
Query-optimal estimation of unitary channels in diamond distance
J Haah, R Kothari, R O’Donnell, E Tang
2023 IEEE 64th Annual Symposium on Foundations of Computer Science (FOCS …, 2023
382023
El sistema no puede realizar la operación en estos momentos. Inténtalo de nuevo más tarde.
Artículos 1–20