Related papers: Fully Programmable Spatial Photonic Ising Machine …
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…
Ising machines offer a compelling approach to addressing NP-hard problems, but physical realizations that are simultaneously scalable, reconfigurable, fast, and stable remain elusive. Quantum annealers, like D-Wave's cryogenic hardware,…
Coherent Ising Machines (CIMs) have emerged as a hybrid form of quantum computing devices designed to solve NP-complete problems, offering an exciting opportunity for discovering optimal solutions. Despite challenges such as susceptibility…
Many tasks in our modern life, such as planning an efficient travel, image processing and optimizing integrated circuit design, are modeled as complex combinatorial optimization problems with binary variables. Such problems can be mapped to…
The photonic Ising machine is a new paradigm of optical computing that takes advantage of the unique properties of light wave propagation, parallel processing, and low-loss transmission. Thus, the process of solving combinatorial…
This paper proposes a novel optimization framework for discrete phase shifts of a reconfigurable intelligent surface (RIS) using a coherent Ising machine (CIM). Unlike conventional methods based on iterative convex approximation or…
Probabilistic computing with pbits is emerging as a computational paradigm for machine learning and for facing combinatorial optimization problems (COPs) with the so-called probabilistic Ising machines (PIMs). From a hardware point of view,…
Ising machines (IM) are physics-inspired alternatives to von Neumann architectures for solving hard optimization tasks. By mapping binary variables to coupled Ising spins, IMs can naturally solve unconstrained combinatorial optimization…
The need for solving optimization problems is prevalent in a wide range of physical applications, including neuroscience, network design, biological systems, socio-economics, and chemical reactions. Many of these are classified as…
The coherent Ising machine (CIM) is a quantum-inspired computing platform that leverages optical parametric oscillation dynamics to solve combinatorial optimization problems by searching for the ground state of an Ising Hamiltonian.…
Single-pixel imaging (SPI) is a novel optical imaging technique by replacing the pixelated sensor array in a conventional camera with a single-pixel detector. In previous works, SPI is usually used for capturing object images or performing…
To tackle challenging combinatorial optimization problems, analog computing machines based on the nature-inspired Ising model are attracting increasing attentions in order to disruptively overcome the impending limitations on conventional…
The spatial photonic Ising machine has achieved remarkable advancements in solving combinatorial optimization problems. However, it still remains a huge challenge to flexibly mapping an arbitrary problem to Ising model. In this paper, we…
Ising machines -- special-purpose hardware for heuristically solving Ising optimization problems -- based on probabilistic bits (p-bits) have been established as a promising alternative to heuristic optimization algorithms run on…
Solving large-scale computationally hard optimization problems using existing computers has hit a bottleneck. A promising alternative approach uses physics-based phenomena to naturally solve optimization problems wherein the physical…
Finding the ground states of the Ising Hamiltonian [1] maps to various combinatorial optimization problems in biology, medicine, wireless communications, artificial intelligence, and social network. So far no efficient classical and quantum…
The commercial and industrial demand for the solution of hard combinatorial optimization problems push forward the development of efficient solvers. One of them is the Ising machine which can solve combinatorial problems mapped to Ising…
Non-deterministic polynomial-time (NP) problems are ubiquitous in almost every field of study. Recently, all-optical approaches have been explored for solving classic NP problems based on the spin-glass Ising Hamiltonian. However, obtaining…
The Ising machine is an unconventional computing architecture that can be used to solve NP-hard combinatorial optimization problems more efficiently than traditional von Neumann architectures. Fast, compact oscillator networks which provide…
A promising approach to achieve computational supremacy over the classical von Neumann architecture explores classical and quantum hardware as Ising machines. The minimisation of the Ising Hamiltonian is known to be NP-hard problem for…