Nov 2026· 1 citation· ⚡ 1 influential· 67 references
Computer SciencePhysics
Abstract
Quantum Monte Carlo methods are widely used to solve quantum many-body problems. However, rigorous guarantees for their performance are poorly understood, especially for simulating interacting fermions. In this work, we develop a quantum Monte Carlo algorithm for a broad family of fermionic systems exhibiting Kramers time-reversal symmetry, and prove that their partition functions can be estimated in polynomial time. This family, which contains many important classes of Hubbard-type models, is known to both avoid the sign problem and obey a Lee-Yang zero-freeness theorem. Thus our results suggest that these two properties together may enable efficient classical algorithms for quantum many-body systems more broadly.
The sign problem poses a fundamental barrier to numerically exact quantum Monte Carlo simulations, severely hindering our understanding of quantum many-body physics across disciplines ranging from condensed matter to particle and nuclear physics. Geometrical frustration makes this barrier especially acute for interacti...
We study a surprisingly efficient family of variational ansatze for the ground state of bosonic matrix quantum mechanics at large $N$. These are ansatze whose norm-squared probability distributions are themselves matrix integrals with single-trace actions, and so have their own independent `t Hooft expansions. They are...
We propose a variational framework for the efficient simulation of stochastic quantum dynamics in interacting bosonic systems. Our method generalizes the time-dependent variational principle to accommodate quantum state diffusion processes and is tailored for describing quantum trajectories unraveled from a master equa...
Recent work by Greenblatt, Lange, Marcelli, and Porta (Commun. Math. Phys. 2024) provides the first rigorous justification of adiabatic theory for interacting quantum systems at positive temperature. Their analysis treats weakly interacting lattice fermions and combines a rigorous Wick rotation with fermionic cluster e...
Joscha Henheik, Marius Lemm, Tom Wessel· 1 citation
Estimating the ground energy of interacting fermions is central to quantum many-body physics, and recent quantum algorithms provide polynomial-time guarantees for some structured families. Classical approaches commonly rely on quantum Monte Carlo, where the sign problem is a major obstacle. However, even when a nonnega...
Zi-Yi Yang, Ye-Xin Zhang, Yue-Xin Su et al.· 0 citations
Discussions of the sign problem usually focus on its role as the primary limitation of the applicability of quantum Monte Carlo methods for reliably solving quantum many-body models. Its behavior as a function of spatial lattice size, doping, temperature, and interaction strengths has been carefully characterized withi...
R. Mondaini, R. Scalettar· 1 citation
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.