Related papers: Efficient algorithms for computing ground states o…
We perform simulations of random Ising models defined over small-world networks and we check the validity and the level of approximation of a recently proposed effective field theory. Simulations confirm a rich scenario with the presence of…
The equilibrium ensemble approach to disordered systems is used to investigate the critical behaviour of the two dimensional Ising model in presence of quenched random site dilution. The numerical transfer matrix technique in semi- infinite…
In this paper the three dimensional random field Ising model is studied at both zero temperature and positive temperature. Critical exponents are extracted at zero temperature by finite size scaling analysis of large discontinuities in the…
The effects of bond randomness on the ground-state structure, phase diagram and critical behavior of the square lattice ferromagnetic Blume-Capel (BC) model are discussed. The calculation of ground states at strong disorder and large values…
Ising machines, which are dynamical systems designed to operate in a parallel and iterative manner, have emerged as a new paradigm for solving combinatorial optimization problems. Despite computational advantages, the quality of solutions…
In statistical physics, one of the standard methods to study second order phase transitions is the renormalization group that usually leads to an expansion around the corresponding fully connected solution. Unfortunately, often in…
Directly evaluated enhanced perturbative continuous unitary transformations (deepCUTs) are used to calculate non-perturbatively extrapolated numerical data for the ground-state energy and the energy gap. The data coincides with the…
The density of states for the three-dimensional Ising model is calculated with high-precision from multicanonical simulations. This allows us to estimate the leading partition function zeros for lattice sizes up to L=32. Combining previous…
Dynamical Ising machines are based on continuous dynamical systems evolving from a generic initial state to a state strongly related to the ground state of the classical Ising model on a graph. Reaching the ground state is equivalent to…
Ising model with quenched random magnetic fields is examined for single Gaussian, bimodal and double Gaussian random field distributions by introducing an effective field approximation that takes into account the correlations between…
Although many efficient heuristics have been developed to solve binary optimization problems, these typically produce correlated solutions for degenerate problems. Most notably, transverse-field quantum annealing - the heuristic employed in…
The two-dimensional (2D) random-bond Ising model has a novel multicritical point on the ferromagnetic to paramagnetic phase boundary. This random phase transition is one of the simplest examples of a 2D critical point occurring at both…
Analytic phenomenological scaling is carried out for the random field Ising model in general dimensions using a bar geometry. Domain wall configurations and their decorated profiles and associated wandering and other exponents…
We implement a two-stage approach of the Wang-Landau algorithm to investigate the critical properties of the 3D Ising model with quenched bond randomness. In particular, we consider the case where disorder couples to the nearest-neighbor…
Here is proposed a general subgraph-based method for efficiently sampling certain graphical models, typically using subgraphs of a fixed treewidth, and also a related method for finding minimum energy (ground) states. In the case of models…
We study numerically the region above the critical temperature of the four dimensional Random Field Ising Model. Using a cluster dynamic we measure the connected and disconnected magnetic susceptibility and the connected and disconnected…
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…
We propose a hybrid quantum-classical algorithm to compute approximate solutions of binary combinatorial problems. We employ a shallow-depth quantum circuit to implement a unitary and Hermitian operator that block-encodes the weighted…
We use matrix product techniques to investigate the performance of two algorithms for obtaining the ground state of a quantum many-body Hamiltonian $H = H_A + H_B$ in infinite systems. The first algorithm is a generalization of the quantum…
The ferromagnet-to-paramagnet transition of the four-dimensional random-field Ising model with Gaussian distribution of the random fields is studied. Exact ground states of systems with sizes up to 32^4 are obtained using graph theoretical…