default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDRobin Kothari
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2025
[c37]Alexander Schmidhuber, Ryan O'Donnell, Robin Kothari, Ryan Babbush:
Quartic quantum speedups for planted inference. SODA 2025: 905-913- [c36]Robbie King, David Gosset, Robin Kothari, Ryan Babbush:
Triply efficient shadow tomography. SODA 2025: 914-946 - 2024
- [i42]Alexander Schmidhuber, Ryan O'Donnell, Robin Kothari, Ryan Babbush:
Quartic quantum speedups for planted inference. CoRR abs/2406.19378 (2024) - [i41]Clément L. Canonne, Robin Kothari, Ryan O'Donnell:
Uniformity testing when you have the source code. CoRR abs/2411.04972 (2024) - 2023
- [j8]Jeongwan Haah
, Matthew B. Hastings, Robin Kothari, Guang Hao Low:
Quantum Algorithm for Simulating Real Time Evolution of Lattice Hamiltonians. SIAM J. Comput. 52(6): S18-250 (2023) - [c35]Jeongwan Haah, Robin Kothari, Ryan O'Donnell, Ewin Tang:
Query-optimal estimation of unitary channels in diamond distance. FOCS 2023: 363-390 - [c34]Ryan Babbush, Dominic W. Berry, Robin Kothari, Rolando D. Somma, Nathan Wiebe:
Exponential quantum speedup in simulating coupled classical oscillators*. FOCS 2023: 405-414 - [c33]Robin Kothari, Ryan O'Donnell:
Mean estimation when you have the source code; or, quantum Monte Carlo methods. SODA 2023: 1186-1215 - [i40]Jeongwan Haah, Robin Kothari, Ryan O'Donnell, Ewin Tang:
Query-optimal estimation of unitary channels in diamond distance. CoRR abs/2302.14066 (2023) - 2022
- [c32]Jeongwan Haah, Robin Kothari, Ewin Tang:
Optimal learning of quantum Hamiltonians from high-temperature Gibbs states. FOCS 2022: 135-146 - [i39]Robin Kothari, Ryan O'Donnell:
Mean estimation when you have the source code; or, quantum Monte Carlo methods. CoRR abs/2208.07544 (2022) - [i38]Andrew M. Childs, Robin Kothari, Matt Kovacs-Deak, Aarthi Sundaram, Daochen Wang:
Quantum divide and conquer. CoRR abs/2210.06419 (2022) - 2021
- [j7]Mark Bun, Robin Kothari, Justin Thaler:
Quantum algorithms and approximating polynomials for composed functions with shared inputs. Quantum 5: 543 (2021) - [c31]Kaspars Balodis, Shalev Ben-David, Mika Göös, Siddhartha Jain, Robin Kothari:
Unambiguous DNFs and Alon-Saks-Seymour. FOCS 2021: 116-124 - [c30]Daochen Wang, Aarthi Sundaram, Robin Kothari, Ashish Kapoor, Martin Roetteler:
Quantum algorithms for reinforcement learning with a generative model. ICML 2021: 10916-10926 - [c29]Ankit Garg, Robin Kothari, Praneeth Netrapalli, Suhail Sherif:
No Quantum Speedup over Gradient Descent for Non-Smooth Convex Optimization. ITCS 2021: 53:1-53:20 - [c28]Ankit Garg, Robin Kothari, Praneeth Netrapalli, Suhail Sherif:
Near-Optimal Lower Bounds For Convex Optimization For All Orders of Smoothness. NeurIPS 2021: 29874-29884 - [c27]Scott Aaronson, Shalev Ben-David, Robin Kothari, Shravas Rao, Avishay Tal:
Degree vs. approximate degree and Quantum implications of Huang's sensitivity theorem. STOC 2021: 1330-1342 - [i37]Shalev Ben-David, Mika Göös, Siddhartha Jain, Robin Kothari:
Unambiguous DNFs from Hex. CoRR abs/2102.08348 (2021) - [i36]Jeongwan Haah, Robin Kothari, Ewin Tang:
Optimal learning of quantum Hamiltonians from high-temperature Gibbs states. CoRR abs/2108.04842 (2021) - [i35]Ankit Garg, Robin Kothari, Praneeth Netrapalli, Suhail Sherif:
Near-Optimal Lower Bounds For Convex Optimization For All Orders of Smoothness. CoRR abs/2112.01118 (2021) - [i34]Daochen Wang, Aarthi Sundaram, Robin Kothari, Ashish Kapoor, Martin Roetteler:
Quantum Algorithms for Reinforcement Learning with a Generative Model. CoRR abs/2112.08451 (2021) - [i33]Shalev Ben-David, Mika Göös, Siddhartha Jain, Robin Kothari:
Unambiguous DNFs from Hex. Electron. Colloquium Comput. Complex. TR21 (2021) - 2020
- [j6]Mark Bun, Robin Kothari, Justin Thaler:
The Polynomial Method Strikes Back: Tight Quantum Query Bounds via Dual Polynomials. Theory Comput. 16: 1-71 (2020) - [c26]Shalev Ben-David, Mika Göös, Robin Kothari, Thomas Watson:
When Is Amplification Necessary for Composition in Randomized Query Complexity? APPROX-RANDOM 2020: 28:1-28:16 - [c25]Scott Aaronson, Robin Kothari, William Kretschmer, Justin Thaler:
Quantum Lower Bounds for Approximate Counting via Laurent Polynomials. CCC 2020: 7:1-7:47 - [c24]Srinivasan Arunachalam, Aleksandrs Belovs, Andrew M. Childs, Robin Kothari, Ansis Rosmanis, Ronald de Wolf:
Quantum Coupon Collector. TQC 2020: 10:1-10:17 - [i32]Srinivasan Arunachalam, Aleksandrs Belovs, Andrew M. Childs, Robin Kothari, Ansis Rosmanis, Ronald de Wolf:
Quantum Coupon Collector. CoRR abs/2002.07688 (2020) - [i31]Scott Aaronson, Shalev Ben-David, Robin Kothari, Avishay Tal:
Quantum Implications of Huang's Sensitivity Theorem. CoRR abs/2004.13231 (2020) - [i30]Shalev Ben-David, Mika Göös, Robin Kothari, Thomas Watson:
When Is Amplification Necessary for Composition in Randomized Query Complexity? CoRR abs/2006.10957 (2020) - [i29]Ankit Garg, Robin Kothari, Praneeth Netrapalli, Suhail Sherif:
No quantum speedup over gradient descent for non-smooth convex optimization. CoRR abs/2010.01801 (2020) - [i28]Scott Aaronson, Shalev Ben-David, Robin Kothari, Shravas Rao, Avishay Tal:
Degree vs. Approximate Degree and Quantum Implications of Huang's Sensitivity Theorem. CoRR abs/2010.12629 (2020) - [i27]Scott Aaronson, Shalev Ben-David, Robin Kothari, Avishay Tal:
Quantum Implications of Huang's Sensitivity Theorem. Electron. Colloquium Comput. Complex. TR20 (2020)
2010 – 2019
- 2019
- [c23]Mark Bun, Robin Kothari, Justin Thaler:
Quantum algorithms and approximating polynomials for composed functions with shared inputs. SODA 2019: 662-678 - [c22]Adam Bene Watts, Robin Kothari, Luke Schaeffer, Avishay Tal:
Exponential separation between shallow quantum circuits and unbounded fan-in shallow classical circuits. STOC 2019: 515-526 - [c21]Shalev Ben-David, Robin Kothari:
Quantum Distinguishing Complexity, Zero-Error Algorithms, and Statistical Zero Knowledge. TQC 2019: 2:1-2:23 - [i26]Shalev Ben-David, Robin Kothari:
Quantum distinguishing complexity, zero-error algorithms, and statistical zero knowledge. CoRR abs/1902.03660 (2019) - [i25]Scott Aaronson, Robin Kothari, William Kretschmer, Justin Thaler:
Quantum Lower Bounds for Approximate Counting via Laurent Polynomials. CoRR abs/1904.08914 (2019) - [i24]Adam Bene Watts, Robin Kothari, Luke Schaeffer, Avishay Tal:
Exponential separation between shallow quantum circuits and unbounded fan-in shallow classical circuits. CoRR abs/1906.08890 (2019) - [i23]Scott Aaronson, Robin Kothari, William Kretschmer, Justin Thaler:
Quantum Lower Bounds for Approximate Counting via Laurent Polynomials. Electron. Colloquium Comput. Complex. TR19 (2019) - [i22]Adam Bene Watts, Robin Kothari, Luke Schaeffer, Avishay Tal:
Exponential separation between shallow quantum circuits and unbounded fan-in shallow classical circuits. Electron. Colloquium Comput. Complex. TR19 (2019) - 2018
- [j5]Shalev Ben-David, Robin Kothari:
Randomized Query Complexity of Sabotaged and Composed Functions. Theory Comput. 14(1): 1-27 (2018) - [c20]Shalev Ben-David, Adam Bouland, Ankit Garg, Robin Kothari:
Classical Lower Bounds from Quantum Upper Bounds. FOCS 2018: 339-349 - [c19]Jeongwan Haah, Matthew B. Hastings, Robin Kothari, Guang Hao Low:
Quantum Algorithm for Simulating Real Time Evolution of Lattice Hamiltonians. FOCS 2018: 350-360 - [c18]Mark Bun, Robin Kothari, Justin Thaler:
The polynomial method strikes back: tight quantum query bounds via dual polynomials. STOC 2018: 297-310 - [i21]Shalev Ben-David, Adam Bouland, Ankit Garg, Robin Kothari:
Classical lower bounds from quantum upper bounds. CoRR abs/1807.06256 (2018) - [i20]Mark Bun, Robin Kothari, Justin Thaler:
Quantum algorithms and approximating polynomials for composed functions with shared inputs. CoRR abs/1809.02254 (2018) - [i19]Mark Bun, Robin Kothari, Justin Thaler:
Quantum algorithms and approximating polynomials for composed functions with shared inputs. Electron. Colloquium Comput. Complex. TR18 (2018) - 2017
- [j4]Andrew M. Childs, Robin Kothari, Rolando D. Somma:
Quantum Algorithm for Systems of Linear Equations with Exponentially Improved Dependence on Precision. SIAM J. Comput. 46(6): 1920-1950 (2017) - [c17]Anurag Anshu, Shalev Ben-David, Ankit Garg, Rahul Jain, Robin Kothari, Troy Lee:
Separating Quantum Communication and Approximate Rank. CCC 2017: 24:1-24:33 - [i18]Mark Bun, Robin Kothari, Justin Thaler:
The Polynomial Method Strikes Back: Tight Quantum Query Bounds via Dual Polynomials. CoRR abs/1710.09079 (2017) - [i17]Mark Bun, Robin Kothari, Justin Thaler:
The Polynomial Method Strikes Back: Tight Quantum Query Bounds via Dual Polynomials. Electron. Colloquium Comput. Complex. TR17 (2017) - 2016
- [j3]Stacey Jeffery, Robin Kothari, François Le Gall, Frédéric Magniez:
Improving Quantum Query Complexity of Boolean Matrix Multiplication Using Graph Collision. Algorithmica 76(1): 1-16 (2016) - [c16]Andris Ambainis, Martins Kokainis, Robin Kothari:
Nearly Optimal Separations Between Communication (or Query) Complexity and Partitions. CCC 2016: 4:1-4:14 - [c15]Anurag Anshu, Aleksandrs Belovs, Shalev Ben-David, Mika Göös, Rahul Jain, Robin Kothari, Troy Lee, Miklos Santha:
Separations in Communication Complexity Using Cheat Sheets and Information Complexity. FOCS 2016: 555-564 - [c14]Shalev Ben-David, Robin Kothari:
Randomized Query Complexity of Sabotaged and Composed Functions. ICALP 2016: 60:1-60:14 - [c13]Scott Aaronson, Shalev Ben-David, Robin Kothari:
Separations in query complexity using cheat sheets. STOC 2016: 863-876 - [r1]Robin Kothari, Ashwin Nayak:
Quantum Algorithms for Matrix Multiplication and Product Verification. Encyclopedia of Algorithms 2016: 1673-1677 - [i16]Anurag Anshu, Aleksandrs Belovs, Shalev Ben-David, Mika Göös, Rahul Jain, Robin Kothari, Troy Lee, Miklos Santha:
Separations in communication complexity using cheat sheets and information complexity. CoRR abs/1605.01142 (2016) - [i15]Shalev Ben-David, Robin Kothari:
Randomized query complexity of sabotaged and composed functions. CoRR abs/1605.09071 (2016) - [i14]Anurag Anshu, Shalev Ben-David, Ankit Garg, Rahul Jain, Robin Kothari, Troy Lee:
Separating quantum communication and approximate rank. CoRR abs/1611.05754 (2016) - [i13]Anurag Anshu, Aleksandrs Belovs, Shalev Ben-David, Mika Göös, Rahul Jain, Robin Kothari, Troy Lee, Miklos Santha:
Separations in communication complexity using cheat sheets and information complexity. Electron. Colloquium Comput. Complex. TR16 (2016) - [i12]Shalev Ben-David, Robin Kothari:
Randomized query complexity of sabotaged and composed functions. Electron. Colloquium Comput. Complex. TR16 (2016) - 2015
- [c12]Robin Kothari, David Racicot-Desloges, Miklos Santha:
Separating Decision Tree Complexity from Subcube Partition Complexity. APPROX-RANDOM 2015: 915-930 - [c11]Dominic W. Berry, Andrew M. Childs, Robin Kothari:
Hamiltonian Simulation with Nearly Optimal Dependence on all Parameters. FOCS 2015: 792-809 - [i11]Robin Kothari, David Racicot-Desloges, Miklos Santha:
Separating decision tree complexity from subcube partition complexity. CoRR abs/1504.01339 (2015) - [i10]Scott Aaronson, Shalev Ben-David, Robin Kothari:
Separations in query complexity using cheat sheets. CoRR abs/1511.01937 (2015) - [i9]Robin Kothari:
Nearly optimal separations between communication (or query) complexity and partitions. CoRR abs/1512.01210 (2015) - [i8]Scott Aaronson, Shalev Ben-David, Robin Kothari:
Separations in query complexity using cheat sheets. Electron. Colloquium Comput. Complex. TR15 (2015) - [i7]Robin Kothari:
Nearly optimal separations between communication (or query) complexity and partitions. Electron. Colloquium Comput. Complex. TR15 (2015) - 2014
- [b1]Robin Kothari:
Efficient algorithms in quantum query complexity. University of Waterloo, Ontario, Canada, 2014 - [c10]Robin Kothari:
An optimal quantum algorithm for the oracle identification problem. STACS 2014: 482-493 - [c9]Dominic W. Berry, Andrew M. Childs, Richard Cleve, Robin Kothari, Rolando D. Somma:
Exponential improvement in precision for simulating sparse Hamiltonians. STOC 2014: 283-292 - 2013
- [c8]Aleksandrs Belovs, Andrew M. Childs, Stacey Jeffery, Robin Kothari, Frédéric Magniez:
Time-Efficient Quantum Walks for 3-Distinctness. ICALP (1) 2013: 105-122 - [c7]Stacey Jeffery, Robin Kothari, Frédéric Magniez:
Nested Quantum Walks with Quantum Data Structures. SODA 2013: 1474-1485 - [c6]Andrew M. Childs, Robin Kothari, Maris Ozols, Martin Roetteler:
Easy and Hard Functions for the Boolean Hidden Shift Problem. TQC 2013: 50-79 - [c5]Alessandro Cosentino, Robin Kothari, Adam Paetznick:
Dequantizing Read-once Quantum Formulas. TQC 2013: 80-92 - [i6]Andrew M. Childs, Stacey Jeffery, Robin Kothari, Frédéric Magniez:
A Time-Efficient Quantum Walk for 3-Distinctness Using Nested Updates. CoRR abs/1302.7316 (2013) - [i5]Andrew M. Childs, Robin Kothari, Maris Ozols, Martin Roetteler:
Easy and hard functions for the Boolean hidden shift problem. CoRR abs/1304.4642 (2013) - [i4]Alessandro Cosentino, Robin Kothari, Adam Paetznick:
Dequantizing read-once quantum formulas. CoRR abs/1304.5164 (2013) - [i3]Robin Kothari:
An optimal quantum algorithm for the oracle identification problem. CoRR abs/1311.7685 (2013) - 2012
- [j2]Andrew M. Childs, Robin Kothari:
Quantum Query Complexity of Minor-Closed Graph Properties. SIAM J. Comput. 41(6): 1426-1450 (2012) - [c4]Andrew M. Childs, Shelby Kimmel, Robin Kothari:
The Quantum Query Complexity of Read-Many Formulas. ESA 2012: 337-348 - [c3]Stacey Jeffery, Robin Kothari, Frédéric Magniez:
Improving Quantum Query Complexity of Boolean Matrix Multiplication Using Graph Collision. ICALP (1) 2012: 522-532 - 2011
- [c2]Andrew M. Childs, Robin Kothari:
Quantum query complexity of minor-closed graph properties. STACS 2011: 661-672 - [i2]Andrew M. Childs, Shelby Kimmel, Robin Kothari:
The quantum query complexity of read-many formulas. CoRR abs/1112.0548 (2011) - 2010
- [j1]Andrew M. Childs, Robin Kothari:
Limitations on the simulation of non-sparse Hamiltonians. Quantum Inf. Comput. 10(7&8): 669-684 (2010) - [c1]Andrew M. Childs, Robin Kothari:
Simulating Sparse Hamiltonians with Star Decompositions. TQC 2010: 94-103 - [i1]Andrew M. Childs, Robin Kothari:
Quantum query complexity of minor-closed graph properties. CoRR abs/1011.1443 (2010)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-03-04 21:17 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
