Simulation of n_f =3 QCD by Hybrid Monte Carlo

TL;DR

This paper explores simulating three-flavor QCD using the hybrid Monte Carlo algorithm with polynomial approximation, comparing its accuracy and efficiency to the R-algorithm, and demonstrating consistent results at small step sizes.

Contribution

It introduces a hybrid Monte Carlo approach for three-flavor QCD simulations and compares its performance with the R-algorithm, highlighting its accuracy at small step sizes.

Findings

Hybrid Monte Carlo results agree with R-algorithm at small step sizes.

The polynomial approximation effectively enables odd-flavor QCD simulations.

The study provides a basis for further development of accurate odd-flavor QCD algorithms.

Abstract

Simulations of odd flavors QCD can be performed in the framework of the hybrid Monte Carlo algorithm where the inverse of the fermion matrix is approximated by a polynomial. In this exploratory study we perform three flavors QCD simulations. We make a comparison of the hybrid Monte Carlo algorithm and the R-algorithm which also simulates odd flavors systems but has step-size errors. We find that results from our hybrid Monte Carlo algorithm are in agreement with those from the R-algorithm obtained at very small step-size.