Related papers: On computational capabilities of Ising machines ba…
Oscillator-based Ising machines (OIMs) and oscillator-based Potts machines (OPMs) have emerged as promising hardware accelerators for solving NP-hard combinatorial optimization problems by leveraging the phase dynamics of coupled…
The understanding of synchronization ranging from natural to social systems has driven the interests of scientists from different disciplines. Here, we have investigated the synchronization dynamics of the Kuramoto dynamics departing from…
Specialized function gradient computing hardware could greatly improve the performance of state-of-the-art optimization algorithms, e.g., based on gradient descent or conjugate gradient methods that are at the core of control, machine…
We study the Kuramoto-Sakaguchi (KS) model composed by any N identical phase oscillators symmetrically coupled. Ranging from local (one-to-one, R = 1) to global (all-to-all, R = N/2) couplings, we derive the general solution that describes…
While there are various approaches to benchmark physical processors, recent findings have focused on computational phase transitions. This is due to several factors. Importantly, the hardest instances appear to be well-concentrated in a…
The emergence of specialized optimization hardware such as CMOS annealers and adiabatic quantum computers carries the promise of solving hard combinatorial optimization problems more efficiently in hardware. Recent work has focused on…
A recently proposed dimensional reduction approach for studying synchronization in the Kuramoto model is employed to build optimal network topologies to favor or to suppress synchronization. The approach is based in the introduction of a…
Stochastic Ising machines, sIMs, are highly promising accelerators for optimization and sampling of computational problems that can be formulated as an Ising model. Here we investigate the computational advantage of sIM for simulations of…
We present a new family of zero-field Ising models over $N$ binary variables/spins obtained by consecutive "gluing" of planar and $O(1)$-sized components and subsets of at most three vertices into a tree. The polynomial-time algorithm of…
We propose an algorithm inspired by optical coherent Ising machines to solve the problem of polynomial unconstrained binary optimization (PUBO). We benchmark the proposed algorithm against existing PUBO algorithms on the extended…
We present a new family of zero-field Ising models over N binary variables/spins obtained by consecutive "gluing" of planar and $O(1)$-sized components along with subsets of at most three vertices into a tree. The polynomial time algorithm…
Synchronization in networks of coupled oscillators is a widely studied topic with extensive scientific and engineering applications. In this paper, we study the frequency synchronization problem for networks of Kuramoto oscillators with…
A system of nearest neighbors Kuramoto-like coupled oscillators placed in a ring is studied above the critical synchronization transition. We find a richness of solutions when the coupling increases, which exists only within a solvability…
Quantum annealing aims to solve combinatorial optimization problems mapped on to Ising interactions between quantum spins. A critical factor that limits the success of a quantum annealer is its sensitivity to noise, and intensive research…
The Kuramoto model is one of the most widely studied model for describing synchronization behaviors in a network of coupled oscillators, and it has found a wide range of applications. Finding all possible frequency synchronization…
Populations of oscillators are present throughout nature. Very often synchronization is observed in such populations if they are allowed to interact. A paradigmatic model for the study of such phenomena has been the Kuramoto model. However,…
We study synchronization in a Kuramoto model of globally coupled phase oscillators with a bi-harmonic coupling function, in the thermodynamic limit of large populations. We develop a method for an analytic solution of self-consistent…
A generalized Kuramoto model of coupled phase oscillators with slowly varying coupling matrix is studied. The dynamics of the coupling coefficients is driven by the phase difference of pairs of oscillators in such a way that the coupling…
Oscillator networks represent a promising technology for unconventional computing and artificial intelligence. Thus far, these systems have primarily been demonstrated in small-scale implementations, such as Ising Machines for solving…
Determining the number of stable phase-locked solutions for locally coupled Kuramoto models is a long-standing mathematical problem with important implications in biology, condensed matter physics and electrical engineering among others. We…