The Complex Langevin method: When can it be trusted?
Gert Aarts, Erhard Seiler, Ion-Olimpiu Stamatescu
TL;DR
The paper analyzes when the complex Langevin method reliably solves sign problems by deriving formal connections between complex and real-measure expectations for holomorphic observables, while highlighting boundary-term loopholes that can invalidate those connections. Through detailed case studies of the U(1) one-link model and the Guralnik–Pehlevan model, it demonstrates that convergence to correct limits is delicate: with $N_I=0$ the method can reproduce correct results, but for $N_I>0$ boundary effects can drive convergence to wrong limits. The work emphasizes the crucial role of imaginary-direction decay in the equilibrium distribution and advocates practical safeguards—primarily using $N_I$ as small as feasible and validating against trusted methods—to ensure credible results in applications to more complex theories. Overall, it provides a pragmatic map of when CLE is trustworthy and how to diagnose and mitigate failures arising from boundary terms and poor decay in the imaginary directions.
Abstract
We analyze to what extent the complex Langevin method, which is in principle capable of solving the so-called sign problems, can be considered as reliable. We give a formal derivation of the correctness and then point out various mathematical loopholes. The detailed study of some simple examples leads to practical suggestions about the application of the method.
