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

Optical Fiber Communication Conference

Solving Vertex Cover Problem using Quadrature Photonic Spatial Ising Machine

Wenchen Sun, Wenjia Zhang, Yuanyuan Liu, Qingwen Liu, Zuyuan He

Published Jan 1, 2022• 1 citation
Publisher

Abstract

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.
DOI
10.1364/ofc.2022.m2g.4

Related papers

Quadrature Photonic Spatial Ising Machine

Wenjia Zhang, Wencheng Sun, Yuanyuan Liu +3 more

Abstract The mining in physics and biology for accelerating the hardcore algorithm to solve non-deterministic polynomial (NP) hard problems has inspired a great amount of special-purpose ma-chine models. Ising machine has become an efficient solver for various combinatorial optimization problems. As a computing accelerator, large-scale photonic spatial Ising machine have great advantages and potentials due to excellent scalability and compact system. However, current fundamental limitation of photonic spatial Ising machine is the configuration flexibility of problem implementation in the accelerator model. Arbitrary spin interaction is highly desired for solving various NP hard problems. Moreover, the absence of external magnetic field in the proposed photonic Ising machine will further narrow the freedom to map the optimization applications. In this paper, we propose a novel quadrature photonic spatial Ising machine to break through the limitation of photonic Ising accelerator by synchronous phase manipulation in two and three sections. Max-cut problem solution with graph order of 100 and density from 0.5 to 1 is experimentally demonstrated after almost 100 iterations. We derive and verify using simulation the solution for Max-cut problem with more than 1600 nodes and the system tolerance for light misalignment. Moreover, vertex cover problem, modeled as an Ising model with external magnetic field, has been successfully implemented to achieve the optimal solution. Our work suggests flexible problem solution by large-scale photonic spatial Ising machine.

•Jun 16, 2021•2 citations

Photonic Spatial-Euler Ising Machine for Solving 20000-vertex Max-cut Problem

Xin Ye, Wenjia Zhang, Shaomeng Wang +3 more

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.

•Jan 1, 2023•1 citation

Quadrature photonic spatial Ising machine

Wenchen Sun, Wenjia Zhang, Yuanyuan Liu +2 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•35 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•14 citations

General Spatial Photonic Ising Machine Based on Interaction Matrix Eigendecomposition Method

Wang, Shaomeng, 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 mapping an arbitrary problem to Ising model. In this paper, we propose a general spatial photonic Ising machine based on interaction matrix eigendecomposition method. 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 is required by intensity modulation to guarantee the best probability of optimal solution for a 20-vertex graph Max-cut problem, and this probability decreases to below 20% for zero best chance. Our work provides a viable approach for spatial photonic Ising machines to solve arbitrary combinatorial optimization problems with the help of multi-dimensional optical property.

arXiv:2306.10076•Jun 16, 2023•0 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.

Applied Optics•Mar 20, 2024•12 citations
Abstract The mining in physics and biology for accelerating the hardcore algorithm to solve non-deterministic polynomial (NP) hard problems has inspired a great amount of special-purpose ma-chine models. Ising machine has become an efficient solver for various combinatorial optimization problems. As a computing accelerator, large-scale photonic spatial Ising machine have great advantages and potentials due to excellent scalability and compact system. However, current fundamental limitation of photonic spatial Ising machine is the configuration flexibility of problem implementation in the accelerator model. Arbitrary spin interaction is highly desired for solving various NP hard problems. Moreover, the absence of external magnetic field in the proposed photonic Ising machine will further narrow the freedom to map the optimization applications. In this paper, we propose a novel quadrature photonic spatial Ising machine to break through the limitation of photonic Ising accelerator by synchronous phase manipulation in two and three sections. Max-cut problem solution with graph order of 100 and density from 0.5 to 1 is experimentally demonstrated after almost 100 iterations. We derive and verify using simulation the solution for Max-cut problem with more than 1600 nodes and the system tolerance for light misalignment. Moreover, vertex cover problem, modeled as an Ising model with external magnetic field, has been successfully implemented to achieve the optimal solution. Our work suggests flexible problem solution by large-scale photonic spatial Ising machine.
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 mapping an arbitrary problem to Ising model. In this paper, we propose a general spatial photonic Ising machine based on interaction matrix eigendecomposition method. 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 is required by intensity modulation to guarantee the best probability of optimal solution for a 20-vertex graph Max-cut problem, and this probability decreases to below 20% for zero best chance. Our work provides a viable approach for spatial photonic Ising machines to solve arbitrary combinatorial optimization problems with the help of multi-dimensional optical property.
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.