Combinatorial problems, such as the Ising problem, are hard to solve with conventional electronics. Photonic systems have recently been proposed as an efficient platform to solve these problems faster and more efficiently, thus calling for the development of featured algorithms to run on photonic machines. A few recent findings, including the Photonic Recurrent Ising Sampler, a photonic machine that recurrently solves arbitrary Ising problems, will be presented in this talk, along with their experimental realizations in various platforms.
Combinatorial problems, such as the Ising problem, are hard to solve with conventional electronics. Photonic systems have recently been proposed as an efficient platform to solve these problems faster and more efficiently, thus calling for the development of featured algorithms to run on photonic machines. A few recent findings, including the Photonic Recurrent Ising Sampler, a photonic machine that recurrently solves arbitrary Ising problems, will be presented in this talk, along with their experimental realizations in various platforms.
The inability of conventional electronic architectures to efficiently solve large combinatorial problems motivates the development of novel computational hardware. There has been much effort toward developing application-specific hardware across many different fields of engineering, such as integrated circuits, memristors, and photonics. However, unleashing the potential of such architectures requires the development of algorithms which optimally exploit their fundamental properties. Here, we present the Photonic Recurrent Ising Sampler (PRIS), a heuristic method tailored for parallel architectures allowing fast and efficient sampling from distributions of arbitrary Ising problems. Since the PRIS relies on vector-to-fixed matrix multiplications, we suggest the implementation of the PRIS in photonic parallel networks, which realize these operations at an unprecedented speed. The PRIS provides sample solutions to the ground state of Ising models, by converging in probability to their associated Gibbs distribution. The PRIS also relies on intrinsic dynamic noise and eigenvalue dropout to find ground states more efficiently. Our work suggests speedups in heuristic methods via photonic implementations of the PRIS.
The failure of conventional electronic architectures to solve large combinatorial problems motivates the development of novel computational architectures. There has been much effort recently in developing photonic networks which can exploit fundamental properties enshrined in the wave nature of light and of its interaction with matter: high-speed, low-power, optical passivity, and parallelization. However, unleashing the true potential of photonic architectures requires the development of featured algorithms which largely exploit these fundamental properties. We here present the Photonic Recurrent Ising Sampler (PRIS), an algorithm tailored for photonic parallel networks that can sample combinatorially hard distributions of Ising problems, in a fast and efficient manner. The PRIS finds the ground state of general ising problems and is able to probe critical behaviors of universality classes and their critical exponents. In addition to the attractive features of photonic networks, the PRIS relies on intrinsic dynamic noise to find ground states more efficiently.
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.
Conventional computing architectures have no known efficient algorithms for combinatorial optimization tasks such as the Ising problem, which requires finding the ground state spin configuration of an arbitrary Ising graph. Physical Ising machines have recently been developed as an alternative to conventional exact and heuristic solvers; however, these machines typically suffer from decreased ground state convergence probability or universality for high edge-density graphs or arbitrary graph weights, respectively. We experimentally demonstrate a proof-of-principle integrated nanophotonic recurrent Ising sampler (INPRIS), using a hybrid scheme combining electronics and silicon-on-insulator photonics, that is capable of converging to the ground state of various four-spin graphs with high probability. The INPRIS results indicate that noise may be used as a resource to speed up the ground state search and to explore larger regions of the phase space, thus allowing one to probe noise-dependent physical observables. Since the recurrent photonic transformation that our machine imparts is a fixed function of the graph problem and therefore compatible with optoelectronic architectures that support GHz clock rates (such as passive or non-volatile photonic circuits that do not require reprogramming at each iteration), this work suggests the potential for future systems that could achieve orders-of-magnitude speedups in exploring the solution space of combinatorially hard problems.
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.