Related papers: Simulating gauge theories on Lefschetz thimbles
The multilevel blocking algorithm recently proposed as a possible solution to the sign problem in path-integral Monte Carlo simulations has been extended to systems with long-ranged interactions along the Trotter direction. As an…
We calculate the mean link in Landau gauge for Wilson and improved SU(3) anisotropic gauge actions, using two loop perturbation theory and Monte Carlo simulation employing an accelerated Langevin algorithm. Twisted boundary conditions are…
The sign problem is a notorious problem, which occurs in Monte Carlo simulations of a system with a partition function whose integrand is not positive. One way to simulate such a system is to use the factorization method where one enforces…
Quantum and tensor network simulations have emerged as prominent sign-problem free approaches to lattice gauge theories. Unlike conventional Markov chain Monte Carlo methods, they are based on the Hamiltonian formulation. In this talk, we…
Gauge problem of monopole dynamics is studied in SU(2) lattice gauge theory. We study first abelian and monopole contributions to the static potential in four smooth gauges, i.e., Laplacian Abelian (LA), Maximally Abelian Wilson Loop (MAWL)…
State-of-the-art algorithms in lattice gauge theory typically rely heavily on detailed balance, which is an instrumental tool to prove the correct convergence of the Markov Chain Monte Carlo Algorithm. In this work, we investigate an…
Sampling topological quantities in the Monte Carlo simulation of Lattice Gauge Theory becomes challenging as we approach the continuum limit of the theory. In this work, we introduce a Conditional Normalizing Flow (C-NF) model to sample…
Quantum simulations of High Energy Physics, and especially of gauge theories, is an emerging and exciting direction in quantum simulations. However, simulations of such theories, compared to simulations of condensed matter physics, must…
We investigate reversibility violations in the Hybrid Monte Carlo algorithm. Those violations are inevitable when computers with finite numerical precision are being used. In SU(2) gauge theory, we study the dependence of observables on the…
The versatile technology of cold atoms confined in optical lattices allows the creation of a vast number of lattice geometries and interactions, providing a promising platform for emulating various lattice models. This opens the possibility…
We introduce a robust numerical method for determining intersection numbers of Lefschetz thimbles in multivariable settings. Our approach employs the multiple shooting method to solve the upward flow equations from the saddle points to the…
Lattice field theories with complex actions are not easily studied using conventional analytic or simulation methods. However, a large class of these models are invariant under CT, where C is charge conjugation and T is time reversal,…
Ab-initio studies of strongly interacting bosonic and fermionic systems is greatly facilitated by efficient Monte Carlo algorithms. This article emphasizes this requirement, and outlines the ideas behind the construction of the cluster…
We present a simple trick that allows to consider the sum of all connected Feynman diagrams at fixed position of interaction vertices for general fermionic models. With our approach one achieves superior performance compared to Diagrammatic…
Outlined in this paper is a description of \emph{equivariance} in the world of 2-dimensional extended topological quantum field theories, under a topological action of compactLie groups. In physics language, I am gauging the theories ---…
Can high energy physics be simulated by low-energy, non-relativistic, many-body systems, such as ultracold atoms? Such ultracold atomic systems lack the type of symmetries and dynamical properties of high energy physics models: in…
Quantum technologies offer the prospect to efficiently simulate sign-problem afflicted regimes in lattice field theory, such as the presence of topological terms, chemical potentials, and out-of-equilibrium dynamics. In this work, we derive…
Quantum Monte Carlo simulations of fermions are hampered by the notorious sign problem whose most striking manifestation is an exponential growth of sampling errors with the number of particles. With the sign problem known to be an NP-hard…
We study one-dimensional QCD at finite quark density by using the sign optimization framework. The fermion sign problem is mitigated by deforming the path integral domain, $SU(3)$ to a complexified one ${\cal M} \subset SL(3)$, explicitly…
The multi-level algorithm allows, at least for pure gauge theories, reliable measurement of exponentially small expectation values. The implementation of the algorithm depends strongly on the observable one wants to measure. Here we report…