
LLMs have gotten very good at making classical code do more with less, from faster CUDA kernels to leaner compilers. This summer, as part of the Anthropic STEM Fellows program, we asked whether Claude could do the same for quantum computers.
We found it can. Across a wide range of tasks, Claude's circuits need fewer qubits and less running time than the best published designs. The video shows the most striking one: modular inversion, the costliest step in the quantum algorithm for elliptic-curve discrete log. Claude built it on a classical method few thought could work on quantum computers.
Huge thanks to my coauthors @alekhkemeny, Susanne Yelin and Mikhail Lukin, and to @J_Pablo_Bonilla, Arjun Kar, @nazli_koyluoglu, Rohan Mehta, @varun_menon0 and @vinayramasesh for feedback.
Paper: arxiv.org/abs/2610.22367
Site: andigu.github.io/projects/un…
teapaw.org/AnthropicAI/status/211…
New from our STEM Fellows Program: Designing more efficient quantum circuits with Claude.
Given plain-language instructions, Claude Mythos 5 designed quantum circuits that improve on the best published ones, sometimes by an order of magnitude or more.
More efficient circuits reduce the resources needed by quantum algorithms, which could bring quantum computing applications in chemistry and materials science within reach sooner.
Read more: anthropic.com/research/desig…
Andi Gu retweeted
New from our STEM Fellows Program: Designing more efficient quantum circuits with Claude.
Given plain-language instructions, Claude Mythos 5 designed quantum circuits that improve on the best published ones, sometimes by an order of magnitude or more.
More efficient circuits reduce the resources needed by quantum algorithms, which could bring quantum computing applications in chemistry and materials science within reach sooner.
Read more: anthropic.com/research/desig…
Andi Gu retweeted
With @AndiGu00, we introduce Cascade; a state-of-the-art quantum error correction decoder.
We show that utility-scale logical error rates are achievable with modest code sizes at current physical error rates, with real-time compatible latency.
📄 scirate.com/arxiv/2604.08358
New preprint with @J_Pablo_Bonilla! We built a neural network that decodes quantum errors — and discovered that fault-tolerant quantum computing might need far fewer qubits than we thought. 📄
Paper: arxiv.org/abs/2604.08358
Website: andigu.github.io/projects/ca…
We also put a working Cascade model in the browser. You can inject errors, and watch the network think 🔬
andigu.github.io/projects/ca…
Paper: arxiv.org/abs/2604.08358
w/ @J_Pablo_Bonilla, Mikhail Lukin, and Susanne Yelin
2
285
Andi Gu retweeted
With @AndiGu00 we built machine learning (ML) decoders for the recent neutral atom experiment on error-corrected quantum memory and logical computation (arxiv.org/abs/2506.20661), which led us to ask: how general can these decoders be? It turns out, quite general...
Andi Gu retweeted
I am thrilled to announce our new work at the intersection of many-body physics and computational complexity! In this work, we construct a set of Hamiltonians that are computationally indistinguishable from the GUE ensemble.
scirate.com/arxiv/2410.18196
Andi Gu retweeted
All you need is quantum chaos.
Except that you do not need #quantumchaos.
scirate.com/arxiv/2410.18196
It took me a while to accept that the main result of this work is not wrong, which I still find surprising.
Andi Gu retweeted
Our paper on classically hard simple quantum systems is out (with Varun Menon and Andi Gu). These systems are promising for giving verifiable such advantages:
scirate.com/arxiv/2408.16070
#ResearchPapers #QuantumComputing #quantum
Andi Gu retweeted
What’s the difference between low-magic entanglement and high-magic 🪄entanglement? Is there one?
Check our new preprint: scirate.com/arxiv/2403.19610
1/9
Andi Gu retweeted
New preprint✨ Are you wondering if doped stabilized states occur in nature, and if it's possible to use Clifford+T simulations in many-body physics?
scirate.com/arxiv/2403.14912👈
1/6🧵










