Polynomial Time Quantum Gibbs Sampling for Fermi-Hubbard Model at any Temperature
arXiv:2501.01412 · doi:10.1038/s41467-025-65765-1
Abstract
Recently, there have been several advancements in quantum algorithms for Gibbs sampling. These algorithms simulate the dynamics generated by an artificial Lindbladian, which is meticulously constructed to obey a detailed-balance condition with the Gibbs state of interest, ensuring it is a stationary point of the evolution, while simultaneously having efficiently implementable time steps. The overall complexity then depends primarily on the mixing time of the Lindbladian, which can vary drastically, but which has been previously bounded in the regime of high enough temperatures [Rouzé et al. arXiv:2403.12691 and arXiv:2411.04885]. In this work, we calculate the spectral gap of the Lindbladian for free fermions using third quantisation, and also prove a logarithmic bound on its mixing time by analysing corresponding covariance matrices. Then we prove a constant gap of the perturbed Lindbladian corresponding to interacting fermions up to some maximal coupling strength. This is achieved by using theorems about stability of the gap for lattice fermions. Our methods apply at any constant temperature and independently of the system size. The gap then provides an upper bound on the mixing time, and hence on the overall complexity of the quantum algorithm, proving that the purified Gibbs state of weakly interacting (quasi-)local fermionic systems of any dimension can be prepared in time on qubits, where denotes the size of the system and the desired accuracy. As an application, we explain how to calculate partition functions for the considered systems. We provide exact numerical simulations for small system sizes supporting the theory and also identify different suitable jump operators and filter functions for the sought-after regime of intermediate coupling in the Fermi-Hubbard model.
35 pages, 8 figures. Version 2 includes new results on rapid mixing of free fermions and a method for calculating the partition function
References in corpus (25)
- Adiabatic Quantum Computing
- Gibbs States and the Set of Solutions of Random Constraint Satisfaction Problems
- Quantum singular value transformation and beyond: exponential improvements for quantum matrix arithmetics
- Third quantization: a general method to solve master equations for quadratic open Fermi systems
- The Hubbard Model
- Quantum Boltzmann Machine
- Quantum Metropolis Sampling
- Computational Complexity of interacting electrons and fundamental limitations of Density Functional Theory
- Universal Lindblad equation for open quantum systems
- The power of quantum systems on a line
- Quantum Simulations of Classical Annealing Processes
- A Quantum-Quantum Metropolis Algorithm
- Quantum algorithm for simulating real time evolution of lattice Hamiltonians
- Completely positive master equation for arbitrary driving and small level spacing
- Solving quasi-free and quadratic Lindblad master equations for open fermionic and bosonic systems
- Quantum SDP-Solvers: Better upper and lower bounds
- Thermal State Preparation via Rounding Promises
- Persistence of exponential decay and spectral gaps for interacting fermions
- Efficient quantum Gibbs samplers with Kubo--Martin--Schwinger detailed balance condition
- Entropy decay for Davies semigroups of a one dimensional quantum lattice
- Szegedy Walk Unitaries for Quantum Maps
- Efficient Algorithms for Approximating Quantum Partition Functions
- Rapid thermalization of dissipative many-body dynamics of commuting Hamiltonians
- Efficient Algorithms for Approximating Quantum Partition Functions at Low Temperature
- Optimal trace-distance bounds for free-fermionic states: Testing and improved tomography