The ability to simulate XY models of classical spins is rather important, since e.g. it is related to solving NP-hard optimization problems. This study uses a photonic simulator to realize XY Hamiltonians with arbitrary spin connections and coupling strengths. The key unit is an optical system for vector-matrix multiplication that can perform arbitrary transformations of complex matrices. The Berezinskii-Kosterlitz-Thouless transition and ground-state search of several XY models are demonstrated experimentally. Thus this Letter provides an effective alternative approach for investigating such models and solving continuous quadratic optimization problems with optical systems.
The ability to simulate XY models of classical spins is rather important, since e.g. it is related to solving NP-hard optimization problems. This study uses a photonic simulator to realize XY Hamiltonians with arbitrary spin connections and coupling strengths. The key unit is an optical system for vector-matrix multiplication that can perform arbitrary transformations of complex matrices. The Berezinskii-Kosterlitz-Thouless transition and ground-state search of several XY models are demonstrated experimentally. Thus this Letter provides an effective alternative approach for investigating such models and solving continuous quadratic optimization problems with optical systems.
In this work, we proposed and experimentally demonstrated a photonic simulator for XY models, which is a typical kind of classical spin models. By encoding the XY spins on the phase term of the input light field, the corresponding XY Hamiltonian could be performed on the output light intensities. The simulator is mainly based on a programmable and reconfigurable optical vector-matrix multiplication system, which can map arbitrary XY models within the dimensionality limit. Here, we demonstrated the Berezinskii-Kosterlitz-Thouless transition in a two-dimensional XY model, in which the expectation values of some observables are calculated and consistent with the theory. Besides, we performed the ground state search of two 25-spin XY models with different spin connections and coupling strengths. Our proposal paves a new way to investigate the XY spin system.
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.
Solving large-scale computationally hard optimization problems using existing computers has hit a bottleneck. A promising alternative approach uses physics-based phenomena to naturally solve optimization problems, wherein the physical phenomena evolve to their minimum energy. In this regard, photonics devices have shown promise as alternative optimization architectures, benefiting from high-speed, high-bandwidth, and parallelism in the optical domain. Among photonic devices, programmable spatial light modulators (SLMs) have shown promise in solving large scale Ising model problems, to which many computationally hard problems can be mapped. Despite much progress, existing SLMs for solving the Ising model and similar problems suffer from slow update rates and physical bulkiness. Here, we show that using a compact silicon photonic integrated circuit optical phased array (PIC-OPA), we can simulate an XY Hamiltonian, a generalized form of the Ising Hamiltonian, where spins can vary continuously. In this nanophotonic XY Hamiltonian solver, the spins are implemented using analog phase shifters in the optical phased array. The far field intensity pattern of the PIC-OPA represents an all-to-all coupled XY Hamiltonian energy and can be optimized with the tunable phase-shifters, allowing us to solve an all-to-all coupled XY model. Our results show the utility of PIC-OPAs as compact, low power, and high-speed solvers for nondeterministic polynomial-hard problems. The scalability of the silicon PIC-OPA and its compatibility with monolithic integration with CMOS electronics further promise the realization of a powerful hybrid photonic/electronic non-Von Neumann compute engine.
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.
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.
Photonic Ising Machines constitute an emergent new paradigm of computation, geared towards tackling combinatorial optimization problems that can be reduced to the problem of finding the ground state of an Ising model. Spatial Photonic Ising Machines have proven to be advantageous for simulating fully connected large-scale spin systems. However, fine control of a general interaction matrix J has so far only been accomplished through eigenvalue decomposition methods that either limit the scalability or increase the execution time of the optimization process. We introduce and experimentally validate a SPIM instance that enables direct control over the full interaction matrix, enabling the encoding of Ising Hamiltonians with arbitrary couplings and connectivity. We demonstrate the conformity of the experimentally measured Ising energy with the theoretically expected values 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 greatly expands the applicability of SPIMs for real-world applications without sacrificing any of the inherent advantages of the system, and paves the way to encoding the full range of NP problems that are known to be equivalent to Ising models, on SPIM devices.