Finding and proving the exact ground state of a generalized Ising model by convex optimization and MAX-SAT
Wenxuan Huang, Daniil A. Kitchaev, Stephen Dacek, Ziqin Rong,, Alexander Urban, Shan Cao, Chuan Luo, Gerbrand Ceder

TL;DR
This paper introduces a novel algorithm that combines convex and combinatorial optimization techniques to find and prove the exact ground states of complex lattice models, a longstanding challenge in condensed matter physics.
Contribution
The authors develop the first general method to determine and verify the global ground state of complex lattice models using a combination of MAX-SAT and convex optimization.
Findings
Successfully finds the exact ground state of realistic Hamiltonians
Proves the global optimality of the solutions
Outperforms traditional heuristic methods like simulated annealing
Abstract
Lattice models, also known as generalized Ising models or cluster expansions, are widely used in many areas of science and are routinely applied to alloy thermodynamics, solid-solid phase transitions, magnetic and thermal properties of solids, and fluid mechanics, among others. However, the problem of finding the true global ground state of a lattice model, which is essential for all of the aforementioned applications, has remained unresolved, with only a limited number of results for highly simplified systems known. In this article, we present the first general algorithm to find the exact ground states of complex lattice models and to prove their global optimality, resolving this fundamental problem in condensed matter and materials theory. We transform the infinite-discrete-optimization problem into a pair of combinatorial optimization (MAX-SAT) and non-smooth convex optimization…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
