Abstract 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 optimization problems can be accelerated through photonic/optoelectronic devices, but implementing photonic Ising machines that can solve arbitrary large-scale Ising problems with fast speed remains challenging. In this work, we have proposed and demonstrated the Phase Encoding and Intensity Detection Ising Annealer (PEIDIA) capable of solving arbitrary Ising problems on demand. The PEIDIA employs the heuristic algorithm and requires only one step of optical linear transformation with simplified Hamiltonian calculation by encoding the Ising spins on the phase term of the optical field and performing intensity detection during the solving process. As a proof of principle, several 20 and 30-spin Ising problems have been solved with high ground state probability (≥0.97/0.85 for the 20/30-spin Ising model).
Abstract 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 optimization problems can be accelerated through photonic/optoelectronic devices, but implementing photonic Ising machines that can solve arbitrary large-scale Ising problems with fast speed remains challenging. In this work, we have proposed and demonstrated the Phase Encoding and Intensity Detection Ising Annealer (PEIDIA) capable of solving arbitrary Ising problems on demand. The PEIDIA employs the heuristic algorithm and requires only one step of optical linear transformation with simplified Hamiltonian calculation by encoding the Ising spins on the phase term of the optical field and performing intensity detection during the solving process. As a proof of principle, several 20 and 30-spin Ising problems have been solved with high ground state probability (≥0.97/0.85 for the 20/30-spin Ising model).
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.
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.
Abstract Ising machines based on analog systems have the potential of acceleration in solving ubiquitous combinatorial optimization problems. Although some artificial spins to support large-scale Ising machine is reported, e.g. superconducting qubits in quantum annealers and short optical pulses in coherent Ising machines, the spin coherence is fragile due to the ultra-low equivalent temperature or optical phase sensitivity. In this paper, we propose to use short microwave pulses generated from an optoelectronic parametric oscillator as the spins to implement the Ising machine with large scale and also high coherence under room temperature. The proposed machine supports 10,000 spins, and the high coherence leads to accurate computation. Moreover, the Ising machine is highly compatible with high-speed electronic devices for programmability, paving a low-cost, accurate, and easy-to-implement way toward to solve real-world 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.
Photonic Ising machines exploit the intrinsic parallelism and ultrafast speeds of optical hardware to accelerate ground-state searches for combinatorial optimization. By embedding this functionality into a reconfigurable, general-purpose hexagonal-mesh photonic processor, we obtain a scalable platform capable to address diverse optimization tasks. We present a novel optoelectronic Ising solver in which the programmable photonic chip performs on-chip matrix multiplications to evaluate the Hamiltonian, while an electronic simulated-annealing loop drives iterative spin updates. As a proof of concept, we implement our architecture on the 72-unit-cell SmartLight processor and experimentally solve a three-node ferromagnetic coupling problem with external bias. To our knowledge, this constitutes the first demonstration of an Ising machine on a general-purpose hexagonal photonic mesh, paving the way for integrated photonic accelerators in optical computing and signal processing systems.
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.