research
Quantum Programs Enter the Proof Press
Agent teams searched a Lean library for quantum programs whose correctness and resource cost could be checked even when classical simulation could not reach the target scale.
Summary
Agent teams searched a Lean library for quantum programs whose correctness and resource cost could be checked even when classical simulation could not reach the target scale.
Quantum-algorithm search runs into a verification wall: useful programs can exceed the sizes that classical computers can simulate directly. The authors built a quantum-program library in the Lean theorem prover, then had language-model agents synthesize candidates against formal specifications, exchange results through shared wikis and conferences, and prove correctness and cost. They report improvements over prior baselines of up to 1.4 times for parallel search, 290 times for quantum arithmetic, and 11, 8 and 2.5 times for simulations related to fusion, photochemistry and drug metabolism. The work demonstrates programs and machine-checked proofs, not hardware executions or guaranteed practical advantage. Its central shift is to make formal proof part of the discovery loop rather than a check performed after search.
Why it matters
Agent teams searched a Lean library for quantum programs whose correctness and resource cost could be checked even when classical simulation could not reach the target scale.
Limits and context
- The work demonstrates programs and machine-checked proofs, not hardware executions or guaranteed practical advantage.
Key claims
Agent teams searched a Lean library for quantum programs whose correctness and resource cost could be checked even when classical simulation could not reach the target scale.
Qualification: The work demonstrates programs and machine-checked proofs, not hardware executions or guaranteed practical advantage.
Evidence: source-2026-11-09-002
Sources
- arXiv preprint 2611.09822, original v1arXiv · primary research
Corrections
No corrections have been recorded for this story.