New algorithms for finite density QCD
Oct 31, 201415 pages
Published in:
- PoS LATTICE2014 (2014) 016
Contribution to:
- , 016
- Lattice 2014
- Published: Nov 4, 2014 by SISSA
e-Print:
- 1410.8813 [hep-lat]
DOI:
View in:
Citations per year
Abstract: (arXiv)
Recent progress of the complex Langevin method and the Lefschetz thimble in connection with the sign problem is reviewed. These methods rely on the complexification of the original field manifold and they allow direct simulations of theories with non-real measures. Similarities and differences of the two approaches are pointed out. Results using the complex Langevin method, which allows simulations to evade the sign problem in full QCD, are presented. Promising results of the thimble approach for non-gauge theories are also discussed.Note:
- 15 pages, 7 figures, plenary talk at the 32nd International Symposium on Lattice Field Theory (23-28 June 2014, Columbia University, New York, NY, USA), typos corrected
- quantum chromodynamics: density
- density: finite
- review
- potential: chemical
- quantum chromodynamics: lattice
- numerical calculations
- Langevin equation: complex
- gauge field theory: SU(N)
- toy model
- quark: Wilson
References(47)
Figures(13)
- [1]
- [2]
- [3]
- [4]
- [5]
- [6]
- [7]
- [7]
- [7]
- [8]
- [8]
- [9]
- [10]
- [11]
- [12]
- [12]
- [13]
- [14]
- [15]
- [16]
- [16]
- [17]
- [18]
- [19]
- [20]