Related papers: A Monte Carlo algorithm for spin foam intertwiners

State-of-the-art algorithms for simulating fermions coupled to gauge fields often rely on integrating fermion degrees of freedom. While successful in simulating QCD at zero chemical potential, at finite density these approaches are hindered…

The quantum transverse Ising model and its extensions play a critical role in various fields, such as statistical physics, quantum magnetism, quantum simulations, and mathematical physics. Although it does not suffer from the sign problem…

Monte Carlo simulations are one of the major tools in statistical physics, complex system science, and other fields, and an increasing number of these simulations is run on distributed systems like clusters or grids. This raises the issue…

We provide a detailed description of the path-integral Monte Carlo worm algorithm used to exactly calculate the thermodynamics of Bose systems in the canonical ensemble. The algorithm is fully consistent with periodic boundary conditions,…

The entanglement entropy probing novel phases and phase transitions numerically via quantum Monte Carlo has made great achievements in large-scale interacting spin/boson systems. In contrast, the numerical exploration in interacting fermion…

We introduce the feedforward neural network to attack the sign problem via the path optimization method. The variables of integration is complexified and the integration path is optimized in the complexified space by minimizing the cost…

Applications that require substantial computational resources today cannot avoid the use of heavily parallel machines. Embracing the opportunities of parallel computing and especially the possibilities provided by a new generation of…

Approximating integrals is a fundamental task in probability theory and statistical inference, and their applied fields of signal processing, and Bayesian learning, as soon as expectations over probability distributions must be computed…

We discuss the efficiency of Monte Carlo methods in solving continuum radiative transfer problems. The sampling of the radiation field and convergence of dust temperature calculations in the case of optically thick clouds are both studied.…

Quantum Monte Carlo simulations of quantum many body systems are plagued by the Fermion sign problem. The computational complexity of simulating Fermions scales exponentially in the projection time $\beta$ and system size. The sign problem…

This work shows that the recently discovered operator contraction identity for solving the discreet Path Integral of the harmonic oscillator can be applied equally to fermions in any dimension. This then yields an exactly solvable model for…

We present an optimized version of a cluster labeling algorithm previously introduced by the authors. This algorithm is well suited for large-scale Monte Carlo simulations of spin models using cluster dynamics on parallel computers with…

Sampling problems are widely regarded as the task for which quantum computers can most readily provide a quantum advantage. Leveraging this feature, the quantum-enhanced Markov chain Monte Carlo [Layden, D. et al., Nature 619, 282-287…

We present a novel and open-source implementation of the worm algorithm, which is an algorithm to simulate Bose-Hubbard and sign-positive spin models using a path integral representation of the partition function. The code can deal with…

We propose a highly efficient "worm" like cluster Monte Carlo algorithm for the quantum rotor model in the link-current representation. We explicitly prove detailed balance for the new algorithm even in the presence of disorder. For the…

In this paper we give explicit constructions of point sets in the $s$ dimensional unit cube yielding quasi-Monte Carlo algorithms which achieve the optimal rate of convergence of the worst-case error for numerically integrating high…

Many fascinating systems suffer from a severe (complex action) sign problem preventing us from calculating them with Markov Chain Monte Carlo simulations. One promising method to alleviate the sign problem is the transformation of the…

The Worldvolume Hybrid Monte Carlo (WV-HMC) method [arXiv:2012.08468] is a reliable and versatile algorithm for addressing the numerical sign problem. It resolves the ergodicity issues commonly encountered in Lefschetz thimble-based…

We investigate the performance of the hybrid Monte Carlo algorithm, the standard algorithm used for lattice QCD simulations involving fermions, in updating non-trivial global topological structures. We find that the hybrid Monte Carlo…

We develop a novel Monte Carlo algorithm for the vector consisting of the supremum, the time at which the supremum is attained and the position at a given (constant) time of an exponentially tempered L\'evy process. The algorithm, based on…