Related papers: On computational capabilities of Ising machines ba…
We report a higher-order neuromorphic Ising machine that exhibits superior scalability compared to architectures based on quadratization, while also achieving state-of-the-art quality and reliability in solutions with competitive…
We explore the potential of spatial-photonic Ising machines (SPIMs) to address computationally intensive Ising problems that employ low-rank and circulant coupling matrices. Our results indicate that the performance of SPIMs is critically…
The equivalence between the natural minimization of energy in a dynamical system and the minimization of an objective function characterizing a combinatorial optimization problem offers a promising approach to designing dynamical…
Physical Ising machines rely on nature to guide a dynamical system towards an optimal state which can be read out as a heuristical solution to a combinatorial optimization problem. Such designs that use nature as a computing mechanism can…
We study synchronization of Kuramoto oscillators in strongly modular networks in which the structure of the network inside each community is averaged. We find that the dynamics of the interacting communities can be described as an ensemble…
We propose a network of open-dissipative quantum oscillators with optical error correction circuits. In the proposed network, the squeezed/anti-squeezed vacuum states of the constituent optical parametric oscillators below the threshold…
Networks of coupled oscillators are some of the most studied objects in the theory of dynamical systems. Two important areas of current interest are the study of synchrony in highly disordered systems and the modeling of systems with…
It is challenging to scale Ising machines for industrial-level problems due to algorithm or hardware limitations. Although higher-order Ising models provide a more compact encoding, they are, however, hard to physically implement. This work…
Ising machines are purported to be better at solving large-scale combinatorial optimisation problems better than conventional von Neumann computers. However, these Ising machines are widely believed to be heuristics, whose promise is…
Computation with the Ising model is central to future computing technologies like quantum annealing, adiabatic quantum computing, and thermodynamic classical computing. Traditionally, computed values have been equated with ground states.…
Networks with different levels of interactions, including multilayer and multiplex networks, can display a rich diversity of dynamical behaviors and can be used to model and study a wide range of systems. Despite numerous efforts to…
We consider the inertial Kuramoto model of $N$ globally coupled oscillators characterized by both their phase and angular velocity, in which there is a time delay in the interaction between the oscillators. Besides the academic interest, we…
We contribute to the mathematical theory of the design of low temperature Ising machines, a type of experimental probabilistic computing device implementing the Ising model. Encoding the output of a function in the ground state of a…
We propose a hybrid quantum-classical algorithm for approximating the ground state of two-dimensional quantum systems using an isometric tensor network ansatz, which maps naturally to quantum circuits. Inspired by the density matrix…
Maintaining the stability of synchronization state is crucial for the functioning of many natural and artificial systems. In this study, we develop methods to optimize the synchronization stability of the Kuramoto model by minimizing the…
The challenge posted by modern science is to find a way to compute the NP-hard problem. Here we present a coherent computation model based on the whispering-gallery mode micro-resonators. We introduce the optically connected…
A scenario frequently encountered in real-world complex systems is the temporary failure of a few components. For systems whose functionality hinges on the collective dynamics of the interacting components, a viable approach to dealing with…
Kuramoto networks constitute a paradigmatic model for the investigation of collective behavior in networked systems. Despite many advances in recent years, many open questions remain on the solutions for systems composed of coupled Kuramoto…
Can a simple oscillator system, as in cellular automata, sustain complex nature upon discretization in time and space? The answer is by no means trivial as even the most simple, two-state, nearest neighbours cellular automata can lead to…
A pivotal task for quantum computing is to speed up solving problems that are both classically intractable and practically valuable. Among these, combinatorial optimization problems have attracted tremendous attention due to their broad…