Related papers: Efficient Cluster Algorithm for Spin Glasses in An…
For an Ising spin glass on a hierarchical lattice, we show that the energy barrier to be overcome during the flip of a domain of size L scales as L to the power d-1 for all dimensions d. We do this by investigating appropriate lower bounds…
It is believed that the $\pm J$ Ising spin-glass does not order at finite temperatures in dimension $d=2$. However, using a graphical representation and a contour argument, we prove rigorously the existence of a finite-temperature phase…
Spin glasses occupy a unique place in condensed matter: they freeze collectively while remaining struc-turally disordered, and they exhibit slow, history-dependent dynamics that reflect an exceptionally rug-ged free-energy landscape. This…
We performed numerical simulations of 2D and 3D Edwards-Anderson spin glass models by using the recently developed multicanonical ensemble. Our ergodicity times increase with the lattice size approximately as $V^3$. The energy, entropy and…
We study the role of Hamiltonian complexity in the performance of quantum annealers. We consider two general classes of annealing Hamiltonians: stoquastic ones, which can be simulated efficiently using the quantum Monte Carlo algorithm, and…
We analyze the collective spin noise in interacting spin systems. General expressions are derived for the short time behaviour of spin systems with general spin-spin interactions, and we suggest optimum experimental conditions for the…
We perform the high-performance computation of the ferromagnetic Ising model on the pyrochlore lattice. We determine the critical temperature accurately based on the finite-size scaling of the Binder ratio. Comparing with the data on the…
Networks of optical oscillators simulating coupled Ising spins have been recently proposed as a heuristic platform to solve hard optimization problems. These networks, called coherent Ising machines (CIMs), exploit the fact that the…
Clustering is one of the major tasks in data mining. In the last few years, Clustering of spatial data has received a lot of research attention. Spatial databases are components of many advanced information systems like geographic…
In recent years, the problem of fuzzy clustering has been widely concerned. The membership iteration of existing methods is mostly considered globally, which has considerable problems in noisy environments, and iterative calculations for…
We have proposed a cluster heat bath method in Monte Carlo simulations of Ising models in which one of the possible spin configurations of a cluster is selected in accordance with its Boltzmann weight. We have argued that the method…
We provide strong evidence that the effective spin-spin interaction in a multimodal confocal optical cavity gives rise to a self-induced glassy phase, which emerges exclusively from the peculiar euclidean correlations and is not related to…
We study a Hamiltonian system describing a three-spin-1/2 cluster-like interaction competing with an Ising-like anti-ferromagnetic interaction. We compute free energy, spin correlation functions and entanglement both in the ground and in…
A sketch of the chapter appearing under the same heading in the book ``New Optimization Algorithms in Physics'' (A.K. Hartmann and H. Rieger, Eds.) is given. After a general introduction to spin glasses, important aspects of heuristic…
This paper presents a systematic study of the application of convolutional neural networks (CNNs) as an efficient and versatile tool for the analysis of critical and low-temperature phase states in spin system models. The problem of…
There is a growing interest in computer science, engineering, and mathematics for modeling signals in terms of union of subspaces and manifolds. Subspace segmentation and clustering of high dimensional data drawn from a union of subspaces…
The high-performance scalable parallel algorithm for rigorous calculation of partition function of lattice systems with finite number Ising spins was developed. The parallel calculations run by C++ code with using of Message Passing…
Spherical k-Means is frequently used to cluster document collections because it performs reasonably well in many settings and is computationally efficient. However, the time complexity increases linearly with the number of clusters k, which…
Using an efficient polynomial-time ground state algorithm we investigate the Ising spin glass state at zero temperature in two dimensions. For large sizes, we show that the spin state in a central region is independent of the interactions…
We consider two systems of Ising spins with plaquette interactions. They are simple models of glasses which have dual representations as kinetically constrained systems. These models allow an explicit analysis using the mosaic, or entropic…