Related papers: An optical Ising spin glass simulator with tuneabl…
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…
We study the dynamics of macroscopic observables such as the magnetization and the energy per degree of freedom in Ising spin models on random graphs of finite connectivity, with random bonds and/or heterogeneous degree distributions. To do…
We derive and study dynamical TAP equations for Ising spin glasses obeying both synchronous and asynchronous dynamics using a generating functional approach. The system can have an asymmetric coupling matrix, and the external fields can be…
We explore a case example of networks of classical electronic oscillators evolving towards the solution of complex optimization problems. We show that when driven into subharmonic response, a network of such nonlinear electrical resonators…
The one-dimensional long-range Ising spin glass provides useful insights into the properties of finite dimensional spin glasses with short-range interactions. The defect energy renormalization group equations derived for it by Kotliar,…
Ising machines (IM) have recently been proposed as unconventional hardware-based computation accelerators for solving NP-hard problems. In this work, we present a model for a time-multiplexed IM based on the nonlinear oscillations in a…
Ising machines as hardware solvers of combinatorial optimization problems (COPs) can efficiently explore large solution spaces due to their inherent parallelism and physics-based dynamics. Many important COP classes such as satisfiability…
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…
Combinatorial optimization problems are ubiquitous in industrial applications. However, finding optimal or close-to-optimal solutions can often be extremely hard. Because some of these problems can be mapped to the ground-state search of…
We present results of numerical simulations on a one-dimensional Ising spin glass with long-range interactions. Parameters of the model are chosen such that it is a proxy for a short-range spin glass above the upper critical dimension (i.e.…
Extensive simulations are made of the spin glass susceptibility and correlation length in five dimension Ising Spin Glasses (ISGs) with Gaussian and bimodal interaction distributions. Once the transition temperature is accurately…
The accurate computational determination of chemical, materials, biological, and atmospheric properties has critical impact on a wide range of health and environmental problems, but is deeply limited by the computational scaling of…
Gain-dissipative systems of various physical origin have recently shown the ability to act as analogue minimisers of hard combinatorial optimisation problems. Whether or not these proposals will lead to any advantage in performance over the…
Parity-time ($PT$) symmetric Hamiltonians are generally non-Hermitian and give rise to exotic behaviour in quantum systems at exceptional points, where eigenvectors coalesce. The recent realisation of $PT$-symmetric Hamiltonians in quantum…
Motivated by the decade-long debate over the issue of criticality supposedly observed in nuclear multifragmentation, we propose a dynamical lattice model to simulate the phenomenon. Its Ising Hamiltonian mimics a short range attractive…
We use a non-equilibrium simulation method to study the spin glass transition in three-dimensional Ising spin glasses. The transition point is repeatedly approached at finite velocity $v$ (temperature change versus time) in Monte Carlo…
Continuous phase transitions are catalogued into universality classes, families of systems having identical values of all the exponents governing the critical behaviour of their different physical properties. Numerical simulations have been…
After developing an appropriate iteration procedure for the determination of the parameters, the method of simulated tempering has been successfully applied to the 2D Ising spin glass. The reduction of the slowing down is comparable to that…
The common feature for a nontrivial hard problem is the existence of nontrivial topological structures, non-planarity graphs, nonlocalities, or long-range spin entanglements in a model system with randomness. For instance, the Boolean…
The growing challenges of scaling digital computing motivate new approaches, especially through the dynamical evolution of physical systems that mimic neural networks and combinatorial optimization problems. While light is a hyper efficient…