Related papers: Hubbard Model with Luscher fermions - a progress r…
First applications of the new algorithm simulating dynamical fermions are reported. The method reproduces previous results obtained with different techniques.
We discuss numerical complexity of the L\"uscher algorithm applied to the Hubbard Model. In particular we present comparison to a certain algorithm based on direct computation of the fermionic determinant.
First results on the autocorrelation behaviour of a recently proposed fermion algorithm by M. L\"uscher are presented and discussed. The occurence of unexpected large autocorrelation times is explained. Possible improvements are discussed.
We study the basic features of the two-dimensional quantum Hubbard Model at half-filling by means of the L\"uscher algorithm and the algorithm based on direct update of the determinant of the fermionic matrix. We implement the L\"uscher…
We study improved variants of L\"uscher's algorithm, including the cases of staggered fermions and finite density.
We discuss the application of hybrid over-relaxation, even-odd preconditioning and a modified local updating procedure to the local bosonic fermion algorithm. Studies on autocorrelation times and the tuning of the parameters of the…
The two-flavour Schwinger model is used to test the local boson action algorithm of M Luescher. The autocorrelation time is found to rise linearly with the number of auxiliary boson fields. An extension to the algorithm is proposed which…
The Hubbard model is the simplest model of interacting fermions on a lattice and is of similar importance to correlated electron physics as the Ising model is to statistical mechanics or the fruit fly to biomedical science. Despite its…
Two cluster algorithms, based on constructing and flipping loops, are presented for worldline quantum Monte Carlo simulations of fermions and are tested on the one-dimensional repulsive Hubbard model. We call these algorithms the loop-flip…
We present the preliminary tests on two modifications of the Hybrid Monte Carlo (HMC) algorithm. Both algorithms are designed to travel much farther in the Hamiltonian phase space for each trajectory and reduce the autocorrelations among…
Using a map between the Lindbladian evolution of dephasing in free fermions and the time evolution of imaginary-interaction Fermi-Hubbard models in bipartite lattices, we present an efficient classical algorithm to solve the Schr\"{o}dinger…
When performing a Monte Carlo calculation, the running time should in principle be much longer than the autocorrelation time in order to get reliable results. Among different lattice fermion models, the Holstein model is notorious for its…
In this letter we extent the overrelaxation algorithm, known to be very efficient in gauge theories, to coupled gauge-Higgs systems with a particular emphasis on the update of the radial mode of the Higgs field. Our numerical tests of the…
The aim of this review article is to assess the descriptive capabilities of the Hubbard-rooted LDA+U method and to clarify the conditions under which it can be expected to be most predictive. The paper illustrates the theoretical foundation…
I discuss the behaviour of algorithms for dynamical fermions as the sea-quark mass decreases. I focus on the Hybrid-Monte-Carlo (HMC) algorithm applied to two degenerate flavours of Wilson fermions. First, I briefly review the performance…
The role of Klein factors is investigated for the bosonized Hamiltonian of the dimerized Hubbard model. Contrary to previous approaches we take into account their number changing property, i.e. we do not replace them by Majorana fermions.…
We compare the performance of the Kramers Equation Monte Carlo (KMC) Algorithm with that of the Hybrid Monte Carlo (HMC) algorithm for numerical simulations with dynamical Kogut-Susskind fermions. Using the lattice Gross-Neveu model in 2…
Nested multi-step stochastic correction offers a possibility to improve updating algorithms for numerical simulations of lattice gauge theories with fermions. The corresponding generalisations of the two-step multi-boson (TSMB) algorithm as…
We study the efficiency of an improved Multiboson algorithm with two flavours of Wilson fermions in a realistic physical situation ($\beta = 5.60$, $\kappa = 0.156$ on a $16^3 \times 24$ lattice). The performance of this exact algorithm is…
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…