Related papers: The Kramers equation simulation algorithm II. An a…
We report on simulations with two flavors of O(a) improved degenerate Wilson fermions with Schroedinger functional boundary conditions. The algorithm which is used is Hybrid Monte Carlo with two pseudo-fermion fields as proposed by M.…
The Hybrid Monte Carlo algorithm is adapted to the simulation of a system of classical degrees of freedom coupled to non self-interacting lattices fermions. The diagonalization of the Hamiltonian matrix is avoided by introducing a…
We study aspects concerning numerical simulations of Lattice QCD with two flavors of dynamical Ginsparg-Wilson quarks with degenerate masses. A Hybrid Monte Carlo algorithm is described and the formula for the fermionic force is derived for…
Answering whether quantum computers can efficiently simulate quantum field theories has both theoretical and practical motivation. From the theoretical point of view, it answers the question of whether a hypothetical computer that utilizes…
We present a simulation algorithm for Wilson fermions based on the exact hopping expansion of the fermion action. The algorithm essentially eliminates critical slowing down by sampling the fermionic two-point correlation function and it…
We investigate the algorithms for dynamical overlap fermions aiming at improving the performance for large-scale simulations. We look for the best combination of Hybrid Monte Carlo options and iterative quark solvers with respect to the…
Parallel tempering simulates at many quark masses simultaneously, by changing the mass during the simulation while remaining in equilibrium. The algorithm is faster than pure HMC if more than one mass is needed, and works better the smaller…
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…
We investigate the performance of the hybrid Monte Carlo algorithm, the standard algorithm used for lattice QCD simulations involving fermions, in updating non-trivial global topological structures. We find that the hybrid Monte Carlo…
As a prerequisite to dynamical fermion simulations a detailed study of optimal parameters and scaling behavior is conducted for the quenched Schr\"odinger functional at fixed renormalized coupling. We compare standard hybrid overrelaxation…
We test the scaling behaviour of Wilson, hypercube, maximally twisted mass and overlap fermion actions in dynamical simulations of the 2-dimensional massive Schwinger model. We also present possibilities to simulate overlap fermions…
Monte Carlo simulation using a combination of Wang Landau (WL) and Transition Matrix (TM) Monte Carlo algorithms to simulate two lattice spin models with continuous energy is described. One of the models, the one dimensional Lebwohl-Lasher…
The design of particle simulation methods for collisional plasma physics has always represented a challenge due to the unbounded total collisional cross section, which prevents a natural extension of the classical Direct Simulation Monte…
A quantum algorithm to simulate the real time dynamics of two-flavor massive Gross-Neveu model is presented in Schrodinger picture. We implement the simulation on a classic computer by applying the matrix product state representation. The…
The principle and the efficiency of the Monte Carlo transfer-matrix algorithm are discussed. Enhancements of this algorithm are illustrated by applications to several phase transitions in lattice spin models. We demonstrate how the…
The (discrete) Gross-Neveu model is studied in a lattice realization with an N-component Majorana Wilson fermion field. It has an internal O(N) symmetry in addition to the euclidean lattice symmetries. The discrete chiral symmetry for…
Large N gauge theories with adjoint matter can be numerically studied using lattice techniques. Eguchi-Kawai reductions holds for this theory and one can reduce the lattice model to a single site. Hybrid Monte Carlo algorithm can be used to…
Quantum computing is a promising way to systematically solve the longstanding computational problem, the ground state of a many-body fermion system. Many efforts have been made to realise certain forms of quantum advantage in this problem,…
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 present an efficient Monte Carlo algorithm for the simulation of the two-dimensional Random Field Ising Model (RFIM). The method combines the event-driven, rejection-free character of the Bortz Kalos-Lebowitz (BKL) algorithm with Glauber…