Related papers: Cluster Monte Carlo algorithms for diluted spin gl…
A cluster algorithm is presented for the simulation of the q-state Potts models in which the number of spins is conserved in each state. The algorithm constructs Fortuin-Kasteleyn cluster configurations from spin configurations, in a way…
The nature of the ordering of the three-dimensional isotropic Heisenberg spin glass with nearest-neighbor random Gaussian coupling is studied by extensive Monte Carlo simulations. Several independent physical quantities are measured both…
We consider a regular random network where each node has exactly three neighbours. Ising spins at the network nodes interact antiferromagnetically along the links. The clustering coefficient $C$ is tuned from zero to 1/3 by adding new…
We investigate the ground-state properties of the highly degenerate non-coplanar phase of the classical bilinear-biquadratic Heisenberg model on the triangular lattice with Monte Carlo simulations. For that purpose, we introduce an Ising…
We report a Monte Carlo simulation of the $2D$ Edwards-Anderson spin glass model within the recently introduced multicanonical ensemble. Replica on lattices of size $L^2$ up to $L=48$ are investigated. Once a true groundstate is found, we…
We present a high precision Monte Carlo study of the finite temperature $Z_2$ gauge theory in 2+1 dimensions. The duality with the 3D Ising spin model allows us to use powerful cluster algorithms for the simulations. For temporal extensions…
The swap Monte Carlo algorithm combines the translational motion with the exchange of particle species, and is unprecedentedly efficient for some models of glass former. In order to clarify the physics underlying this acceleration, we study…
Ground states of the three dimensional Edwards-Anderson spin glass are computed in the presence of an external magnetic field. Our algorithm is sufficiently powerful for us to treat systems with up to 600 spins. We perform a statistical…
We study universality in three-dimensional Ising spin glasses by large-scale Monte Carlo simulations of the Edwards-Anderson Ising spin glass for several choices of bond distributions, with particular emphasis on Gaussian and bimodal…
Theory of dilution effect in orbital ordered system is presented. The $e_g$ orbital model without spin degree of freedom and the spin-orbital coupled model in a three-dimensional simple-cubic lattice are analyzed by the Monte-Carlo…
The frustrated Ising model in two dimensions is revisited. The frustration is quantified in terms of the number of non-trivial plaquettes which is invariant under the Nishimori gauge symmetry. The exact ground state energy is calculated…
Population annealing is an easily parallelizable sequential Monte Carlo algorithm that is well-suited for simulating the equilibrium properties of systems with rough free energy landscapes. In this work we seek to understand and improve the…
The performance of quantum annealing for combinatorial optimization is fundamentally limited by the minimum energy gap $\Delta$ encountered at quantum phase transitions. We investigate the scaling of $\Delta$ with system size $N$ for two…
We have studied the spin-polarized three-dimensional homogeneous electron gas using the diffusion quantum Monte Carlo method, with trial wave functions including backflow and three-body correlations in the Jastrow factor, and we have used…
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…
The three-dimensional Edwards-Anderson and mean-field Sherrington-Kirkpatrick Ising spin glasses are studied via large-scale Monte Carlo simulations at low temperatures, deep within the spin-glass phase. Performing a careful statistical…
In our previous work [1], we introduced to an arbitrary Markov chain Monte Carlo algorithm a distance between configurations. This measures the difficulty of transition from one configuration to the other, and enables us to investigate the…
We present a new type of cluster algorithm that strongly reduces critical slowing down in simulations of vertex models. Since the clusters are closed paths of bonds, we call it the {\em loop algorithm}. The basic steps in constructing a…
Variational Monte Carlo is a many-body numerical method that scales well with system size. It has been extended to study the Green function only recently by Charlebois and Imada (2020). Here we generalize the approach to systems with open…
We propose an efficient Monte Carlo algorithm for the off-lattice simulation of dense hard sphere polymer melts using cluster moves, called event chains, which allow for a rejection-free treatment of the excluded volume. Event chains also…