Are you a PhD student in quantum computing and interested in working with our team in 2027 as a student researcher (i.e., an internship that's ~3 months and in-person at our office)? If so, apply here: www.google.com/about/career...
Robin Kothari
Robin Kothari
@robinkothari.bsky.social
Theoretical computer scientist working on quantum algorithms and complexity at Google Quantum AI. Previously at Microsoft Quantum, MIT, U. Waterloo, and IIT Bombay.
475 followers35 following33 posts
Can you (or your agents) come up with smaller quantum circuits for important quantum algorithms? Give it a try on this Kaggle competition with real prize money. Blog post: goo.gle/kaggle-quant... Paper: scirate.com/arxiv/2610.2... Competition: www.kaggle.com/competitions...
Can you (or your agents) improve the super-quadratic separation between block sensitivity and sensitivity from the current bound of 2.05? The optimal exponent is between 2 and 4. My guess is 2.5 is achievable. Submit your lean-verified solutions here: prove2.me/campaigns/bl...
With Chenyi Zhang, Norah Tan, David Gosset, and Craig Gidney: How to compile a circuit over arbitrary 1- & 2-qubit gates to a discrete gate set adaptively with only constant overhead (and 1/poly error). scirate.com/arxiv/2609.3... arxiv.org/abs/2609.39092
With Tony Metger, Ryan O'Donnell, Noah Shutty and Kewen Wu: A new exponential quantum speedup! Or alternatively, a new rigorous classical algorithm for Binary-Error LWE. scirate.com/arxiv/2609.4... arxiv.org/abs/2609.40321
Carlos Bravo-Prieto, Aram Harrow (@harrowing.bsky.social), and I just uploaded a preprint that proves new upper and lower bounds to finally close the query complexity of the quantum linear systems problem. scirate.com/arxiv/2609.3... arxiv.org/abs/2609.35660
Now on the arXiv: Shalev Ben-David and I (with the help of LLMs) show how a randomized algorithm can compute a total Boolean function faster than it is possible to certify the function! The full proof is < 3 pages. arxiv.org/abs/2609.15063 scirate.com/arxiv/2609.1...
My strategy of attending the past 17 QIPs in a row has paid off! I'm happy to announce I'm now chair of the QIP steering committee (qipconference.org/steeringcomm...). More seriously, I'd like to thank the committee for selecting me and I look forward to QIP 2027 in Singapore.
I'm happy to announce that we improved this result establishing @lance.fortnow.com's conjecture: from a quartic relationship between degree and rational degree to cubic. This is essentially the limit of this method and further demonstrates the power of "best-case" query measures.
Congrats to Matt Kovacs-Deak, Daochen Wang, and (undergraduate student!) Rain Zimin Yang on resolving the 30+ year old conjecture (by Lance Fortnow) in query complexity on rational degree vs. degree. What's more, the proof is like ~2 pages if you know the standard tools of query complexity!
Just watched this movie. I wholeheartedly recommend it to everyone, even if you think AI is not very relevant to your life (because if it isn't right now, it soon will be). www.youtube.com/watch?v=xkPb...
Robin Kothari reposted
I'm honored that this work with David Gosset and Chenyi Zhang was selected as one of three long plenary talks at QIP 2026!
New paper on the arXiv with David Gosset and Google student researcher Chenyi Zhang on how to implement an n-qubit Toffoli gate (approximately) with exponentially fewer T gates than previously thought. arxiv.org/abs/2510.07223 scirate.com/arxiv/2510.0...
A very clear, detailed talk by Kewen Wu on our joint work with @booleananalysis.bsky.social
Kewen Wu on "No exponential quantum speedup for SIS∞ anymore"... Or if you prefer a special case, "Subset-Sum with vectors mod 3": www.youtube.com/watch?v=Pl2b...
Are you a computer scientist and don't know what an OTOC is, but want to understand the problem solved in the recent Nature paper by Google Quantum AI? We wrote a 2-page note that explains the motivation and presents a simplified version of the problem for any input size. scirate.com/arxiv/2510.1...
Are you a PhD student in quantum computing and interested in working with our team in 2026 as a student researcher (i.e., an internship that's ~3 months and in-person at our office)? If so, apply here: www.google.com/about/career...
Fresh on the arXiv: @booleananalysis.bsky.social, Kewen Wu, and I present new classical algorithms for the Short Integer Solution problem (under infinity norm) that outperform the elegant Chen-Liu-Zhandry quantum algorithm, showing that there is no exponential quantum speed up anymore.
New paper on the arXiv with David Gosset and Google student researcher Chenyi Zhang on how to implement an n-qubit Toffoli gate (approximately) with exponentially fewer T gates than previously thought. arxiv.org/abs/2510.07223 scirate.com/arxiv/2510.0...
The QIP 2026 call for papers is out! QIP 2026 will be held in Riga, Latvia from January 24–30, 2026. See you there! qip2026.lu.lv
Robin Kothari reposted
The notifications for #FOCS2025 are out: congratulations to all! The registration page is up: focs.computer.org/2025/register/ and information about student travel support will be added within days. Looking forward to seeing you in Sydney in December!
In "On the Rational Degree of Boolean Functions and Applications" with Vishnu Iyer, Siddhartha Jain (@sidjai.bsky.social), Matt Kovacs-Deak, Vinayak Kumar, Luke Schaeffer, Daochen Wang, and Michael Whitmeyer, we prove many interesting results about rational degree. arxiv.org/pdf/2310.08004
Robin Kothari reposted
The submission server for #FOCS2025 is now open! Submit your work: focs25.hotcrp.com
If you're an early-career faculty member (received their PhD within seven years of submission) in quantum computing, consider applying to Google's Research Scholar Program. The application process is lightweight and the grant comes in the form of an unrestricted gift. research.google/programs-and...
You are up to date.