Related papers: CP$^{N-1}$ model with the theta term and maximum e…
Monte Carlo simulations of systems with a complex action are known to be extremely difficult. A new approach to this problem based on a factorization property of distribution functions of observables has been proposed recently. The method…
CP(N-1) model with topological term is numerically studied. The topological charge distribution P(Q) is calculated and then transformed to the partition function Z($\theta$) as a function of $\theta$ parameter. In the strong coupling…
We present computer simulations of a dynamic Monte Carlo algorithm for polymer chains on the FCC lattice which takes explicitly into account the possibility to overcome topological constraints by controlling the rate at which nearby polymer…
Quantum field theories (QFTs) at finite densities of matter generically involve complex actions. Standard Monte-Carlo simulations based upon importance sampling, which have been producing quantitative first principle results in particle…
Certain models with purely repulsive pair interactions can form cluster crystals with multiply-occupied lattice sites. Simulating these models' equilibrium properties is, however, quite challenging. Here, we develop an expanded…
With the developed "extended Monte Calro" (EMC) algorithm, we have studied the depinning transition in Ising-type lattice models by extensive numerical simulations, taking the random-field Ising model with a driving field and the driven…
Monte-Carlo sampling of lattice model Hamiltonians is a well-established technique in statistical mechanics for studying the configurational entropy of crystalline materials. When species to be distributed on the lattice model carry charge,…
We numerically study the single-flavor Schwinger model with a topological $\theta$-term, which is practically inaccessible by standard lattice Monte Carlo simulations due to the sign problem. By using numerical methods based on tensor…
In order to check the validity and the range of applicability of the 1/N expansion, we performed numerical simulations of the two-dimensional lattice CP(N-1) models at large N, in particular we considered the CP(20) and the CP(40) models.…
We apply the higher-order tensor renormalization group to the lattice CP($N-1$) model in two dimensions. A tensor network representation of the CP($N-1$) model in the presence of the $\theta$ term is derived. We confirm that the numerical…
We define a fixed point action in two-dimensional lattice CP^{N-1} models. The fixed point action is a classical perfect lattice action, which is expected to show strongly reduced cut-off effects in numerical simulations. Furthermore, the…
The Monte Carlo calculation of R\'enyi entanglement entropies $S^{}_n$ of interacting fermions suffers from a well-known signal-to-noise problem, even for a large number of situations in which the infamous sign problem is absent. A few…
We numerically study the phase structure of the CP(1) model in the presence of a topological $\theta$-term, a regime afflicted by the sign problem for conventional lattice Monte Carlo simulations. Using a bond-weighted tensor…
The shell model Monte Carlo (SMMC) method is a powerful method for calculating exactly (up to statistical errors) thermal observables and statistical properties of atomic nuclei. However, its application has been limited by a sign problem…
The quantum theory of antiferromagnetism in metals is necessary for our understanding of numerous intermetallic compounds of widespread interest. In these systems, a quantum critical point emerges as external parameters (such as chemical…
This paper presents a method for alleviating sign problems in lattice path integrals, including those associated with finite fermion density in relativistic systems. The method makes use of information gained from some systematic expansion…
We present a new Monte Carlo algorithm for simulating quantum spin systems which is able to suppress the negative sign problem. This algorithm has only a linear complexity in the lattice size used for the simulation. A general description…
In lattice QCD the calculation of disconnected quark loops from the trace of the inverse quark matrix has large noise variance. A multilevel Monte Carlo method is proposed for this problem that uses different degree polynomials on a…
Sign problem in quantum Monte Carlo (QMC) simulation appears to be an extremely hard yet interesting problem. In this article, we present a pedagogical overview on the origin of the sign problem in various quantum Monte Carlo simulation…
We demonstrate the quantum mean estimation algorithm on Euclidean lattice field theories. This shows a quadratic advantage over Monte Carlo methods which persists even in presence of a sign problem, and is insensitive to critical slowing…