A Human-AI Collaborative Workflow for Mathematical Discovery: A Case Study in Grover-Compatible Riemannian Optimization
Read the original on arXiv AI →The Flow has not summarised this story yet — read it at arXiv AI.
The Flow has not summarised this story yet — read it at arXiv AI.
AxQM is a new benchmark for formal proof synthesis in physics, comprising 1,019 Lean‑kernel‑checkable tasks drawn from the textbook *Quantum Computation and Quantum Information* by Nielsen and Chuang. The tasks are defined in a custom Lean library for finite‑dimensional quantum mechanics and are guaranteed solvable because they stem from a near‑complete formalization of the textbook’s formal content. Grading is deterministic, requiring proofs to compile, contain no sorrys, and introduce no new axioms.
arXiv:2606. 24899v1 Announce Type: new Abstract: AI-assisted mathematics is often evaluated on solving predefined problems.
arXiv:2606. 29687v1 Announce Type: cross Abstract: We report a machine-verified resolution of a problem open for over a decade in quantum optimization: the Farhi, Goldstone and Gutmann (FGG) conjecture that depth-$p$ Quantum Approximate Optimization Algorithm (QAOA) on the ring of disagrees attains approximation ratio $(2p+1)/(2p+2)$ exactly.
arXiv:2607. 14582v1 Announce Type: new Abstract: Existing LLM-based theorem provers have achieved impressive results on formal mathematics benchmarks, yet they remain confined to acting as autonomous agents that prove a stated proposition.
arXiv:2605. 22763v2 Announce Type: replace Abstract: Large language models (LLMs) increasingly excel at mathematical reasoning, but their unreliability limits their utility in mathematics research.
arXiv:2606. 08728v1 Announce Type: new Abstract: Mathematical reasoning has long served as a stringent test of machine intelligence; over the past decade, it has moved from a niche problem within NLP to one of the most consequential AI frontiers.