Physics-based Ising machines (IM) have been developed as dedicated processors for solving hard combinatorial optimization problems with higher speed and better energy efficiency. Generally, such systems employ local search heuristics to traverse energy landscapes in searching for optimal solutions. Here, we quantify and address some of the major challenges met by IMs by extending energy-landscape geometry visualization tools known as disconnectivity graphs. Using efficient sampling methods, we visually capture landscapes of problems having diverse structure and hardness manifesting as energetic and entropic barriers for IMs. We investigate energy barriers, local minima, and configuration space clustering effects caused by locality reduction methods when embedding combinatorial problems to the Ising hardware. To this end, we sample disconnectivity graphs of PUBO energy landscapes and their different QUBO mappings accounting for both local minima and saddle regions. We demonstrate that QUBO energy landscape properties lead to the subpar performance for quadratic IMs and suggest directions for their improvement.
The inverse Ising problem and its generalizations to Potts and continuous spin models have recently attracted much attention thanks to their successful applications in the statistical modeling of biological data. In the standard setting, the parameters of an Ising model (couplings and fields) are inferred using a sample of equilibrium configurations drawn from the Boltzmann distribution. However, in the context of biological applications, quantitative information for a limited number of microscopic spins configurations has recently become available. In this paper, we extend the usual setting o…
We use record dynamics (RD), a coarse-grained description of the ubiquitous relaxation phenomenology known as "aging", as a diagnostic tool to find universal features that distinguish between the energy landscapes of Ising spin models and the ferromagnet. According to RD, a non-equilibrium system after a quench relies on fluctuations that randomly generate a sequence of irreversible record-sized events (quakes or avalanches) that allow the system to escape ever-higher barriers of meta-stable states within a complex, hierarchical energy landscape. Once these record events allow the system to ov…
Recent work on quantum annealing has emphasized the role of collective behavior in solving optimization problems. By enabling transitions of clusters of variables, such solvers are able to navigate their state space and locate solutions more efficiently despite having only local connections between elements. However, collective behavior is not exclusive to quantum annealers, and classical solvers that display collective dynamics should also possess an advantage in navigating a non-convex landscape. Here, we give evidence that a benchmark derived from quantum annealing studies is solvable in po…
In this paper and in the companion one we address the problem of identifying the effective theory that describes the statistics of the fluctuations of what is thought to be the relevant order parameter for glassy systems---the overlap field with an equilibrium reference configuration---close to the putative thermodynamic glass transition. Our starting point is the mean-field theory of glass formation which relies on the existence of a complex free-energy landscape with a multitude of metastable states. In this paper, we focus on archetypal mean-field models possessing this type of free-energy …
The coherent Ising machine is expected to find a near-optimal solution in various combinatorial optimization problems, which has been experimentally confirmed with optical parametric oscillators (OPOs) and a field programmable gate array (FPGA) circuit. The similar mathematical models were proposed three decades ago by J. J. Hopfield, et al. in the context of classical neural networks. In this article, we compare the computational performance of both models.
We consider the complexity of random ferromagnetic landscapes on the hypercube $\{\pm 1\}^N$ given by Ising models on the complete graph with i.i.d. non-negative edge-weights. This includes, in particular, the case of Bernoulli disorder corresponding to the Ising model on a dense random graph $\mathcal G(N,p)$. Previous results had shown that, with high probability as $N\to\infty$, the gradient search (energy-lowering) algorithm, initialized uniformly at random, converges to one of the homogeneous global minima (all-plus or all-minus). Here, we devise two modified algorithms tailored to explor…
Recently, spatial photonic Ising machines (SPIM) have been demonstrated to compute the minima of Hamiltonians for large-scale spin systems. Here we propose to implement an antiferromagnetic model through optoelectronic correlation computing with SPIM. Also we exploit the gauge transformation which enables encoding the spins and the interaction strengths in a single phase-only spatial light modulator. With a simple setup, we experimentally show the ground state search of an antiferromagnetic model with $40000$ spins in number-partitioning problem. Thus such an optoelectronic computing exhibits …
Ising machines are novel computing devices for the energy minimization of Ising models. These combinatorial optimization problems are of paramount importance for science and technology, but remain difficult to tackle on large scale by conventional electronics. Recently, various photonics-based Ising machines demonstrated ultra-fast computing of Ising ground state by data processing through multiple temporal or spatial optical channels. Experimental noise acts as a detrimental effect in many of these devices. On the contrary, we here demonstrate that an optimal noise level enhances the performa…
We develop a universal model based on the classical complex matter fields that allow the optimal mapping of many real-life NP-hard combinatorial optimisation problems into the problem of minimising a spin Hamiltonian. We explicitly formulate one-to-one mapping for three famous problems: graph colouring, the travelling salesman, and the modular N-queens problem. We show that such a formulation allows for several orders of magnitude improvement in the search for the global minimum compared to the standard Ising formulation. At the same time, the amplitude dynamics escape from the local minima.
