Related papers: Computational complexity of spin-glass three-dimen…
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…
Efficient machine learning inference is essential for the rapid adoption of artificial intelligence across various domains.On-chip optical computing has emerged as a transformative solution for accelerating machine learning tasks, owing to…
Using Monte Carlo simulations we study the dynamics of three-dimensional Ising models with nearest-, next-nearest-, and four-spin (plaquette) interactions. During coarsening, such models develop growing energy barriers, which leads to very…
Dobrushin (1972) showed that the interface of a 3D Ising model with minus boundary conditions above the $xy$-plane and plus below is rigid (has $O(1)$-fluctuations) at every sufficiently low temperature. Since then, basic features of this…
The lattice $A_n^*$ is an important lattice because of its covering properties in low dimensions. Clarkson \cite{Clarkson1999:Anstar} described an algorithm to compute the nearest lattice point in $A_n^*$ that requires $O(n\log{n})$…
We present explicit formulas for all spin matrix elements in the 2D Ising model with the nearest neighbor interaction on the finite periodic square lattice. These expressions generalize the known results [Phys. Rev. D19, (1979), 2477--2479;…
We describe an efficient approximation algorithm for evaluating the ground-state energy of the classical Ising Hamiltonian with linear terms on an arbitrary planar graph. The running time of the algorithm grows linearly with the number of…
The spontaneous magnetization relations for the 2D triangular and the 3D cubic lattices of the Ising model are derived by a new tractable easily calculable mathematical method. The result obtained for the triangular lattice is compared with…
An extension of the synchronous parallel kinetic Monte Carlo (pkMC) algorithm developed by Martinez {\it et al} [{\it J.\ Comp.\ Phys.} {\bf 227} (2008) 3804] to discrete lattices is presented. The method solves the master equation…
We present a status report on the ongoing analysis of the 3D Ising model with nearest-neighbor interactions using the Monte Carlo Renormalization Group (MCRG) and finite size scaling (FSS) methods on $64^3$, $128^3$, and $256^3$ simple…
We propose and test a scheme for entanglement renormalization capable of addressing large two-dimensional quantum lattice systems. In a translationally invariant system, the cost of simulations grows only as the logarithm of the lattice…
In this paper, we present a parallel algorithm for Monte Carlo simulation of the 2D Ising Model to perform efficiently on a cluster computer using MPI. We use C++ programming language to implement the algorithm. In our algorithm, every…
We explore the problem of approximate matrix multiplication (AMM) within the sliding window model, where algorithms utilize limited space to perform large-scale matrix multiplication in a streaming manner. This model has garnered increasing…
Spatial photonic Ising machines offer a novel optical platform for optimization and spin-model simulation, but existing diffraction-based schemes rely on auxiliary spins or multiplexing to encode high-rank couplings and external fields,…
A mixed spin-1/2 and spin-3/2 Ising model on a decorated square lattice with a nearest- neighbor interaction, next-nearest-neighbor bilinear interaction, three-site four-spin in- teraction and single-ion anisotropy is exactly investigated…
The single-cluster Monte Carlo algorithm and the reweighting technique are used to simulate the 3D-ferromagnetic Ising model on three dimensional Voronoi-Delaunay lattices. It is assumed that the coupling factor $J$ varies with the distance…
We propose a computational methodology based on a hierarchical cluster growth process to solve spin-3/2 Ising models efficiently. The method circumvents the exponential complexity (\(4^{N}\)) of the canonical ensemble partition function by…
We propose that scaling dimensions of d=3 conformal field theories can be studied on a system of qubits with near term quantum simulation platforms. Our proposal chooses couplings of quantum many-body problems on a polyhedral lattice at…
The Gonihedric 3D Ising model is a lattice spin model in which planar Peierls boundaries between + and - spins can be created at zero energy cost. Instead of weighting the area of Peierls boundaries as the case for the usual 3D Ising model…
We explored decoding methods for the surface code under depolarizing noise by mapping the problem into the Ising model optimization. We consider two kinds of mapping with and without a soft constraint and also various optimization solvers,…