2000 character limit reached
Convex optimization and contour deformations
Published 21 Nov 2023 in hep-lat | (2311.13002v2)
Abstract: We discuss various formal aspects of contour deformations used to alleviate sign problems; most importantly, relating these contour deformations to a certain convex optimization problem. As a consequence of this connection we describe a general method for proving upper bounds on the average phase achievable by the contour deformation method. Using this method we show that Abelian lattice Yang-Mills in two spacetime dimensions possesses, for many values of the complex coupling, an exponential sign problem that cannot be removed via any contour deformation.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.