With increasing computational demands, the importance of efficient computer architectures rises. Photonic Ising machines offer a promising approach to address complex binary optimization problems by leveraging the speed and bandwidth inherent in photonic systems. When the cost function of an optimization problem can be mapped to the energy of an Ising problem, the ground state of the latter will represent the optimal solution. We conduct a stability analysis on this ground state of various benchmark problems. This analysis reveals that some benchmark problems are manageable for all Ising machine implementations. However, there are other problems for which the probability of achieving the ground state depends on the physical implementation. Our analysis shows the reasons for this advantage, leading us to formulate strategies to further enhance Ising machines and pave the way for future research. In future work, we will investigate if photonic Ising machines utilizing a different nonlinearity possess a distinct advantage in this context.
With increasing computational demands, the importance of efficient computer architectures rises. Photonic Ising machines offer a promising approach to address complex binary optimization problems by leveraging the speed and bandwidth inherent in photonic systems. When the cost function of an optimization problem can be mapped to the energy of an Ising problem, the ground state of the latter will represent the optimal solution. We conduct a stability analysis on this ground state of various benchmark problems. This analysis reveals that some benchmark problems are manageable for all Ising machine implementations. However, there are other problems for which the probability of achieving the ground state depends on the physical implementation. Our analysis shows the reasons for this advantage, leading us to formulate strategies to further enhance Ising machines and pave the way for future research. In future work, we will investigate if photonic Ising machines utilizing a different nonlinearity possess a distinct advantage in this context.
The demand for efficient solvers of complicated combinatorial optimization problems, especially those classified as NP-complete or NP-hard, has recently led to increased exploration of novel computing architectures. One prominent collective state computing paradigm embodied in the so-called Ising machines has recently attracted considerable research attention due to its ability to optimize complex problems with large numbers of interacting variables. Ising model-inspired solvers, thus named due to mathematical similarities to the well-known model from solid-state physics, represent a promising alternative to traditional von Neumann computer architectures due to their high degree of inherent parallelism. While there are many possible physical realizations of Ising solvers, just as there are many possible implementations of any binary computer, photonic Ising machines (PIMs) use primarily optical components for computation, taking advantage of features like lower power consumption, fast calculation speeds, the leveraging of physical optics to perform the calculations themselves, possessing decent scalability and noise tolerance. Photonic computing in the form of PIMs may offer certain computational advantages that are not easily achieved with non-photonic approaches and is nonetheless an altogether fascinating application of photonics to computing. In this review, we provide an overview of Ising machines generally, introducing why they are useful, what types of problems they can tackle, and how different Ising solvers can be compared and benchmarked. We delineate their various operational mechanisms, advantages, and limitations vis-à-vis non-photonic Ising machines. We describe their scalability, interconnectivity, performance, and physical dimensions. As research in PIMs continues to progress, there is a potential that photonic computing could well emerge as a way to handle large and challenging optimization problems across diverse domains. This review serves as a comprehensive resource for researchers and practitioners interested in understanding capabilities and potential of PIMs in addressing such complex optimization problems.
Combinatorial optimization problems are central to many challenges in logistics, finance, engineering, and the life sciences, yet they remain among the most computationally demanding. Many of these problems can be mapped onto the Ising model, in which binary spins interact through a network of couplings, and solutions correspond to low-energy, ideally ground-state, spin configurations. Photonic Ising machines have the potential to be fast and energy-efficient heuristic solvers of optimization problems by leveraging the low latency, high bandwidth, and inherent parallelism of optics. However, current photonic implementations remain limited in scalability, connectivity, reconfigurability, and time-to-solution, preventing their use in many practical applications. In this perspective, we examine the current landscape of photonic Ising machines, discuss the challenges and limitations of existing platforms, and identify the scientific and technological advances needed to realize large-scale systems. These developments could establish photonic Ising machines as useful hardware platforms for practical optimization.
The general-purpose programmable photonic processors offer a scalable and reconfigurable solution for a wide range of RF and optical applications. Therefore, implementing photonic Ising machines using programmable processors leverages the advantages of high speed and parallelism, enabling efficient hardware acceleration for finding ground-state solutions to combinatorial optimization problems. In this work, we demonstrate a novel programmable photonic Ising solver based on a hexagonal mesh general-purpose programmable photonic platform. The integrated system allows reconfigurable matrix multiplication and computes the Hamiltonian iteratively using an annealing algorithm that facilitates spin updates and effectively searches for the ground state. As a proof of concept, we experimentally solve two benchmark optimization problems, a fundamental three-node ferromagnetic coupling problem with external bias that demonstrates nontrivial spin interactions, and a four-node Max-Cut problem with arbitrary coupling matrices. Furthermore, to establish a large-scale capability, we emulated Ising problems with sizes up to N = 50, achieving success probabilities exceeding 80\%. Additionally, we examined the impact of errors, such as phase and coupling, on the performance of the programmable photonic Ising machine. Our general-purpose photonic Ising machine paves the way for implementing large-scale, programmable architectures for solving optimization problems.
Photonic Ising machines are a recent and promising non-von Neuman architecture to efficiently solve large NP-hard optimization problems. This is done by letting spins evolve to the ground state of the Ising system. However, the Ising machine does not always relax to this ground state and can get trapped in local minima, resulting in suboptimal solutions. Here, we show that Ising-encoded optimization problems implemented on analog Ising machines can be divided in three difficulty classes and we propose an annealing scheme to efficiently solve two of them. Furthermore, we show that changing the physical implementation of the Ising machine can cause a problem to change difficulty class, rendering it potentially a lot more easy to solve.
Ising problems are critical for a wide range of applications. Solving these problems on a photonic platform takes advantage of the unique properties of photons, such as high speed, low power consumption, and large bandwidth. Recently, there has been growing interest in using photonic platforms to accelerate the optimization of Ising models, paving the way for the development of ultrafast hardware in machine learning. However, these proposed systems face challenges in simultaneously achieving high spin scalability, encoding flexibility, and low system complexity. We propose a wavelength-domain optical Ising machine that utilizes optical signals at different wavelengths to represent distinct Ising spins for Ising simulation. We design and experimentally validate a chip-scale Ising machine capable of solving classical non-deterministic polynomial-time problems. The proposed Ising machine supports 32 spins and features 2 distinct coupling encoding schemes. Furthermore, we demonstrate the feasibility of scaling the system to 256 spins. This approach verifies the viability of performing Ising simulations in the wavelength dimension, offering substantial advantages in scalability. These advancements lay the groundwork for future large-scale expansion and practical applications in cloud computing.
Many problems in mathematics, statistical mechanics, and computer science are hard to tackle by conventional computational methods, but can be reduced to the combinatorial problem of finding the ground state of the Ising model. However, the computational cost associated with a combinatorial optimization problem increases exponentially with the number of variables. This explains growing research interest towards physical and artificial spin-networks (schematically shown in Fig. 1 (a) ) that evolve according to an Ising Hamiltonian, which provides the combinatorial solution through the ground state observed in the experiment [1] . The implementation of analog autonomous spin-networks is currently considered a highly attractive prospect due to a potentially significant increase in energy efficiency and processing speed.