Related papers: peapods: A Rust-Accelerated Monte Carlo Package fo…
Monte Carlo cluster algorithms are popular for their efficiency in studying the Ising model near its critical temperature. We might expect that this efficiency extends to the bond-diluted Ising model. We show, however, that this is not…
In this paper, we introduce a dynamical Monte Carlo algorithm for spin models in which the number of the spins fluctuates from zero to a given number by addition and deletion of spins with a probabilistic rule. Such simulations are realized…
We study the 3D Edwards-Anderson model with binary interactions by Monte Carlo simulations. Direct evidence of finite-size scaling is provided, and the universal finite-size scaling functions are determined. Using an iterative extrapolation…
We propose a parallel version of the cross interpolation algorithm and apply it to calculate high-dimensional integrals motivated by Ising model in quantum physics. In contrast to mainstream approaches, such as Monte Carlo and quasi Monte…
We introduce a powerful Monte Carlo (MC) algorithm for the atomistic simulation of bulk models of oligo- and poly-thiophenes by redesigning MC moves originally developed for considerably simpler polymer structures and architectures, such as…
I present a cluster Monte Carlo algorithm that gives direct access to the interface free energy of Ising models. The basic idea is to simulate an ensemble that consists of both configurations with periodic and with antiperiodic boundary…
We release a set of GPU programs for the study of the Quantum ($S=1/2$) Spin Glass on a square lattice, with binary couplings. The library contains two main codes: MCQSG (that carries out Monte Carlo simulations using both the Metropolis…
We study a classical Ising model on the honeycomb lattice with local two-body interactions and present strong evidence that at low temperature it realizes a higher-rank Coulomb liquid with fracton excitations. We show that the excitations…
We introduce an efficient, scalable Monte Carlo algorithm to simulate cross-linked architectures of freely-jointed and discrete worm-like chains. Bond movement is based on the discrete tractrix construction, which effects conformational…
Inspired by the multicanonical approach to simulations of first-order phase transitions we propose for $q$-state Potts models a combination of cluster updates with reweighting of the bond configurations in the…
We apply the event-chain Monte Carlo algorithm to classical continuum spin models on a lattice and clarify the condition for its validity. In the two-dimensional XY model, it outperforms the local Monte Carlo algorithm by two orders of…
Monte Carlo simulation using the standard single-spin flip algorithm often fails to sample over the entire configuration space at low temperatures for frustrated spin systems. A typical example is a class of spin-ice type Ising models. In…
We present an algorithm for the simulation of three-dimensional spin glasses deep in the low-temperature phase: Parallel Tempering enhanced with Houdayer moves and with an entropic reservoir (PTHR). Although differences with the standard…
We use Monte Carlo (MC) methods to simulate a two-dimensional (2D) bond-diluted Ising model on the square lattice which has frustration between the nearest-neighbor interaction J1 and the next-nearest-neighbor interaction J2. In this paper,…
We present a matrix product state (MPS) algorithm to approximate ground states of translationally invariant systems with periodic boundary conditions. For a fixed value of the bond dimension D of the MPS, we discuss how to minimize the…
The reptation Monte Carlo algorithm is a simple, physically motivated and efficient method for equilibrating semi-dilute solutions of linear polymers. Here we propose two simple generalizations for the analogue {\it Amoeba} algorithm for…
Spin glasses featured by frustrated interactions and metastable states have important applications in chemistry, material sciences and artificial neural networks. However, the solution of the spin glass models is hindered by the…
We report the development of a python-based auxiliary-field quantum Monte Carlo (AFQMC) program, ipie, with preliminary timing benchmarks and new AFQMC results on the isomerization of [Cu$_2$O$_2$$]^{2+}$. We demonstrate how implementations…
A linear-time algorithm is presented for the construction of the Gibbs distribution of configurations in the Ising model, on a quantum computer. The algorithm is designed so that each run provides one configuration with a quantum…
ParaMonte::Python (standing for Parallel Monte Carlo in Python) is a serial and MPI-parallelized library of (Markov Chain) Monte Carlo (MCMC) routines for sampling mathematical objective functions, in particular, the posterior distributions…