Related papers: Canonical local algorithms for spin systems: Heat …
We study analytically the performance of a recently proposed algorithm for learning the couplings of a random asymmetric kinetic Ising model from finite length trajectories of the spin dynamics. Our analysis shows the importance of the…
Monte Carlo algorithms, like the Swendsen-Wang and invaded-cluster, sample the Ising and Potts models asymptotically faster than single-spin Glauber dynamics do. Here, we generalize both algorithms to sample Potts lattice gauge theory by…
We propose a new algorithm for inferring the state of hidden spins and reconstructing the connections in a synchronous kinetic Ising model, given the observed history. Focusing on the case in which the hidden spins are conditionally…
Monte Carlo methods are widely used to estimate observables in many-body quantum systems. However, conventional sampling schemes often require a large number of samples to achieve sufficient accuracy. In this work we propose the…
We study the computational complexity of approximately computing the partition function of a spin system. Techniques based on standard counting-to-sampling reductions yield $\tilde{O}(n^2)$-time algorithms, where $n$ is the size of the…
Cluster algorithms are developed for simulating quantum spin systems like the one- and two-dimensional Heisenberg ferro- and anti-ferromagnets. The corresponding two- and three-dimensional classical spin models with four-spin couplings are…
Cluster algorithms are developed for simulating quantum spin systems like the one- and two-dimensional Heisenberg ferro- and anti-ferromagnets. The corresponding two- and three-dimensional classical spin models with four-spin couplings are…
We present \texttt{ESpinS} (Esfahan Spin Simulation) package to evaluate the thermodynamic properties of spin systems described by a spin model Hamiltonian. In addition to the Heisenberg exchange term, the spin Hamiltonian can contain…
A new parallel algorithm for simulating Ising spin systems is presented. The sequential prototype is the n-fold way algorithm cite{BKL75}, which is efficient but is hard to parallelize using conservative methods. Our parallel algorithm is…
We study the critical properties of finite-dimensional dissipative quantum spin systems with uniform ferromagnetic interactions. Starting from the transverse-field Ising model coupled to a bath of harmonic oscillators with Ohmic spectral…
Anisotropy is important for the existence of true long range order in two dimensional (2D) systems. This is firmly exemplified by the $q$-state clock models in which discreteness drives the quasi-long range order into a true long range…
We propose a hole decomposition scheme to exactly solve a class of spin-1 quantum Ising models with transverse or longitudinal single-ion anisotropy. In this scheme, the spin-1 model is mapped onto a family of the $S=1/2$ transverse Ising…
The finite lattice method of series expansion has been used to extend low-temperature series for the partition function, order parameter and susceptibility of the spin-1 Ising model on the square lattice. A new formalism is described that…
Spin glass systems as lattices of disordered magnets with random interactions have important implications within the theory of magnetization and applications to a wide-range of hard combinatorial optimization problems. Nevertheless, despite…
A promising approach to achieve computational supremacy over the classical von Neumann architecture explores classical and quantum hardware as Ising machines. The minimisation of the Ising Hamiltonian is known to be NP-hard problem for…
We propose a novel way of investigating the universal properties of spin systems by coupling them to an ensemble of causal dynamically triangulated lattices, instead of studying them on a fixed regular or random lattice. Somewhat…
The commercial and industrial demand for the solution of hard combinatorial optimization problems push forward the development of efficient solvers. One of them is the Ising machine which can solve combinatorial problems mapped to Ising…
We consider zero-temperature, stochastic Ising models with nearest-neighbor interactions and an initial spin configuration chosen from a symmetric Bernoulli distribution (corresponding physically to a deep quench). Whether a final state…
In this letter we present a general classification of integrable models of identical classical spins coupled via the isotropic Heisenberg Hamiltonian. Our constructive proof of integrability provides a solution scheme for the equations…
Recent experiments demonstrated quantum computational advantage in random circuit sampling and Gaussian boson sampling. However, it is unclear whether these experiments can lead to practical applications even after considerable research…