Robin Kothari

From MaRDI portal
Person:334913

Available identifiers

zbMath Open kothari.robinDBLP77/8774WikidataQ59488273 ScholiaQ59488273MaRDI QIDQ334913

List of research outcomes





PublicationDate of PublicationType
Quantum Algorithm for Simulating Real Time Evolution of Lattice Hamiltonians2023-12-19Paper
Degree vs. approximate degree and Quantum implications of Huang’s sensitivity theorem2023-11-14Paper
https://portal.mardi4nfdi.de/entity/Q60621522023-10-31Paper
https://portal.mardi4nfdi.de/entity/Q58743952023-02-07Paper
Mean estimation when you have the source code; or, quantum Monte Carlo methods2022-08-16Paper
Quantum lower bounds for approximate counting via Laurent polynomials2022-07-21Paper
Quantum distinguishing complexity, zero-error algorithms, and statistical zero knowledge2022-07-18Paper
Quantum algorithm for simulating real time evolution of lattice Hamiltonians2021-02-08Paper
The polynomial method strikes back: tight quantum query bounds via dual polynomials2020-12-17Paper
https://portal.mardi4nfdi.de/entity/Q51111542020-05-26Paper
Exponential separation between shallow quantum circuits and unbounded fan-in shallow classical circuits2020-01-30Paper
Quantum algorithms and approximating polynomials for composed functions with shared inputs2019-10-15Paper
The polynomial method strikes back: tight quantum query bounds via dual polynomials2019-08-22Paper
Nested Quantum Walks with Quantum Data Structures2019-05-15Paper
https://portal.mardi4nfdi.de/entity/Q45779132018-08-06Paper
Quantum algorithm for systems of linear equations with exponentially improved dependence on precision2018-01-10Paper
Randomized query complexity of sabotaged and composed functions2017-12-19Paper
Nearly optimal separations between communication (or query) complexity and partitions2017-10-10Paper
Separations in query complexity using cheat sheets2017-09-29Paper
Separating decision tree complexity from subcube partition complexity2017-08-31Paper
Exponential improvement in precision for simulating sparse Hamiltonians2017-04-04Paper
An optimal quantum algorithm for the oracle identification problem2017-03-03Paper
https://portal.mardi4nfdi.de/entity/Q29584092017-02-01Paper
Dequantizing read-once quantum formulas2017-02-01Paper
Improving quantum query complexity of Boolean matrix multiplication using graph collision2016-11-01Paper
Exponential improvement in precision for simulating sparse Hamiltonians2015-06-26Paper
Improving quantum query complexity of Boolean matrix multiplication using graph collision2013-08-12Paper
Time-efficient quantum walks for 3-distinctness2013-08-06Paper
Quantum query complexity of minor-closed graph properties2013-03-19Paper
The quantum query complexity of read-many formulas2012-09-25Paper
Quantum query complexity of minor-closed graph properties2012-01-23Paper
Limitations on the simulation of non-sparse Hamiltonians2011-10-05Paper
Simulating Sparse Hamiltonians with Star Decompositions2011-01-28Paper

Research outcomes over time

This page was built for person: Robin Kothari