Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Conference on Lasers and Electro-Optics

Photonic Ising Machines with Highest Coupling Resolution

Huaqiang Li, Guangfeng Wang, Erez Hasman, Bo Wang, Xianfeng Chen

Published Jan 1, 2026• 0 citations
Publisher

Abstract

We present a novel photonic Ising machine based on Sidon set, which demonstrates a record-high coupling resolution. These results pave the way toward Ising machines capable of faithfully modeling real-world optimization problems.
DOI
10.1364/cleo_si.2026.sw2d.4

Related papers

Erdos-Turan photonic Ising machines with record-high coupling resolution

Huaqiang Li, Guangfeng Wang, Erez Hasman +2 more

Ising machines have emerged as promising platforms for efficiently tackling a wide range of combinatorial optimization problems relevant to resource allocation, statistical inference and deep learning, yet their practical utility is fundamentally constrained by the coarse resolution of spin-spin couplings (Jij). Current implementations, relying on direct modulation of physical parameters, achieve at most 256 discrete coupling levels, which severely hinder the faithfully modeling of arbitrary real-valued interactions in realistic applications. Here we present a novel photonic Ising machine that encodes spins in random lattices while programming couplings in the momentum space of light. By introducing the Sidon set-a mathematical structure ensuring pairwise difference uniqueness - and employing the Erdos-Turan bound, we establish an optical framework in which each spin pair can be assigned a unique Jij. This approach decouples the resolution limit from hardware modulation to the spatial precision in the momentum space of light. Experimentally, we demonstrate a record-high coupling resolution of 7,038 on a simple photonic platform, surpassing previous Ising machines. Our results highlight the power of uniting discrete mathematics with momentum-space photonics, paving the way toward scalable Ising machines capable of faithfully modeling real-world optimization problems.

arXiv:2510.01998•Oct 2, 2025•3 citations

Optical Ising machine

Ming Li, Yanbo Ren

Optical Ising machines harness physical dynamics for combinatorial optimization, with integrated photonics enabling scalable, high-speed, energy-efficient solutions for real-world applications.

National Science Review•May 11, 2026•1 citation

Photonic Ising machines for combinatorial optimization problems

Yuan Gao, Guanyu Chen, Qi Luo +3 more

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.

Applied Physics Reviews•Oct 14, 2024•40 citations

Improving photonic Ising machines by way of a stability analysis of steady states

Jacob Lamers, Guy Verschaffelt, Guy Van der Sande

With increasing computational demands, the importance of efficient computer architectures rises. Photonic Ising machines offer a promising approach to address complex binary optimization problems by leveraging the speed and bandwidth inherent in photonic systems. When the cost function of an optimization problem can be mapped to the energy of an Ising problem, the ground state of the latter will represent the optimal solution. We conduct a stability analysis on this ground state of various benchmark problems. This analysis reveals that some benchmark problems are manageable for all Ising machine implementations. However, there are other problems for which the probability of achieving the ground state depends on the physical implementation. Our analysis shows the reasons for this advantage, leading us to formulate strategies to further enhance Ising machines and pave the way for future research. In future work, we will investigate if photonic Ising machines utilizing a different nonlinearity possess a distinct advantage in this context.

SPIE Machine Learning in Photonics•Jun 18, 2024•0 citations

Photonic Ising machines toward and beyond a million spins

Abdul Rahim Aadhi, Nayem Al Kayed, Tristan Austin +8 more

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.

arXiv:2607.13446•Jul 15, 2026•2 citations

Chip-scale wavelength-domain optical Ising machine

Xinyu Liu, Wenkai Zhang, Wenguang Xu +4 more

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.

Advanced Photonics Nexus•Aug 18, 2025•2 citations
Ising machines have emerged as promising platforms for efficiently tackling a wide range of combinatorial optimization problems relevant to resource allocation, statistical inference and deep learning, yet their practical utility is fundamentally constrained by the coarse resolution of spin-spin couplings (Jij). Current implementations, relying on direct modulation of physical parameters, achieve at most 256 discrete coupling levels, which severely hinder the faithfully modeling of arbitrary real-valued interactions in realistic applications. Here we present a novel photonic Ising machine that encodes spins in random lattices while programming couplings in the momentum space of light. By introducing the Sidon set-a mathematical structure ensuring pairwise difference uniqueness - and employing the Erdos-Turan bound, we establish an optical framework in which each spin pair can be assigned a unique Jij. This approach decouples the resolution limit from hardware modulation to the spatial precision in the momentum space of light. Experimentally, we demonstrate a record-high coupling resolution of 7,038 on a simple photonic platform, surpassing previous Ising machines. Our results highlight the power of uniting discrete mathematics with momentum-space photonics, paving the way toward scalable Ising machines capable of faithfully modeling real-world 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.
With increasing computational demands, the importance of efficient computer architectures rises. Photonic Ising machines offer a promising approach to address complex binary optimization problems by leveraging the speed and bandwidth inherent in photonic systems. When the cost function of an optimization problem can be mapped to the energy of an Ising problem, the ground state of the latter will represent the optimal solution. We conduct a stability analysis on this ground state of various benchmark problems. This analysis reveals that some benchmark problems are manageable for all Ising machine implementations. However, there are other problems for which the probability of achieving the ground state depends on the physical implementation. Our analysis shows the reasons for this advantage, leading us to formulate strategies to further enhance Ising machines and pave the way for future research. In future work, we will investigate if photonic Ising machines utilizing a different nonlinearity possess a distinct advantage in this context.
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.
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.