Related papers: Small-Network Approximations for Geometrically Fru…
In recent years, hardware implementations of Ising machines have emerged as a viable alternative to quantum computing for solving hard optimization problems among other applications. Unlike quantum hardware, dense connectivity can be…
Ising machines are hardware solvers which aim to find the absolute or approximate ground states of the Ising model. The Ising model is of fundamental computational interest because it is possible to formulate any problem in the complexity…
Generative models have advanced significantly in sampling material systems with continuous variables, such as atomistic structures. However, their application to discrete variables, like atom types or spin states, remains underexplored. In…
In this review, I outline some principal theoretical knowledge on the properties of frustrated systems and thin films. The two points I would like to emphasize: i) the physics in low dimensions where exact solutions can be obtained, ii) the…
We develop a new method to calculate eigenvalues in frustrated quantum spin models. It is based on the stochastic state selection (SSS) method, which is an unconventional Monte Carlo technique we have investigated in recent years. We…
A simple model of a frustrated disordered system is presented. Apart from the (very different) physical interpretation, the model shares many features with that of Sherrington-Kirkpatrick for spin glasses, but, as a consequence of its…
We explore the phase diagram and the low-energy physics of three Heisenberg antiferromagnets which, like the kagome lattice, are networks of corner-sharing triangles but contain two sets of inequivalent short-distance resonance loops. We…
Working within the Stochastic Series Expansion (SSE) framework, we construct efficient quantum cluster algorithms for transverse field Ising antiferromagnets on the pyrochlore lattice and the planar pyrochlore lattice, for the fully…
We consider the Ising model on a small-world network, where the long-range interaction strength $J_2$ is in general different from the local interaction strength $J_1$, and examine its relaxation behaviors as well as phase transitions. As…
Frustrated systems exhibit remarkable properties due to the high degeneracy of their ground states. Stabilised by competing interactions, a rich diversity of typically nanometre-sized phase structures appear in polymer and colloidal…
The zero-temperature Glauber dynamics of the ferromagnetic Ising model on small-world networks, rewired from a two-dimensional square lattice, has been studied by numerical simulations. For increasing disorder in finite networks, the…
Large scale quantum annealing dynamics of Ising spin glasses were recently implemented on D-Wave's Advantage$2$ system on a range of lattices. Following extensive comparison to existing numerical methods, these experiments were claimed to…
The robustness of dynamical properties of neuronal networks against structural damages is a central problem in computational and experimental neuroscience. Research has shown that the cortical network of a healthy brain works near a…
We consider a recently introduced generalization of the Ising model in which individual spin strength can vary. The model is intended for analysis of ordering in systems comprising agents which, although matching in their binarity (i.e.,…
We test four fast mean field type algorithms on Hopfield networks as an inverse Ising problem. The equilibrium behavior of Hopfield networks is simulated through Glauber dynamics. In the low temperature regime, the simulated annealing…
The goal of this paper is to exhibit a deep relation between the partition function of the Ising model on a planar trivalent graph and the generating series of the spin network evaluations on the same graph. We provide respectively a…
We calculate equilibrium solutions for Ising spin models on `small world' lattices, which are constructed by super-imposing random and sparse Poissonian graphs with finite average connectivity c onto a one-dimensional ring. The nearest…
Geometric frustration effects were studied systematically with the Ising antiferromagnet on the 11 Archimedean lattices using the Monte-Carlo methods. The Wang-Landau algorithm for static properties (specific heat and residual entropy) and…
For a transverse-field Ising chain with weak long-range interactions we develop a perturbative scheme, based on quantum kinetic equations, around the integrable nearest-neighbour model. We introduce, discuss, and benchmark several…
Simulated annealing (SA) attracts more attention among classical heuristic algorithms because the solution of the combinatorial optimization problem can be naturally mapped to the ground state of the Ising Hamiltonian. However, in practical…