Related papers: Some aspects of simulation algorithms for dynamica…
A new algorithm for simulation of theories with dynamical fermions is presented. The algorithm is based on obtaining the new configuration U' from the old one U by solving the equation M(U')\eta= \omega M(U)\eta, where M is fermionic…
We introduce a new algorithm which we call the {Rational Hybrid Monte Carlo} Algorithm (RHMC). This method uses a rational approximation to the fermionic kernel together with a noisy Kennedy-Kuti acceptance step to give an efficient…
We discuss the lattice formulation of gauge theories with fermions in arbitrary representations of the color group, and present the implementation of the RHMC algorithm for simulating dynamical Wilson fermions. A first dataset is presented…
Cluster algorithms have been recently used to eliminate sign problems that plague Monte-Carlo methods in a variety of systems. In particular such algorithms can also be used to solve sign problems associated with the permutation of fermion…
Hasenbusch has proposed splitting the pseudo-fermionic action into two parts, in order to speed-up Hybrid Monte Carlo simulations of QCD. We have tested a different splitting, also using clover-improved Wilson fermions. An additional…
The entanglement entropy probing novel phases and phase transitions numerically via quantum Monte Carlo has made great achievements in large-scale interacting spin/boson systems. In contrast, the numerical exploration in interacting fermion…
We discuss differences and similarities between variational Monte Carlo approaches that use conventional and artificial neural network parameterizations of the ground-state wave function for systems of fermions. We focus on a relatively…
A recent reformulation [1] of the problem of Coulomb gases in the presence of a dynamical dielectric medium showed that finite temperature simulations of such systems can be accomplished on the basis of completely local Hamiltonians on a…
We describe an algorithm for dynamic load balancing of geometrically parallelized synchronous Monte Carlo simulations of physical models. This algorithm is designed for a (heterogeneous) multiprocessor system of the MIMD type with…
We study the opportunities for parallelism for the simulation of surface reactions. We introduce the concept of a partition and we give new simulation methods based on Cellular Automaton using partitions. We elaborate on the advantages and…
We analyze the accuracy and sample complexity of variational Monte Carlo approaches to simulate the dynamics of many-body quantum systems classically. By systematically studying the relevant stochastic estimators, we are able to: (i) prove…
A potential approach for demonstrating quantum advantage is using quantum computers to simulate fermionic systems. Quantum algorithms for fermionic system simulation usually involve the Hamiltonian evolution and measurements. However, in…
The scalability of massively parallel algorithms is a fundamental question in computer science. We study the scalability and the efficiency of a conservative massively parallel algorithm for discrete-event simulations where the discrete…
We discuss our implementation of dynamical Ginsparg-Wilson type fermions using a stout-smeared chirally improved Dirac operator. Such operators have been studied extensively in quenched calculations within the Bern-Graz-Regensburg (BGR)…
We report performance benchmarks for several algorithms that we have used to simulate the Schr"odinger functional with two flavors of dynamical quarks. They include hybrid and polynomial hybrid Monte Carlo with preconditioning. An appendix…
We introduce a dynamical fermion algorithm which is based on the hybrid Monte Carlo (HMC) algorithm, but without pseudofermions. The molecular dynamics steps in HMC are retained except the derivatives with respect to the gauge fields are…
We propose a new method for Hybrid Monte Carlo (HMC) simulations with odd numbers of dynamical fermions on the lattice. It employs a different approach from polynomial or rational HMC. In this method, gamma-five hermiticity of the lattice…
The development of Monte Carlo algorithms for generating gauge field configurations with dynamical fermions and methods for extracting the most information from ensembles are summarised.
We consider dynamically constrained Monte-Carlo dynamics and show that this leads to the generation of long ranged effective interactions. This allows us to construct a local algorithm for the simulation of charged systems without ever…
Smeared link fermionic actions can be straightforwardly simulated with partial-global updating. The efficiency of this simulation is greatly increased if the fermionic matrix is written as a product of several near-identical terms. Such a…