Algorithmic Aspects of the Fermi--Hubbard Model

Abstract:Preparing Gibbs states on a quantum computer offers a way to computationally probe how microscopic interactions give rise to macroscopic phenomena at finite temperature. However, an uncomfortable tension has set in: our strongest general guarantees for Gibbs state preparation hold in regimes where the resulting states can also be simulated classically. We propose investigating physical models with competing energy scales. The Fermi--Hubbard model is a natural target: the competition between electron hopping, on-site repulsion and chemical potential encapsulates many mysteries of condensed matter physics, including Mott insulators, striping and superconductivity. Our main result identifies a simple guiding principle: the temperature scale for efficient preparation is set by the couplings between sites, while the on-site energy scale is unrestricted. For the Fermi--Hubbard model on an $n$-site nearest-neighbor lattice of fixed dimension, we construct a quantum Gibbs sampler that mixes in $\mathcal{O}(\log(n/\epsilon))$ time whenever the temperature is at least a constant factor larger than the hopping strength, but is allowed to be independent of the repulsion and chemical potential. We obtain analogous guarantees for local qubit systems with bounded intersite interactions and arbitrary external fields. As a consequence, our algorithms can efficiently prepare Fermi--Hubbard Gibbs states that are provably outside the convex hull of fermionic Gaussian states and qubit Gibbs states for locally interacting Hamiltonians outside the set of product states.

Quantum Physics (quant-ph); Data Structures and Algorithms (cs.DS); Mathematical Physics (math-ph)

arXiv:2604.08408 [quant-ph]

(or arXiv:2604.08408v2 [quant-ph] for this version)

https://doi.org/10.48550/arXiv.2604.08408 Focus to learn more arXiv-issued DOI via DataCite

arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.

Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.

Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.