Discovering formally verified quantum programs with AI
- Published
- Source
- arXiv
- Paper number
- 1484
- Field
- Research Agents
- arXiv ID
- 2611.09822
Key points
- The researchers built a Lean verification library based on quantum Hoare logic (QHL) and a multi-agent research workflow, proving resource reductions on asymptotic algorithms and large-scale scientific simulations.
- Agent teams published independently re-verified solutions, partial results, and dead ends to a shared wiki, and exchanged ideas and critiques in scheduled cross-team conferences.
- Parallel Grover search reduced expected oracle rounds by up to 2.57×, and fixed-point arcsin achieved a 290× spacetime cost reduction.
- On the fusion alpha-particle stopping power problem, the workflow found a solution using 4,338 logical qubits, lowering spacetime cost by 11.8×.
- The authors state that these simulations still demand far more resources than projected for the first fault-tolerant quantum computers, and reaching early hardware requires further orders-of-magnitude improvements.
Paper links
External research summaries. These are not HDATF publications or measured product results.