
"Greek God of ruining provable statements" - @QueenofQuanta. Currently at @GoogleQuantumAI. Previously at @JointQuICS, @UCL, @Cambridge_Uni
Maryland, US
Joined July 2018
- Tweets73
- Following471
- Followers546
- Likes922
James D. Watson retweeted
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-quantum-comp
Paper: scirate.com/arxiv/2610.23832
Competition: kaggle.com/competitions/goog…
Really happy with this work with Jacob: we exponentially improve circuit depths for Trotterization with some minimal measurement overhead + classical postprocessing!
This Post is from an account that no longer exists. Learn more
James D. Watson retweeted
Hello, #quantum! I'm recruiting new PhD students this year to work with me in quantum complexity theory. I encourage you to apply. Come be part of the strong theory group here @ucsd_cse!
Application deadline is Dec 18th -- details: cse.ucsd.edu/graduate/admiss…
James D. Watson retweeted
I'm honored to receive the 2024 Kirwan Prize from @UofMaryland for research on quantum simulation algorithms. Many thanks to my collaborators on this topic over the years, especially @yuansu_umd who made deep contributions to the analysis of product formulas.
🎉 Congratulations to @UofMaryland CS Professor @andrewmchilds on receiving the 2024 Kirwan Faculty Research and Scholarship Prize! 🏆 Join us in congratulating him on this milestone achievement!
Read more:
go.umd.edu/KirwanPrize24
New paper: we show quantum advantage in Gibbs sampling with local Hamiltonians at constant temperature!
This tackles one of my favourite questions: how "quantum" are systems at non-zero temperature?
Work with the fantastic @joelrajakumar!
Link: scirate.com/arxiv/2408.01516
Finally, to show quantum advantage, we borrow results from the Bergamaschi et al paper to show that these families of Gibbs states can be prepared efficiently with a quantum computer using the recent Lindbladian methods.
1
4
311
As a bonus, we also put limits on where the efficient classical Gibbs sampling algorithms (such as those recently developed by @AineshBakshi , Liu, Moitra, @ewintang ) can work.
1
4
429
Excited to say that this will be a talk a TQC!
See you all there!
New paper: IQP circuit sampling, a leading test of quantum supremacy, turns out to be classically simulatable for noisy circuits beyond an O(1) depth!
Really excited about this work with @joelrajakumar and Yi-Kai Liu!
scirate.com/arxiv/2403.14607
New paper: IQP circuit sampling, a leading test of quantum supremacy, turns out to be classically simulatable for noisy circuits beyond an O(1) depth!
Really excited about this work with @joelrajakumar and Yi-Kai Liu!
scirate.com/arxiv/2403.14607
Surprisingly this percolation happens at an O(1) circuit depth!
Since percolation occurs in graphs regardless of their structure, our results apply for arbitrary circuit architectures!
But more restricted architectures percolate faster -> become simulatable faster.
1
3
346







