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

arXiv:2301.04651 · Science China Information Sciences

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

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

Published Nov 20, 2023• 14 citations
arXivHTMLPDF
DOI
10.1007/s11432-023-3890-2

Related papers

A Coherent Ising Machine for MAX-CUT Problems: Performance Evaluation against Semidefinite Programming and Simulated Annealing

Yoshitaka Haribara, Shoko Utsunomiya, Y. Yamamoto

arXiv:1501.07030•Lecture notes in physics•Dec 29, 2015•64 citations

Benchmarking coherent Ising machines and quantum annealers with MAX-CUT and SK problems

Ryan Hamerly, Takahiro Inagaki, Peter L. McMahon +10 more

Bulletin of the American Physical Society•Mar 6, 2019•0 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

An FPGA Implementation of Fast 2D-Ising-Model Solver for the Max-Cut Problem

英範 業天, 正之 廣本, 高史 佐藤

IEICE technical report. Speech•Feb 29, 2016•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

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
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.