Approximation Algorithms and Graph Theory for the Heisenberg Hamiltonian

Abstract:
The Heisenberg Hamiltonian is central for describing quantum magnetism. Here we discuss upper bounds on the ground state energy
that come with an approximation ratio: a guarantee on how close the approximation is to the true ground state energy. One is based on
semidefinite programming, and the second is based on graph theory, and both are highly scalable. References: arXiv:2411.04120,
arXiv:2512.20326.

Remote guests are invited via Zoom:
Zoom link: https://us06web.zoom.us/j/84248911743?pwd=ZsiAOQbRgYCm5IFsArOnb18Fj5IsZh.1
Meeting ID: 842 4891 1743
Passcode: 394021

Date: Mar 11, 2026 02.00 PM CET, Room D