A Formalization of the Generalized Quantum Stein's Lemma in Lean
Not on the map. Why?
Abstract (arXiv)
The Generalized Quantum Stein's Lemma is a theorem in quantum hypothesis testing that provides an operational meaning to the relative entropy within the context of quantum resource theories. Its original proof was found to have a gap, which led to a search for a corrected proof. We formalize the proof presented in [Hayashi and Yamasaki (2024)] in the Lean interactive theorem prover. This is the most technically demanding theorem in physics with a computer-verified proof to date, building with a variety of intermediate results from topology, analysis, and operator algebra. In the process, we rectified minor imprecisions in [HY24]'s proof that formalization forces us to confront, and refine a more precise definition of quantum resource theory. Formalizing this theorem has ensured that our Lean-QuantumInfo library, which otherwise has begun to encompass a variety of topics from quantum information, includes a robust foundation suitable for a larger collaborative program of formalizing quantum theory more broadly.
Key facts. Cited by 7 papers in the map (data through 14 Oct 2026). First posted on arXiv 9 Oct 2025.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2025: 2; 2026: 5.
7 papers.
- 2025Ax-Prover: A Deep Reasoning Agentic Framework for Theorem Proving in Mathematics and Quantum Physicscited by 31
- 2026MerLean: An Agentic Framework for Autoformalization in Quantum Computationcited by 10
- 2025Formalized Hopfield Networks and Boltzmann Machinescited by 2
- 2026Multi-agent Autoformalization of Tensor Network Theorycited by 2
- 2026Lean-QIT: Towards a Formal Infrastructure for Quantum Information Theorycited by 2
- 2026AxQM: A Textbook-Scale Benchmark for Formal Proof Synthesis in a Library of Finite-Dimensional Quantum Mechanicscited by 1
- 2026The Future of AI-assisted Physics: Discovering, Verifying and Organizing Results via Formalizationcited by 0
- 2026The Future of AI-assisted Physics: Discovering, Verifying and Organizing Results via Formalization6 Oct 2026
- 2026AxQM: A Textbook-Scale Benchmark for Formal Proof Synthesis in a Library of Finite-Dimensional Quantum Mechanics4 Sep 2026
- 2026Lean-QIT: Towards a Formal Infrastructure for Quantum Information Theory10 Jul 2026
- 2026Multi-agent Autoformalization of Tensor Network Theory8 Jul 2026
- 2026MerLean: An Agentic Framework for Autoformalization in Quantum Computation18 Feb 2026
- 2025Formalized Hopfield Networks and Boltzmann Machines8 Dec 2025
- 2025Ax-Prover: A Deep Reasoning Agentic Framework for Theorem Proving in Mathematics and Quantum Physics14 Oct 2025