Efficient continuous-time quantum Monte Carlo algorithm for fermionic lattice models

Abstract

Efficient continuous time quantum Monte Carlo (CT-QMC) algorithms that do not suffer from time discretization errors have become the state-of-the-art for most discrete quantum models. They have not been widely used yet for fermionic quantum lattice models, such as the Hubbard model, due to a suboptimal scaling of O(β3) with inverse temperature β, compared to the linear scaling of discrete time algorithms. Here we present a CT-QMC algorithms for fermionic lattice models that matches the scaling of discrete-time methods but is more efficient and free of time discretization errors. This provides an efficient simulation scheme that is free from the systematic errors opening an avenue to more precise studies of large systems at low temperatures.

0

Turn this paper into a lesson

ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…