Recently various physical systems have been proposed for modeling Ising spin Hamiltonians appealing to solve combinatorial optimization problems with remarkable performance. However, how to implement arbitrary spin-spin interactions is a critical and challenging problem in unconventional Ising machines. Here, we propose a general gauge transformation scheme to enable arbitrary spin-spin interactions and external magnetic fields as well, by decomposing an Ising Hamiltonian into multiple Mattis-type interactions. With this scheme, a wavelength-division multiplexing spatial photonic Ising machine (SPIM) is developed to show the programmable capability of general spin coupling interactions. We exploit the wavelength-division multiplexing SPIM to simulate three spin systems: ± J models, Sherrington-Kirkpatrick models, and only locally connected J 1 - J 2 models and observe the phase transitions. We also demonstrate the ground-state search for solving Max-Cut problem with the wavelength-division multiplexing SPIM. These results promise the realization of ultrafast-speed and high–power efficiency Boltzmann sampling to a generalized large-scale Ising model.
Recently various physical systems have been proposed for modeling Ising spin Hamiltonians appealing to solve combinatorial optimization problems with remarkable performance. However, how to implement arbitrary spin-spin interactions is a critical and challenging problem in unconventional Ising machines. Here, we propose a general gauge transformation scheme to enable arbitrary spin-spin interactions and external magnetic fields as well, by decomposing an Ising Hamiltonian into multiple Mattis-type interactions. With this scheme, a wavelength-division multiplexing spatial photonic Ising machine (SPIM) is developed to show the programmable capability of general spin coupling interactions. We exploit the wavelength-division multiplexing SPIM to simulate three spin systems: ± J models, Sherrington-Kirkpatrick models, and only locally connected J 1 - J 2 models and observe the phase transitions. We also demonstrate the ground-state search for solving Max-Cut problem with the wavelength-division multiplexing SPIM. These results promise the realization of ultrafast-speed and high–power efficiency Boltzmann sampling to a generalized large-scale Ising model.
ABSTRACT Spatial photonic Ising machines (SPIMs) offer a promising physical computing architecture for solving NP‐hard combinatorial optimization problems. However, when applied to models with sparse spin interactions, conventional SPIMs still employ a fully connected scheme, which demands digital preprocessing to decompose the interaction matrix and encode full spin interactions, leading to massive resource consumption on spatial light modulators (SLMs) when the spin size is large. Here, we propose and experimentally demonstrate a wavelength‐division multiplexing scheme to enable sparse spin interactions for SPIMs, where only the non‐zero spin interactions are encoded by SLMs, bypassing the need for preprocessing computation. Leveraging the non‐Von Neumann architecture of photonic computing, this method reduces the computational complexity of a single‐spin update in Metropolis–Hastings sampling from to . We successfully applied this system to solve the Max‐Cut problem across various sparse graphs, achieving a considerable probability of finding optimal or near‐optimal solutions, with performance comparable to classical simulated annealing. The proposed spatial encoding scheme requires linear resources scaling with the number of connections between spins, providing a highly scalable and energy‐efficient optical accelerator platform for large‐scale sparse combinatorial optimization.
Ising machines are an emerging class of hardware that promises ultrafast and energy-efficient solutions to NP-hard combinatorial optimization problems. Spatial photonic Ising machines (SPIMs) exploit optical computing in free space to accelerate the computation, showcasing parallelism, scalability, and low power consumption. However, current SPIMs can implement only a restricted class of problems. This partial programmability is a critical limitation that hampers their benchmark. Achieving full programmability of the device while preserving its scalability is an open challenge. Here, we report a fully programmable SPIM achieved through a novel operation method based on the division of the focal plane. In our scheme, a general Ising problem is decomposed into a set of Mattis Hamiltonians, whose energies are simultaneously computed optically by measuring the intensity on different regions of the camera sensor. Exploiting this concept, we experimentally demonstrate the computation with high success probability of ground-state solutions of up to 32-spin Ising models on unweighted maximum cut graphs with and without ferromagnetic bias. Simulations of the hardware prove a favorable scaling of the accuracy with the number of spin. Our fully programmable SPIM enables the implementation of many quadratic unconstrained binary optimization problems, further establishing SPIMs as a leading paradigm in non-von Neumann hardware.
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.
Spatial photonic Ising machines offer a novel optical platform for optimization and spin-model simulation, but existing diffraction-based schemes rely on auxiliary spins or multiplexing to encode high-rank couplings and external fields, reducing either speed or spin count. We demonstrate an amplitude-only, rank-free spatial photonic Ising machine in which arbitrary Ising Hamiltonians are encoded as Hadamard products on aligned amplitude and binary spatial modulators and read out by a single-pixel intensity measurement. The machine directly programs fully connected 797-spin Ising models with external fields at nearly 9-bit precision and operates at a constant iteration rate of ~200 Hz. By removing zero-valued product terms, the same architecture scales to sparse problems and experimentally solves a Max-Cut instance on a 424,108-vertex Mobius ladder graph. We also observe the phase transition of the Sherrington-Kirkpatrick model, demonstrating programmable optical simulation beyond low-rank couplings. These results establish amplitude modulation as a scalable route to programmable photonic Ising machines.
Photonic Ising machines constitute an emergent new paradigm of computation geared toward tackling combinatorial optimization problems that can be reduced to the problem of finding the ground state of an Ising model. Spatial photonic Ising machines (SPIMs) have proven advantageous for simulating fully connected large-scale spin systems. Fine control of a general interaction matrix J has been accomplished so far only through matrix decomposition methods. We introduce and experimentally validate a SPIM instance that enables direct control over the full interaction matrix, allowing the encoding of Ising Hamiltonians with arbitrary couplings and connectivity. We demonstrate the conformity of the experimentally measured Ising energy with the theoretically expected value and then proceed to solve both the unweighted and weighted graph partitioning problems, showcasing a systematic convergence to an optimal solution via simulated annealing. Our approach significantly expands the applicability of SPIMs for real-world applications, as it is more efficient than matrix decomposition methods in the case of sparse problems. It paves the way to encoding the full range of NP problems that are known to be equivalent to Ising models on SPIM devices.
Solving combinational optimization problems, which are known to be non-deterministic polynomial hard, is useful in a wide range of fields, including transportation and finance. A spatial photonic Ising machine (SPIM) enables problems with a large number of combinations to be solved by encoding the spin variables into phase [1]. However, it is difficult to handle various types of problems because the degree of freedom of the interaction between spin variables is equal to the number of spin variables. In this study, we propose a method for expanding the flexibility of the interaction between spin variables by parallel processing using space-division multiplexing. Space-division multiplexing can be used to process components of the Ising Hamiltonian simultaneously, and a wide range of Ising Hamiltonians can be represented by synthesizing the individual results.