Artificial spin systems are used to solve combinatorial optimization problems by mapping them to the ground state search of the Ising model. Ising machines of various designs, in fields as diverse as photonics and electronics, have been proposed and demonstrated in recent years. One important mathematical operation required in photonic Ising machines for nearly all Hamiltonian minimization algorithms is repeated matrix–vector multiplication with the vector size limited by the physical size of the optical system. Herein, an integrated photonic Ising machine based on matrix partitioning and phase encoding, which effectively allows the use of physically small optical circuits to handle arbitrarily large spin vectors, is proposed. All the complicated calculations are carried out optically, rather than electronically, in this approach. How the required surface area of a hypothetical chip‐based photonic Ising machine can be resized according to convenience, with the trade‐off being the solution time, and that this trade‐off can be done in a way that does not impact the algorithm's efficacy, is shown. Through simulation, the system is predicted to have a high success rate, high noise tolerance, and high error tolerance.
Artificial spin systems are used to solve combinatorial optimization problems by mapping them to the ground state search of the Ising model. Ising machines of various designs, in fields as diverse as photonics and electronics, have been proposed and demonstrated in recent years. One important mathematical operation required in photonic Ising machines for nearly all Hamiltonian minimization algorithms is repeated matrix–vector multiplication with the vector size limited by the physical size of the optical system. Herein, an integrated photonic Ising machine based on matrix partitioning and phase encoding, which effectively allows the use of physically small optical circuits to handle arbitrarily large spin vectors, is proposed. All the complicated calculations are carried out optically, rather than electronically, in this approach. How the required surface area of a hypothetical chip‐based photonic Ising machine can be resized according to convenience, with the trade‐off being the solution time, and that this trade‐off can be done in a way that does not impact the algorithm's efficacy, is shown. Through simulation, the system is predicted to have a high success rate, high noise tolerance, and high error tolerance.
Ising machines promise scaling advantages when solving highly complex combinatorial optimization problems compared to traditional computers. To fully exploit this, highly parallel physical systems must be identified. Here, we constructed and characterized an all-optical Ising machine utilizing a free-space Mach–Zehnder interferometer, which theoretically supports an unlimited number of spins and all-to-all programmable spin interactions via a matrix partitioning method. Crucially, in our proposed system, all bottleneck-producing mathematical operations like matrix-vector multiplication and nonlinear operations are performed optically in parallel, while electronic devices only need to execute simple arithmetic such as addition and storage/retrieval, ensuring fast nominal operation speeds. With periodic auto-calibration, the Ising machine has achieved over 160 h of high optical stability and accurate calculation. The machine is experimentally demonstrated with MAXCUT problems involving 1024 spins. The design itself is highly amenable to fabrication on an integrated chip-based photonics platform; a smooth trade-off exists between chip size and solution time.
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 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.
Abstract Ising machines can efficiently solve real-world combinatorial optimization problems. Among them, photonic Ising machines (PIMs) exploit the parallelism and broadband bandwidth of optical systems to outperform digital computers in certain metrics. However, the bulky footprint of conventional discrete components imposes significant limitations on the miniaturization of current PIMs. Meanwhile, the scalability of problem size and spin connectivity density is constrained by limited computational resources. To address these challenges, we proposed and demonstrated an integrated PIM (IPIM) based on a hybrid architecture on a silicon-based photonic platform with an optical component footprint of 0.065 mm², achieved success rates exceeding 90% in finding global optimal solutions across all three benchmark tests. To tackle the common challenge in PIMs, where large-scale and high-connectivity-density problems naturally incur high computational complexity, we developed a joint algorithm with sparsity, inverse sparsity, and decomposition operations (JA-SID). Using this approach, we successfully solved Ising problems with sparse and dense spin connectivity, involving 102,400 spins. In addition, we introduced an optimized parameter configuration scheme (OPCS), which reduced the iteration count by over 50% for slowly converging problems, thereby lowering time complexity and power consumption. In practice, we used the IPIM to successfully partition a Facebook social network with over 60,000 users, demonstrating its capability to handle ultra-large-scale real-world problems. Our research substantially extended the applicability of IPIM, offering a promising solution to the increasing global demand for computational resources.
The Ising machine (IM) has emerged as a promising tool for tackling nondeterministic polynomial-time hard combinatorial optimization problems in real-world applications. Among various types of IMs, optoelectronic IMs based on electro-optical (EO) modulators stand out as an impressive platform for Ising computations. They offer a simple and stable architecture, with the EO modulator providing a natural inline nonlinear transfer function for the Ising model. However, integrated optoelectronic IMs have not been demonstrated until now, and exploring large-scale computations within the constraints of digital hardware resources remains an open challenge for these systems. In this paper, an integrated optoelectronic IM based on a thin-film lithium niobate (TFLN) photonic chip is presented, in conjunction with a sparse matrix–vector multiplication algorithm embedded in a field-programmable gate array that optimizes hardware resource utilization and minimizes computational latency. This setup allows us to solve multiple types of MAX-CUT problems with up to 2048 spins and achieve a remarkably low iteration latency of 1.78 μs. To further address the constraints posed by digital devices when tackling larger-scale Ising problems, we extend the application of the TFLN chip to yet another new scheme in which the single, compact on-chip modulator concurrently performs operations of linear multiplication and nonlinear transformation. This scheme demonstrates the capability to address large-scale MAX-CUT problems involving up to 16,384 spins, which, to the best of our knowledge, are the largest-scale problems solved on an on-chip IM, highlighting its potential to overcome digital limitations. The TFLN-based optoelectronic IMs provide a compact solution with high scalability for potentially practical applications in addressing complex combinatorial optimization 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.