相关论文: Fermionic Monte Carlo algorithms for lattice QCD

We present a new Monte Carlo algorithm for simulating quantum spin systems which is able to suppress the negative sign problem. This algorithm has only a linear complexity in the lattice size used for the simulation. A general description…

Lattice gauge theories coupled to fermionic matter account for many interesting phenomena in both high energy physics and condensed matter physics. Certain regimes, e.g. at finite fermion density, are difficult to simulate with traditional…

We show that in practical simulations of lattice QCD with two dynamical light fermion species the PHMC algorithm samples configuration space differently from the commonly used HMC algorithm.

We revisit the infinite variance problem in fermionic Monte Carlo simulations, which is widely encountered in areas ranging from condensed matter to nuclear and high-energy physics. The different algorithms, which we broadly refer to as…

We propose an efficient method for Monte Carlo simulation of quantum lattice models. Unlike most other quantum Monte Carlo methods, a single run of the proposed method yields the free energy and the entropy with high precision for the whole…

At nonzero quark chemical potential dynamical lattice simulations of QCD are hindered by the sign problem caused by the complex fermion determinant. The severity of the sign problem can be assessed by the average phase of the fermion…

Developments in QCD at finite density are reviewed. I begin by discussing some new algorithms which have been applied to other theories with sign problems. Then I discuss the method of analytic continuation in QCD using a series expansion…

Capitalizing on recent advances in lattice QCD, we present a calculation of the leptonic decay constants f_{B_s} and f_{D_s} that includes effects of one strange sea quark and two light sea quarks. The discretization errors of improved…

We present a simulation algorithm for dynamical fermions that combines the multiboson technique with the Hybrid Monte Carlo algorithm. We find that the algorithm gives a substantial gain over the standard methods in practical simulations.…

Building on recent solutions of the fermion sign problem for specific models we present two continuous-time quantum Monte Carlo methods for efficient simulation of mass-imbalanced Hubbard models on bipartite lattices at half-filling. For…

It is not possible, using standard lattice techniques in Euclidean space, to calculate the complete fermionic spectrum of a quantum field theory. Algorithms running on quantum computers have the potential to access the theory with real-time…

We discuss a machine learning (ML) regression model to reduce the computational cost of disconnected diagrams in lattice QCD calculations. This method creates a mapping between the results of fermionic loops computed at different quark…

I review the basic ideas behind lattice QCD calculations that involve charm and bottom quarks. I report on the progress in getting the correct hyperfine splitting in charmonium from lattice QCD. Some of the basic technology behind numerical…

Continuous-time determinantal algorithm is proposed for the quantum Monte Carlo simulation of the interacting fermions. The scheme does not invoke Hubbard-Stratonovich transformation. The fermionic action is divided into two parts. One of…

This review concentrates on progress in lattice QCD during the last two years and, particularly, its impact on phenomenology. The two main technical developments have been successful implementations of lattice actions with exact chiral…

In the last century the non-perturbative regularization of chiral fermions was a long-standing problem. We review how this problem was finally overcome by the formulation of a modified but exact form of chiral symmetry on the lattice. This…

This paper summarizes a research program that has been underway for a decade. The objective is to find a fast and accurate scheme for solving quantum problems which does not involve a Monte Carlo algorithm. We use an alternative strategy…

Lattice QCD is notorious for its computational expense. Modern lattice simulations require large-scale computational resources to handle the large number of Dirac operator inversions used to construct correlation functions. Machine learning…

The derivation of the Feynman rules for lattice perturbation theory from actions and operators is complicated, especially for highly improved actions such as HISQ. This task is, however, both important and particularly suitable for…

The linked cell list algorithm is an essential part of molecular simulation software, both molecular dynamics and Monte Carlo. Though it scales linearly with the number of particles, there has been a constant interest in increasing its…