We discuss numerical complexity of the Lüscher algorithm applied to the Hubbard Model. In particular we present comparison to a certain algorithm based on direct computation of the fermionic determinant.
Simulating interactions between fermions and bosons is central to understanding correlated phenomena, yet these systems are inherently difficult to treat classically. Previous quantum algorithms for fermion-boson models exhibit computation costs that scale polynomially with the bosonic truncation parameter, Λ. In this work we identify the efficient unitary transformation enabling fast-forwarded evolution of the fermion-boson interaction term, yielding an interaction-picture based simulation algorithm with complexity polylogarithmic in Λ. We apply this transformation to explicitly construct an efficient quantum algorithm for the Hubbard-Holstein model and discuss its generalisation to other fermion-boson interacting models. This approach yields an important asymptotic improvement in the dependence on the bosonic cutoff and establishes that, for certain models, fermion-boson interactions can be simulated with resources comparable to those required for purely fermionic systems.
The Worldvolume Hybrid Monte Carlo (WV-HMC) method [arXiv:2012.08468] is an efficient algorithm for addressing the numerical sign problem at moderate computational cost. It mitigates the sign problem while avoiding the ergodicity issues inherent in approaches based on Lefschetz thimbles. In this study, we apply WV-HMC to the two-dimensional Hubbard model doped away from half filling, which is known to suffer from a severe sign problem. We compute the number density and the energy density on lattices of size 6×6 and 8×8 at temperature T/t=1/6.4≃0.156 and interaction strength U/t=8.0, using Trotter number Nt=20 (Trotter step ε=0.32). Our results demonstrate that WV-HMC remains effective even in parameter regimes where standard (non-thimble) determinant quantum Monte Carlo methods fail. In this work, fermion matrix inversions are performed using direct solvers, leading to a computational cost of O(N3), where N denotes the number of degrees of freedom and is proportional to the spacetime lattice volume. An alternative algorithm employing pseudofermions and iterative solvers, which reduces the cost to O(N2) at the expense of careful parameter tuning, will be discussed in a separate publication.