Related papers: Computational complexity of spin-glass three-dimen…
I propose a new method to study computationally difficult problems. I consider a new system, larger than the one I want to simulate. The original system is recovered by imposing constraints on the large system. I simulate the large system…
How complex is an Ising model? Usually, this is measured by the computational complexity of its ground state energy problem. Yet, this complexity measure only distinguishes between planar and non-planar interaction graphs, and thus fails to…
We present a highly optimized implementation of a Monte Carlo (MC) simulator for the three-dimensional Ising spin-glass model with bimodal disorder, i.e., the 3D Edwards-Anderson model running on CUDA enabled GPUs. Multi-GPU systems…
We report the conjectures on the three-dimensional (3D) Ising model on simple orthorhombic lattices, together with the details of calculations for a putative exact solution. Two conjectures, an additional rotation in the fourth curled-up…
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…
Ising machines are an emerging class of hardware that promises ultrafast and energy-efficient solutions to NP-hard combinatorial optimization problems. Spatial photonic Ising machines (SPIMs) exploit optical computing in free space to…
Non-deterministic polynomial-time (NP) problems are ubiquitous in almost every field of study. Recently, all-optical approaches have been explored for solving classic NP problems based on the spin-glass Ising Hamiltonian. However, obtaining…
We study the complexity of approximating the partition function of dense Ising models in the critical regime. Recent work of Chen, Chen, Yin, and Zhang (FOCS 2025) established fast mixing at criticality, and even beyond criticality in a…
The 3D Ising model and the generalized free scalar of dimension at least 0.75 belong to a continuous line of nonlocal fixed points, each referred to as a long-range Ising model. They can be distinguished by the dimension of the lightest…
We introduce an exact algorithm for the computation of spin correlation functions for the two dimensional +/-J Ising spin glass in the ground state. Unlike with the transfer matrix method, there is no particular restriction on the shape of…
Ising machines are a form of quantum-inspired processing-in-memory computer which has shown great promise for overcoming the limitations of traditional computing paradigms while operating at a fraction of the energy use. The process of…
Real Space Renormalization Group (RSRG) treatment of Ising model for square and simple cubic lattice is investigated and critical coupling strengths of these lattices are obtained. The mathematical complications, which appear inevitable in…
We have simulated, using parallel tempering, the three dimensional Ising spin glass model with binary couplings in a helicoidal geometry. The largest lattice (L=20) has been studied using a dedicated computer (the SUE machine). We have…
I derive a formulation of the 2-dimensional critical Ising model on non-uniform simplicial lattices. Surprisingly, the derivation leads to a set of geometric constraints that a lattice must satisfy in order for the model to have a…
While the 3d Ising model has defied analytic solution, various numerical methods like Monte Carlo, MCRG and series expansion have provided precise information about the phase transition. Using Monte Carlo simulation that employs the Wolff…
This paper reports numerical studies of a compressible version of the Ising spin glass in two dimensions. Compressibility is introduced by adding a term that couples the spin-spin interactions and local lattice deformations to the standard…
A sampling algorithm is presented that generates spin glass configurations of the 2D Edwards-Anderson Ising spin glass at finite temperature, with probabilities proportional to their Boltzmann weights. Such an algorithm overcomes the slow…
The spatial photonic Ising machine (SPIM) [D. Pierangeli et al., Phys. Rev. Lett. 122, 213902 (2019)] is a promising optical architecture utilizing spatial light modulation for solving large-scale combinatorial optimization problems…
We proposed the method that translates the 2-D CSP for minimizing the number of cuts to the Ising model. After that, we conducted computer experiments of the proposed model using the benchmark problem. From the above, the following results…
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…