English
Related papers

Related papers: Worm Algorithm for CP(N-1) Model

200 papers

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…

High Energy Physics - Lattice · Physics 2007-05-23 Philippe de Forcrand

We present the ground state extension of the efficient quantum Monte Carlo algorithm for lattice fermions of arXiv:1411.0683. Based on continuous-time expansion of imaginary-time projection operator, the algorithm is free of systematic…

Strongly Correlated Electrons · Physics 2015-07-02 Lei Wang , Mauro Iazzi , Philippe Corboz , Matthias Troyer

A detailed description is provided of a new Worm Algorithm, enabling the accurate computation of thermodynamic properties of quantum many-body systems in continuous space, at finite temperature. The algorithm is formulated within the…

Computational Physics · Physics 2009-11-11 M. Boninsegni , N. V. Prokof'ev , B. V. Svistunov

We present the first results of the PACS-CS project which aims to simulate 2+1 flavor lattice QCD on the physical point with the nonperturbatively $O(a)$-improved Wilson quark action and the Iwasaki gauge action. Numerical simulations are…

We perform numerical simulations of lattice QCD with two flavors of dynamical overlap quarks, which have exact chiral symmetry on the lattice. While this fermion discretization is computationally demanding, we demonstrate the feasibility to…

We present results for lattice QCD with staggered fermions in the limit of infinite gauge coupling, obtained from a worm-type Monte Carlo algorithm on a discrete spatial lattice but with continuous Euclidean time. This is achieved by…

High Energy Physics - Lattice · Physics 2011-11-08 Wolfgang Unger , Philippe de Forcrand

State-of-the-art algorithms for simulating fermions coupled to gauge fields often rely on integrating fermion degrees of freedom. While successful in simulating QCD at zero chemical potential, at finite density these approaches are hindered…

High Energy Physics - Lattice · Physics 2024-02-05 Joao C. Pinto Barros , Thea Budde , Marina Krstic Marinkovic

We propose a flux representation based lattice formulation of the partition function corresponding to the SU(2) principal chiral Lagrangian, including a chemical potential and scalar/pseudo-scalar source terms. Lattice simulations are then…

High Energy Physics - Lattice · Physics 2015-12-18 Tobias Rindlisbacher , Philippe de Forcrand

In this paper, we study the 3D $N_{\rm f}$-flavor CP$^1$ model (a set of $N_{\rm f}$ CP$^1$ variables) coupled with a dynamical compact U(1) gauge field by means of Monte-Carlo simulations. This model is relevant to 2D $s=1/2$ quantum spin…

Strongly Correlated Electrons · Physics 2014-11-17 Shunsuke Takashima , Ikuo Ichinose , Tetsuo Matsui

We investigate the s-wave $\Lambda_c-N$ interaction for spin singlet systems($^1S_0$) using the HAL QCD method. In our lattice QCD simulations, we employ gauge configurations generated by the PACS-CS Collaboration at $a = 0.0907(13)$ fm on…

High Energy Physics - Lattice · Physics 2018-04-13 Takaya Miyamoto , for HAL QCD Collaboration

We investigate the extension of the Prokof'ev-Svistunov worm algorithm to Wilson lattice fermions in an external scalar field. We effectively simulate by Monte Carlo the graphs contributing to the hopping expansion of the two-point function…

High Energy Physics - Lattice · Physics 2009-04-02 Ulli Wolff

The supercomputing platforms available for high performance computing based research evolve at a great rate. However, this rapid development of novel technologies requires constant adaptations and optimizations of the existing codes for…

High Energy Physics - Lattice · Physics 2017-02-23 Marina Krstic Marinkovic , Luka Stanisic

We present a method of simulating lattice QCD at nonzero chemical potential in the chiral limit. By adding a weak four-fermi interaction to the standard staggered fermion SU(3) QCD action, we produce an algorithm in which the limit of…

High Energy Physics - Lattice · Physics 2009-10-28 I. M. Barbour , S. E. Morrison , John B. Kogut

We introduce a generalized worldline model where the partition function is a sum over configurations of a conserved flux on a d-dimensional lattice. The weights for the configurations of the corresponding worldlines have factors living on…

High Energy Physics - Lattice · Physics 2017-02-17 Mario Giuliani , Christof Gattringer

We propose a modification of the Hybrid-Monte-Carlo algorithm that allows for a larger step-size of the integration scheme at constant acceptance rate. The key ingredient is the splitting of the pseudo-fermion action into two parts. We test…

High Energy Physics - Lattice · Physics 2015-06-25 M. Hasenbusch , K. Jansen

We work the lattice fermions and non-Hermitian formulation in the 2D GNY model and demonstrate the numerical implementation for two flavors by the Hybrid Monte Carlo. Our approach has a notable advantage in dealing with chiral symmetry on a…

High Energy Physics - Theory · Physics 2024-07-12 Xingyu Guo , Chen-Te Ma , Hui Zhang

We present the results of the physical point simulation in 2+1 flavor lattice QCD with the nonperturbatively $O(a)$-improved Wilson quark action and the Iwasaki gauge action at $\beta=1.9$ on a $32^3 \times 64$ lattice. The physical quark…

Simulating noninteracting fermion systems is a common task in computational many-body physics. In absence of translational symmetries, modeling free fermions on $N$ modes usually requires poly$(N)$ computational resources. While often…

Quantum Physics · Physics 2026-02-24 Maarten Stroeks , Daan Lenterman , Barbara Terhal , Yaroslav Herasymenko

We demonstrate that the ``worm'' algorithm allows very effective and precise quantum Monte Carlo (QMC) simulations of spin systems in a magnetic field, and its auto-correlation time is rather insensitive to the value of H at low…

Strongly Correlated Electrons · Physics 2007-05-23 V. A. Kashurnikov , N. V. Prokof'ev , B. V. Svistunov , M. Troyer

We give a deterministic algorithm for solving the (1+eps)-approximate Closest Vector Problem (CVP) on any n dimensional lattice and any norm in 2^{O(n)}(1+1/eps)^n time and 2^n poly(n) space. Our algorithm builds on the lattice point…

Data Structures and Algorithms · Computer Science 2013-01-01 Daniel Dadush , Gabor Kun
‹ Prev 1 3 4 5 6 7 10 Next ›