Related papers: Study of a new simulation algorithm for dynamical …
The increase with time of computer resources devoted to simulations of full QCD is spectacular. Yet the reduction of systematic errors is comparatively slow. This is due to the algorithmic complexity of the problem. I review, in elementary…
We study improved variants of L\"uscher's algorithm, including the cases of staggered fermions and finite density.
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…
In the simplified setting of the Schwinger model we present a systematic study on the simulation of dynamical fermions by global accept/reject steps that take into account the fermion determinant. A family of exact algorithms is developed,…
Simulating quantum many-body systems is a highly demanding task since the required resources grow exponentially with the dimension of the system. In the case of fermionic systems, this is even harder since nonlocal interactions emerge due…
We provide a measurement protocol to estimate 2- and 4-point fermionic correlations in ultra-cold atom experiments. Our approach is based on combining random atomic beam splitter operations, which can be realized with programmable optical…
An overview over the current state of algorithms for dynamical fermion simulations is given. In particular some insight into the functioning of the determinant spitting techniques is discussed. The critical slowing down of the simulations…
The general scheme for the treatment of relaxation processes and temporal autocorrelations of dynamical variables for many particle systems is presented in framework of the recurrence relations approach. The time autocorrelation functions…
The quantum approximate optimisation algorithm was proposed as a heuristic method for solving combinatorial optimisation problems on near-term quantum computers and may be among the first algorithms to perform useful computations in the…
We propose a theory to describe fermion mixing. The theory respects the maximal abelian family symmetries which are spontaneously broken down at a large scale. We find that quark mixing can be well described in this theory. Some concrete…
The improvement of simulations of QCD with dynamical Wilson fermions by combining the Hybrid Monte Carlo algorithm with parallel tempering is studied. As an indicator for decorrelation the topological charge is used.
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…
We discuss a simulation algorithm for dynamical fermions, which combines the multiboson technique with the Hybrid Monte Carlo algorithm. The algorithm turns out to give a substantial gain over standard methods in practical simulations and…
We discuss the impact of various improvements on simulations of dynamical overlap fermions using the Hybrid Monte Carlo algorithm. We focus on the usage of fat links and multiple pseudo-fermion fields.
Self-learning Monte Carlo method [arXiv:1610.03137, 1611.09364] is a powerful general-purpose numerical method recently introduced to simulate many-body systems. In this work, we implement this method in the framework of determinantal…
An overview of the current status of algorithmic approaches to dynamical overlap fermions is given. In particular the issue of changing the topological sector is discussed.
An exact, nonlocal, finite step-size algorithm for Monte Carlo simulation of theories with dynamical fermions is proposed. The algorithm is based on obtaining the new configuration U' from the old one U by solving the equation $ M(U') \eta…
We present details of our investigation of the Parallel Tempering algorithm. We consider the application of action matching technology to the selection of parameters. We then present a simple model of the autocorrelations for a particular…
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…
We performed dynamical simulations with HYP smeared staggered fermions using the recently proposed partial-global stochastic Metropolis algorithm with fermion matrix reduction and determinant breakup improvements. In this paper we discuss…