Improvements of the local bosonic algorithm
B. Jegerlehner
Abstract
We report on several improvements of the local bosonic algorithm proposed by M. Luescher. We find that preconditioning and over-relaxation works very well. A detailed comparison between the bosonic and the Kramers-algorithms shows comparable performance for the physical situation examined.
Create a lesson
Related papers
Efficient Quantum Simulations of Yang-Mills theory with Maximal-tree Gauge
Tianyin Li, Ying-Ying Li, Xiaoyang Wang et al.
Physics-informed quantum algorithms for glueball-like excitations in a Z2 lattice gauge theory
Dan-Bo Zhang
Anomalous behavior of Wilson fermions in the presence of monopoles
Manuel Cortina, Rajamani Narayanan, Ray Romero
Direct lattice QCD calculation of the θ-induced CP-violating pion-nucleon coupling
Chuan-Yang Li, Jun Hua, Jian Liang et al.
Calculation of neutron electric dipole moment from Lattice QCD
Thomas Blum, Fangcheng He, Taku Izubuchi et al.
Exponential-in-Nc2 cost reduction of product-formula-based quantum simulations of quantum chromodynamics
Zohreh Davoudi, Jesse R. Stryker