LLM Evolutionary Search Finds Cheaper Quantum Arithmetic Circuits

Gu, Kemeny, Yelin, Lukin · "Discovering state-of-the-art quantum circuits with large language models" · 2026 · OpenEvolve + Claude Mythos 5
arXiv 2610.22367Interactive page

References

  1. Gu, Kemeny, Yelin, Lukin — Discovering state-of-the-art quantum circuits with LLMs (arXiv 2610.22367)
  2. Gidney & Ekerå — Factor 2048-bit RSA in 8 hours (2019)
  3. Babbush et al. — Linear T complexity electronic spectra (2018)
  4. Novikov et al. — AlphaEvolve (2025)
  5. Romera-Paredes et al. — FunSearch (2023/2024)
  6. AlphaTensor / AlphaTensor-Quantum
  7. Bennett — Logical Reversibility of Computation (1973)
  8. Roetteler et al. — ECDLP resource estimates (2017)
  9. Bernstein & Yang — Fast constant-time gcd / divsteps (2019)
  10. Gomez et al. — RevNet (2017)
  11. Quartz / PyZX / TODD / T-par optimizers
  12. Jordan et al. — Decoded Quantum Interferometry (2024)
  13. Khattar et al. — Compiling DQI (2025)
  14. Gidney — RSA-2048 with under a million qubits (2025)
  15. Gidney; Berry et al. — Halving addition cost / measurement-based uncomputation
  16. Zalka; Gidney — Coset representation
  17. Bennett; Knill; Chan & Gidney — Pebble game trade-offs