Optimisation of complex integration contours at higher order
Open Access
- 19 April 2021
- journal article
- research article
- Published by Springer Nature in Journal of High Energy Physics
- Vol. 2021 (4) , 1-30
Abstract
We continue our study of contour deformation as a practical tool for dealing with the sign problem using the d-dimensional Bose gas with non-zero chemical potential as a toy model. We derive explicit expressions for contours up to the second order with respect to a natural small parameter and generalise these contours to an ansatz for which the evaluation of the Jacobian is fast (O(1)). We examine the behaviour of the various proposed contours as a function of space-time dimensionality, the chemical potential, and lattice size and geometry and use the mean phase factor as a measure of the severity of the sign problem. In turns out that this method leads to a substantial reduction of the sign problem and that it becomes more efficient as space-time dimensionality is increased. Correlations among contributions to Im 〈S〉 play a key role in determining the mean phase factor and we examine these correlations in detail.Keywords
All Related Versions
This publication has 20 references indexed in Scilit:
- Fast estimator of Jacobians in the Monte Carlo integration on Lefschetz thimblesPhysical Review D, 2016
- Monte Carlo algorithm for simulating fermions on Lefschetz thimblesPhysical Review D, 2016
- New approach to the sign problem in quantum field theories: High density QCD on a Lefschetz thimblePhysical Review D, 2012
- Complex Langevin method: When can it be trusted?Physical Review D, 2010
- Complex Langevin dynamics at finite chemical potential: mean field analysis in the relativistic Bose gasJournal of High Energy Physics, 2009
- Pressure and nonlinear susceptibilities in QCD at finite chemical potentialsPhysical Review D, 2003
- Finite density QCD via an imaginary chemical potentialPhysical Review D, 2003
- The QCD phase diagram for small densities from imaginary chemical potentialNuclear Physics B, 2002
- Matrix multiplication via arithmetic progressionsJournal of Symbolic Computation, 1990
- Gaussian elimination is not optimalNumerische Mathematik, 1969