Related papers: peapods: A Rust-Accelerated Monte Carlo Package fo…
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…
We study the efficiency of parallel tempering Monte Carlo technique for calculating true ground states of the Edwards-Anderson spin glass model. Bimodal and Gaussian bond distributions were considered in two and three-dimensional lattices.…
Optimization problems with Boolean variables that fall into the nondeterministic polynomial (NP) class are of fundamental importance in computer science, mathematics, physics and industrial applications. Most notably, solving…
We present and solve the Replica Symmetric equations in the context of the Replica Cluster Variational Method for the 2D random bond Ising model (including the 2D Edwards-Anderson spin glass model). First we solve a linearized version of…
Ising machines (IMs) are specialized devices designed to efficiently solve combinatorial optimization problems (COPs). They consist of artificial spins that evolve towards a low-energy configuration representing a problem's solution. Most…
PYROBOCOP is a Python-based package for control, optimization and estimation of robotic systems described by nonlinear Differential Algebraic Equations (DAEs). In particular, the package can handle systems with contacts that are described…
The Ising model S=1/2 and the S=1 model are studied by efficient Monte Carlo schemes on the (3,4,6,4) and the (3,3,3,3,6) Archimedean lattices. The algorithms used, a hybrid Metropolis-Wolff algorithm and a parallel tempering protocol, are…
We present an algorithm for the simulation of the exact real-time dynamics of classical many-body systems with discrete energy levels. In the same spirit of kinetic Monte Carlo methods, a stochastic solution of the master equation is found,…
We present a new optimised model of Brookes-Herring ionized impurity scattering for use in Monte Carlo simulations of semiconductors. When implemented, it greatly decreases the execution time needed for simulations (typically by a factor of…
We present here two novel algorithms for simulated tempering simulations, which break detailed balance condition (DBC) but satisfy the skewed detailed balance to ensure invariance of the target distribution. The irreversible methods we…
The Spinsim python package simulates spin-half and spin-one quantum mechanical systems following a time dependent Shroedinger equation. It makes use of numba.cuda, which is an LLVM (Low Level Virtual Machine) compiler for Nvidia Cuda…
The challenge posted by modern science is to find a way to compute the NP-hard problem. Here we present a coherent computation model based on the whispering-gallery mode micro-resonators. We introduce the optically connected…
We present a tool for the comparison and validation of the integration packages suitable for Solar System dynamics. iCompare, written in Python, compares the ephemeris prediction accuracy of a suite of commonly-used integration packages…
Ising machines as hardware solvers of combinatorial optimization problems (COPs) can efficiently explore large solution spaces due to their inherent parallelism and physics-based dynamics. Many important COP classes such as satisfiability…
In this paper, we present a new version of the $i$QIST software package, which is capable of solving various quantum impurity models by using the hybridization expansion (or strong coupling expansion) continuous-time quantum Monte Carlo…
Isothermal simulational data for the 3D Edwards-Anderson spin glass are collected at several temperatures below $T_{\rm c}$ and, in analogy with a recent model of dense colloidal suspensions,interpreted in terms of clusters of contiguous…
This paper is devoted to computational algorithms designed to describe the classical Ising magnet in some specific cases when an additional macroscopic restriction in form of constant charge density exists in the system. We developed and…
A detailed description is provided of a new Worm Algorithm, enabling the accurate computation of thermodynamic properties of quantum many-body systems in continuous space, at finite temperature. The algorithm is formulated within the…
Combinatorial optimization problems are computationally hard in general, but they are ubiquitous in our modern life. A coherent Ising machine (CIM) based on a multiple-pulse degenerate optical parametric oscillator (DOPO) is an alternative…
Slice sampling is a standard Monte Carlo technique for Dirichlet process (DP)-based models, widely used in posterior simulation. However, formal assessments of the scalability of posterior slice samplers have remained largely unexplored,…