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 Spatial-Euler Ising Machine for Solving 20000-vertex Max-cut Problem

Xin Ye, Wenjia Zhang, Shaomeng Wang, Xiaoxuan Yang, Jiangbing Du, Zuyuan He

Published Jan 1, 2023• 1 citation
Publisher

Abstract

We propose a novel quadrature photonic spatial-Euler Ising machine to realize flexible spin-interaction configuration and spin-flip in a single SLM. A 20000-vertex max-cut problem is experimentally solved, showing 80% improvement compared to simulation results and 49% over heuristic algorithm.
DOI
10.1364/cleo_at.2023.jth2a.32

Related papers

Quadrature photonic spatial Ising machine

Wenjia Zhang, Wencheng Sun, Yuanyuan Liu +3 more

As a computing accelerator, a large-scale photonic spatial Ising machine has great advantages and potential due to its excellent scalability and compactness. However, the current fundamental limitation of a photonic spatial Ising machine is the configuration flexibility for problem implementation in the accelerator model. Arbitrary spin interactions are highly desired for solving various non-deterministic polynomial (NP)-hard problems. In this paper, we propose a novel quadrature photonic spatial Ising machine to break through the limitation of the photonic Ising accelerator by synchronous phase manipulation in two sections. The max-cut problem solution with a graph order of 100 and density from 0.5 to 1 is experimentally demonstrated after almost 100 iterations. Our work suggests flexible problem solving by the large-scale photonic spatial Ising machine.

arXiv:2105.09307•Optics Letters•Feb 9, 2022•39 citations

20736-node weighted max-cut problem solving by quadrature photonic spatial Ising machine

Xin Ye, Wenjia Zhang, Shaomeng Wang +2 more

arXiv:2301.04651•Science China Information Sciences•Nov 20, 2023•18 citations

General spatial photonic Ising machine based on the interaction matrix eigendecomposition method

Shaomeng Wang, Wenjia Zhang, Xin Ye +1 more

The spatial photonic Ising machine has achieved remarkable advancements in solving combinatorial optimization problems. However, it still remains a huge challenge to flexibly map an arbitrary problem to the Ising model. In this paper, we propose a general spatial photonic Ising machine based on the interaction matrix eigendecomposition method. The arbitrary interaction matrix can be configured in the two-dimensional Fourier transformation based spatial photonic Ising model by using values generated by matrix eigendecomposition. The error in the structural representation of the Hamiltonian decreases substantially with the growing number of eigenvalues utilized to form the Ising machine. In combination with the optimization algorithm, as low as ∼65% of the eigenvalues are required by intensity modulation to guarantee the best probability of optimal solution for a 20-vertex graph Max-cut problem, and this percentage decreases to below ∼20% for near-zero probability. The 4-spin experiments and error analysis demonstrate the Hamiltonian linear mapping and ergodic optimization. Our work provides a viable approach for spatial photonic Ising machines to solve arbitrary combinatorial optimization problems with the help of the multi-dimensional optical property.

arXiv:2306.10076•Applied Optics•Mar 20, 2024•13 citations

Solving Vertex Cover Problem using Quadrature Photonic Spatial Ising Machine

Wenchen Sun, Wenjia Zhang, Yuanyuan Liu +2 more

In this paper, we solve the 1600-vertex cover problem by a novel quadrature photonic spatial Ising machine. Our work suggests flexible combinational optimization problem solving for Ising models with external magnetic field.

Optical Fiber Communication Conference•Jan 1, 2022•1 citation

Aberration compensation-enabled large-scale antiferromagnetic spatial photonic Ising machine

Rongwei Zhu, Guoqing Ma, Fenglu Zheng +1 more

The spatial photonic Ising machine (SPIM) is a simple and elegant architecture capable of expanding the spin scale with ease, and thus this optical architecture is attractive for its potential in solving large-scale combinatorial optimization problems. Here, we propose a scheme for aberration compensation to improve the computing accuracy of the SPIM based on a spatial light modulator (SLM), resulting in good scalability. First, the gamma curve of the SLM is corrected with the help of double-hole interference fringes. Then, an enhanced phase shift interferometry is used to measure the aberration of the entire optical system, and this aberration is compensated by loading the compensation phase on the SLM. Moreover, an iterative algorithm using self-adaptive cluster flipping is proposed for accelerating the convergence of SPIM. During the converging process, the number of flipped spins within the cluster is updated dynamically according to the convergence speed and accuracy, which makes it possible to achieve a good balance between high speed and high accuracy. Further, a proof-of-principle experimental set-up of the optimized SPIM is implemented, and the ground-state search of an antiferromagnetic Ising model is demonstrated. As an example, this optimized Ising machine is used for solving the number partitioning problem. It is shown that the partition of 40,000 random numbers is well demonstrated, and the final partitioning accuracy is as high as 99.88%.

Holography, Diffractive Optics, and Applications•Oct 12, 2023•0 citations

Parallel spatial photonic Ising machine using spatial multiplexing for accelerating combinatorial optimization

Suguru Shimomura, Jun Tanida, Yusuke Ogura

A spatial photonic Ising machine (SPIM) handles large-scale combinatorial optimization problems due to optical processing with spatial parallelism. However, iterative feedback in the search for an optimal solution limits processing speed, even though the Ising Hamiltonian is computed optically. We propose a parallel spatial photonic Ising machine (pSPIM) utilizing spatial multiplexing to search for an optimal solution efficiently. By employing grating patterns and encoding multiple configurations of Ising spins in a phase distribution, several Ising Hamiltonians are computed simultaneously. We demonstrated that the optimal solutions of max-cut problems with 100 Ising spins were obtained more frequently as the number of processing units increased. In addition, combining the multicomponent model with parallel processing provides an efficient search for optimal solutions to problems represented by using interaction matrices with a rank greater than one. The spin-update strategy of pSPIM offers an effective approach for efficiently solving large-scale combinatorial optimization problems.

arXiv:2502.18918•Optics Letters•Oct 7, 2025•5 citations
As a computing accelerator, a large-scale photonic spatial Ising machine has great advantages and potential due to its excellent scalability and compactness. However, the current fundamental limitation of a photonic spatial Ising machine is the configuration flexibility for problem implementation in the accelerator model. Arbitrary spin interactions are highly desired for solving various non-deterministic polynomial (NP)-hard problems. In this paper, we propose a novel quadrature photonic spatial Ising machine to break through the limitation of the photonic Ising accelerator by synchronous phase manipulation in two sections. The max-cut problem solution with a graph order of 100 and density from 0.5 to 1 is experimentally demonstrated after almost 100 iterations. Our work suggests flexible problem solving by the large-scale photonic spatial Ising machine.
The spatial photonic Ising machine has achieved remarkable advancements in solving combinatorial optimization problems. However, it still remains a huge challenge to flexibly map an arbitrary problem to the Ising model. In this paper, we propose a general spatial photonic Ising machine based on the interaction matrix eigendecomposition method. The arbitrary interaction matrix can be configured in the two-dimensional Fourier transformation based spatial photonic Ising model by using values generated by matrix eigendecomposition. The error in the structural representation of the Hamiltonian decreases substantially with the growing number of eigenvalues utilized to form the Ising machine. In combination with the optimization algorithm, as low as ∼65% of the eigenvalues are required by intensity modulation to guarantee the best probability of optimal solution for a 20-vertex graph Max-cut problem, and this percentage decreases to below ∼20% for near-zero probability. The 4-spin experiments and error analysis demonstrate the Hamiltonian linear mapping and ergodic optimization. Our work provides a viable approach for spatial photonic Ising machines to solve arbitrary combinatorial optimization problems with the help of the multi-dimensional optical property.
The spatial photonic Ising machine (SPIM) is a simple and elegant architecture capable of expanding the spin scale with ease, and thus this optical architecture is attractive for its potential in solving large-scale combinatorial optimization problems. Here, we propose a scheme for aberration compensation to improve the computing accuracy of the SPIM based on a spatial light modulator (SLM), resulting in good scalability. First, the gamma curve of the SLM is corrected with the help of double-hole interference fringes. Then, an enhanced phase shift interferometry is used to measure the aberration of the entire optical system, and this aberration is compensated by loading the compensation phase on the SLM. Moreover, an iterative algorithm using self-adaptive cluster flipping is proposed for accelerating the convergence of SPIM. During the converging process, the number of flipped spins within the cluster is updated dynamically according to the convergence speed and accuracy, which makes it possible to achieve a good balance between high speed and high accuracy. Further, a proof-of-principle experimental set-up of the optimized SPIM is implemented, and the ground-state search of an antiferromagnetic Ising model is demonstrated. As an example, this optimized Ising machine is used for solving the number partitioning problem. It is shown that the partition of 40,000 random numbers is well demonstrated, and the final partitioning accuracy is as high as 99.88%.
A spatial photonic Ising machine (SPIM) handles large-scale combinatorial optimization problems due to optical processing with spatial parallelism. However, iterative feedback in the search for an optimal solution limits processing speed, even though the Ising Hamiltonian is computed optically. We propose a parallel spatial photonic Ising machine (pSPIM) utilizing spatial multiplexing to search for an optimal solution efficiently. By employing grating patterns and encoding multiple configurations of Ising spins in a phase distribution, several Ising Hamiltonians are computed simultaneously. We demonstrated that the optimal solutions of max-cut problems with 100 Ising spins were obtained more frequently as the number of processing units increased. In addition, combining the multicomponent model with parallel processing provides an efficient search for optimal solutions to problems represented by using interaction matrices with a rank greater than one. The spin-update strategy of pSPIM offers an effective approach for efficiently solving large-scale combinatorial optimization problems.