Get Started
Home
Topics
Search
Library
Research questionHow can we benchmark formal proof synthesis in finite-dimensional quantum mechanics at textbook scale?Physics arguments often rely on unstated idealizations, making their logical completeness difficult to assess consistently. Proof-synthesis evaluation therefore needs substantial formalized content and an objective distinction between valid and incomplete proofs.
AI
Code Generation & Program Synthesis
Evaluation & Benchmarks
Reasoning
Research Paper
Technology
Latest papersRecent research connected to this question, newest first.AxQM: A Textbook-Scale Benchmark for Formal Proof Synthesis in a Library of Finite-Dimensional Quantum MechanicsAxQM provides 1,019 kernel-checkable tasks over 479 items drawn from Quantum Computation and Quantum Information, encoded in a custom Lean library of finite-dimensional quantum mechanics. Lean checks compilation, rejects proofs containing sorry or depending on declarations containing sorry, and rejects newly introduced axioms; each task has a guaranteed solution that remains private. The supplied evidence describes benchmark construction and grading, not the performance of particular proof-synthesis systems.research paper · Sep 4, 2026
Related questions
How can quantum developers track experiments and provenance reproducibly amid noisy hardware and repeated execution?How can computational systems discover graph-theoretic conjectures that survive refutation and admit machine-checked proofs?Can any finite formal system autonomously derive every theorem within its expressive scope?How can synthetic-noise benchmarks reliably predict decoder rankings on real quantum hardware?