Related papers: A comparison of updating algorithms for large N re…
State-of-the-art simulations of discrete gauge theories are based on Markov chains with local changes in the field space, which however at very fine lattice spacings are notoriously difficult due to separated topological sectors of the…
We present an efficient low-rank updating algorithm for updating the trial wavefunctions used in Quantum Monte Carlo (QMC) simulations. The algorithm is based on low-rank updating of the Slater determinants. In particular, the computational…
At fine lattice spacings, Markov chain Monte Carlo simulations of QCD and other gauge theories with or without fermions are plagued by slow modes that give rise to large autocorrelation times. This can lead to simulation runs that are…
We describe a Fourier Accelerated Hybrid Monte Carlo algorithm suitable for dynamical fermion simulations of non-gauge models. We test the algorithm in supersymmetric quantum mechanics viewed as a one-dimensional Euclidean lattice field…
We present an effcient Monte-Carlo method for lattice glass models which are characterized by hard constraint conditions. The basic idea of the method is similar to that of the $N$-fold way method. By using a list of sites into which we can…
This review gives an overview on the research of algorithms for dynamical fermions used in large scale lattice QCD simulations. First a short overview on the state-of-the-art of ensemble generation at the physical point is given. Followed…
An overview is given over the recently developed and now widely used Monte Carlo algorithms with reduced or eliminated critical slowing down. The basic techniques are overrelaxation, cluster algorithms and multigrid methods. With these…
We develop the self-learning Monte Carlo (SLMC) method, a general-purpose numerical method recently introduced to simulate many-body systems, for studying interacting fermion systems. Our method uses a highly-efficient update algorithm,…
Within ab initio Quantum Monte Carlo simulations, the leading numerical cost for large systems is the computation of the values of the Slater determinants in the trial wavefunction. Each Monte Carlo step requires finding the determinant of…
We continue the investigation on the applications of the Kramers equation to the numerical simulation of field theoretic models. In a previous paper we have described the theory and proposed various algorithms. Here, we compare the simplest…
We study the validity of the large-N equivalence between four-dimensional SU(N) lattice gauge theory and its momentum quenched version--the Quenched Eguchi-Kawai (QEK) model. We find that the assumptions needed for the proofs of equivalence…
We propose a new algorithm which works effectively in global updates in Monte Carlo study. We apply it to the quantum spin chain with next-nearest-neighbor interactions. We observe that Monte Carlo results are in excellent agreement with…
We simulate $4d$ $SU(N)$ pure-gauge theories at large $N$ using a parallel tempering scheme that combines simulations with open and periodic boundary conditions, implementing the algorithm originally proposed by Martin Hasenbusch for $2d$…
In theories with topological sectors, such as lattice QCD and four-dimensional SU(N) gauge theories with periodic boundary conditions, conventional update algorithms suffer from topological freezing due to large action barriers separating…
This project investigates the applicability of quasi-Monte Carlo methods to Euclidean lattice systems in order to improve the asymptotic error scaling of observables for such theories. The error of an observable calculated by averaging over…
TEK reduction is a well-established technique that allows single-site simulations of Yang-Mills theory in the large-$N_c$ limit by exploiting volume reduction induced by twisted boundary conditions. We performed simulations for $SU(841)$…
We identify a new element in quantum simulations of lattice gauge theories, arising from spacetime-dependent quantum corrections in the relation between the link variables defined on the lattice and their continuum counterparts. While in…
We have simulated the three-dimensional Heisenberg model on simple cubic lattices, using the single-cluster Monte Carlo update algorithm. The expected pronounced reduction of critical slowing down at the phase transition is verified. This…
With the developed "extended Monte Calro" (EMC) algorithm, we have studied the depinning transition in Ising-type lattice models by extensive numerical simulations, taking the random-field Ising model with a driving field and the driven…
For spin rotational symmetric models with a positive-definite high-temperature expansion of the partition function, a stochastic sampling of the series expansion upon partial resummation becomes logically equivalent to sampling an…