Related papers: Progress in Lattice Field Theory Algorithms
Logarithmic Conformal Field Theories (LCFT) play a key role, for instance, in the description of critical geometrical problems (percolation, self avoiding walks, etc.), or of critical points in several classes of disordered systems…
The lattice formulation provides a way to regularize, define and compute the Path Integral in a Quantum Field Theory. In this paper we review the theoretical foundations and the most basic algorithms required to implement a typical lattice…
I present the recent developments in a specific sub-field of chiral gauge theories on the lattice. This sub-field pertains to the use of infinitely many fermi fields to describe a single chiral field. In this approach, both anomalous and…
We demonstrate that substantial progress can be achieved in the study of the phase structure of 4-dimensional compact QED by a joint use of hybrid Monte Carlo and multicanonical algorithms, through an efficient parallel implementation. This…
This letter is in response to a recent review by DeTar and Gottlieb about lattice QCD that has recently appeared in Physics Today. It also is partially motivated by a separate review written by DeGrand. My basic point is that one should be…
The substantial progress that has been achieved in lattice QCD in the last years is pointed out. I compare the simulation cost and systematic effects of several lattice QCD formulations and discuss a number of topics such as lattice spacing…
The credit on {\it reduction theory} goes back to the work of Lagrange, Gauss, Hermite, Korkin, Zolotarev, and Minkowski. Modern reduction theory is voluminous and includes the work of A. Lenstra, H. Lenstra and L. Lovasz who created the…
Recent progress in Lattice QCD is highlighted. After a brief introduction to the methodology of lattice computations the presentation focuses on three main topics: Hadron Spectroscopy, Hadron Structure and Lattice Flavor Physics. In each…
On the base of a Feynman-Kac--type formula involving Poisson stochastic processes, recently a Monte Carlo algorithm has been introduced, which describes exactly the real- or imaginary-time evolution of many-body lattice quantum systems. We…
We introduce a Monte-Carlo algorithm for the simulation of charged particles moving in the continuum. Electrostatic interactions are not instantaneous as in conventional approaches, but are mediated by a constrained, diffusing electric…
We study the kinematics of multigrid Monte Carlo algorithms by means of acceptance rates for nonlocal Metropolis update proposals. An approximation formula for acceptance rates is derived. We present a comparison of different coarse-to-fine…
We modified the recently proposed multicanonical MC algorithm for the case of a magnetic field driven order--order phase transition. We test this {\it multimagnetic} Monte Carlo algorithm for the D=2 Ising model at $\beta=0.5$ and simulate…
Simulating thimble regularization of lattice field theory can be tricky when more than one thimble is to be taken into account. A couple of years ago we proposed a solution for this problem. More recently this solution proved to be…
This contribution provides a pedagogical introduction to and review of the current status and ongoing progress in the development of Monte Carlo tools for the calculation and simulation of high-Q^2 processes in hadronic collisions.
I discuss various topics in relativistic non-equilibrium field theory related to high energy physics and cosmology. I focus on non-perturbative problems and how they can be treated on the lattice.
We discuss the Monte Carlo method of simulating lattice field theories as a means of studying the low-energy effective theory of graphene. We also report on simulational results obtained using the Metropolis and Hybrid Monte Carlo methods…
We point out that a newly introduced recursive algorithm for lattice polymers has a much wider range of applicability. In particular, we apply it to the simulation of off-lattice polymers with Lennard-Jones potentials between non-bonded…
Monte Carlo (MC) simulations of many systems, in particular those with conflicting constraints, can be considerably speeded up by using multicanonical or related methods. Some of these approaches sample with a-priori unknown weight factors.…
We present a trainable framework for efficiently generating gauge configurations, and discuss ongoing work in this direction. In particular, we consider the problem of sampling configurations from a 4D $SU(3)$ lattice gauge theory, and…
We present algorithms for classification of linear codes over finite fields, based on canonical augmentation and on lattice point enumeration. We apply these algorithms to obtain classification results over fields with 2, 3 and 4 elements.…