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

Integrated optoelectronic Ising machine based on silicon photonics

Ziyao Zhang, Guanyu Chen, Yuan Gao, Wujie Fu, Soon Thor Lim, Anil Prabhakar, Aaron James Danner, Tao Zhu

Published Jan 1, 2025• 0 citations
Publisher

Abstract

We demonstrate an integrated optoelectronic Ising machine for combinatorial optimization problems by integrating silicon modulators and germanium photodetectors. A 100-spin MAXCUT problem with square lattice graph is successfully solved by the proposed Ising chip.
DOI
10.1364/ofc.2025.w2a.37

Related papers

Integrated Silicon Photonic Chip Ising Solver with Unlimited Spin Count and All-to-All Interactions

Yuan Gao, Guanyu Chen, Ziyao Zhang +6 more

We designed an integrated silicon photonics chip which implements an all-optical Ising machine. Experimentally, we verified the chip and successfully solved a 1024-spin MAXCUT problem with the entire system running at a kHz iteration speed, which demonstrates excellent scalability and a significantly reduced time-to-solution.

Conference on Lasers and Electro-Optics•Jan 1, 2025•1 citation

50,000-Spin Count Integrated Photonic Chip Ising Solver

Yuan Gao, Guanyu Chen, Wujie Fu +3 more

Photonic Ising machines offer a scalable advantage in solving combinatorial optimization problems compared to traditional computers. In this work, we experimentally implement a silicon photonic chip with a compact footprint of just$1.6 \text{mm}^{2}$. Meanwhile, we solve a 50,000 -spin problem entirely optically, demonstrating scalability.

IEEE Photonics Conference•Nov 9, 2025•0 citations

Scalable On-Chip Optoelectronic Ising Machine Utilizing Thin-Film Lithium Niobate Photonics

Zhenhua Li, Ranfeng Gan, Zihao Chen +8 more

The Ising machine (IM) has emerged as a promising tool for tackling nondeterministic polynomial-time hard combinatorial optimization problems in real-world applications. Among various types of IMs, optoelectronic IMs based on electro-optical (EO) modulators stand out as an impressive platform for Ising computations. They offer a simple and stable architecture, with the EO modulator providing a natural inline nonlinear transfer function for the Ising model. However, integrated optoelectronic IMs have not been demonstrated until now, and exploring large-scale computations within the constraints of digital hardware resources remains an open challenge for these systems. In this paper, an integrated optoelectronic IM based on a thin-film lithium niobate (TFLN) photonic chip is presented, in conjunction with a sparse matrix–vector multiplication algorithm embedded in a field-programmable gate array that optimizes hardware resource utilization and minimizes computational latency. This setup allows us to solve multiple types of MAX-CUT problems with up to 2048 spins and achieve a remarkably low iteration latency of 1.78 μs. To further address the constraints posed by digital devices when tackling larger-scale Ising problems, we extend the application of the TFLN chip to yet another new scheme in which the single, compact on-chip modulator concurrently performs operations of linear multiplication and nonlinear transformation. This scheme demonstrates the capability to address large-scale MAX-CUT problems involving up to 16,384 spins, which, to the best of our knowledge, are the largest-scale problems solved on an on-chip IM, highlighting its potential to overcome digital limitations. The TFLN-based optoelectronic IMs provide a compact solution with high scalability for potentially practical applications in addressing complex combinatorial optimization problems.

ACS Photonics•Mar 15, 2024•26 citations

Large scale optoelectronic Ising machine based on distributed parallel architecture

Guanyu Chen, Yuanye Xing, Wujie Fu +3 more

We propose an optoelectronic Ising machine with a distributed parallel architecture. It efficiently solves combinatorial optimization problems with up to 10,000 spins, significantly expanding the problem size that can be addressed.

Conference on Lasers and Electro-Optics•Jan 1, 2025•0 citations

Integrated photonic Ising machine with full connectivity for ultra-large-scale combinatorial optimization

Guanyu Chen, Ziyao Zhang, Yuan Gao +5 more

Abstract Ising machines can efficiently solve real-world combinatorial optimization problems. Among them, photonic Ising machines (PIMs) exploit the parallelism and broadband bandwidth of optical systems to outperform digital computers in certain metrics. However, the bulky footprint of conventional discrete components imposes significant limitations on the miniaturization of current PIMs. Meanwhile, the scalability of problem size and spin connectivity density is constrained by limited computational resources. To address these challenges, we proposed and demonstrated an integrated PIM (IPIM) based on a hybrid architecture on a silicon-based photonic platform with an optical component footprint of 0.065 mm², achieved success rates exceeding 90% in finding global optimal solutions across all three benchmark tests. To tackle the common challenge in PIMs, where large-scale and high-connectivity-density problems naturally incur high computational complexity, we developed a joint algorithm with sparsity, inverse sparsity, and decomposition operations (JA-SID). Using this approach, we successfully solved Ising problems with sparse and dense spin connectivity, involving 102,400 spins. In addition, we introduced an optimized parameter configuration scheme (OPCS), which reduced the iteration count by over 50% for slowly converging problems, thereby lowering time complexity and power consumption. In practice, we used the IPIM to successfully partition a Facebook social network with over 60,000 users, demonstrating its capability to handle ultra-large-scale real-world problems. Our research substantially extended the applicability of IPIM, offering a promising solution to the increasing global demand for computational resources.

•Sep 9, 2026•0 citations

All-optical interferometer-based Ising machine

Yuan Gao, Qi Luo, Hong‐Lin Lin +2 more

Ising machines promise scaling advantages when solving highly complex combinatorial optimization problems compared to traditional computers. To fully exploit this, highly parallel physical systems must be identified. Here, we constructed and characterized an all-optical Ising machine utilizing a free-space Mach–Zehnder interferometer, which theoretically supports an unlimited number of spins and all-to-all programmable spin interactions via a matrix partitioning method. Crucially, in our proposed system, all bottleneck-producing mathematical operations like matrix-vector multiplication and nonlinear operations are performed optically in parallel, while electronic devices only need to execute simple arithmetic such as addition and storage/retrieval, ensuring fast nominal operation speeds. With periodic auto-calibration, the Ising machine has achieved over 160 h of high optical stability and accurate calculation. The machine is experimentally demonstrated with MAXCUT problems involving 1024 spins. The design itself is highly amenable to fabrication on an integrated chip-based photonics platform; a smooth trade-off exists between chip size and solution time.

Optica•Apr 18, 2025•9 citations
Photonic Ising machines offer a scalable advantage in solving combinatorial optimization problems compared to traditional computers. In this work, we experimentally implement a silicon photonic chip with a compact footprint of just1.6mm21.6 \text{mm}^{2}1.6mm2. Meanwhile, we solve a 50,000 -spin problem entirely optically, demonstrating scalability.
The Ising machine (IM) has emerged as a promising tool for tackling nondeterministic polynomial-time hard combinatorial optimization problems in real-world applications. Among various types of IMs, optoelectronic IMs based on electro-optical (EO) modulators stand out as an impressive platform for Ising computations. They offer a simple and stable architecture, with the EO modulator providing a natural inline nonlinear transfer function for the Ising model. However, integrated optoelectronic IMs have not been demonstrated until now, and exploring large-scale computations within the constraints of digital hardware resources remains an open challenge for these systems. In this paper, an integrated optoelectronic IM based on a thin-film lithium niobate (TFLN) photonic chip is presented, in conjunction with a sparse matrix–vector multiplication algorithm embedded in a field-programmable gate array that optimizes hardware resource utilization and minimizes computational latency. This setup allows us to solve multiple types of MAX-CUT problems with up to 2048 spins and achieve a remarkably low iteration latency of 1.78 μs. To further address the constraints posed by digital devices when tackling larger-scale Ising problems, we extend the application of the TFLN chip to yet another new scheme in which the single, compact on-chip modulator concurrently performs operations of linear multiplication and nonlinear transformation. This scheme demonstrates the capability to address large-scale MAX-CUT problems involving up to 16,384 spins, which, to the best of our knowledge, are the largest-scale problems solved on an on-chip IM, highlighting its potential to overcome digital limitations. The TFLN-based optoelectronic IMs provide a compact solution with high scalability for potentially practical applications in addressing complex combinatorial optimization problems.
Abstract Ising machines can efficiently solve real-world combinatorial optimization problems. Among them, photonic Ising machines (PIMs) exploit the parallelism and broadband bandwidth of optical systems to outperform digital computers in certain metrics. However, the bulky footprint of conventional discrete components imposes significant limitations on the miniaturization of current PIMs. Meanwhile, the scalability of problem size and spin connectivity density is constrained by limited computational resources. To address these challenges, we proposed and demonstrated an integrated PIM (IPIM) based on a hybrid architecture on a silicon-based photonic platform with an optical component footprint of 0.065 mm², achieved success rates exceeding 90% in finding global optimal solutions across all three benchmark tests. To tackle the common challenge in PIMs, where large-scale and high-connectivity-density problems naturally incur high computational complexity, we developed a joint algorithm with sparsity, inverse sparsity, and decomposition operations (JA-SID). Using this approach, we successfully solved Ising problems with sparse and dense spin connectivity, involving 102,400 spins. In addition, we introduced an optimized parameter configuration scheme (OPCS), which reduced the iteration count by over 50% for slowly converging problems, thereby lowering time complexity and power consumption. In practice, we used the IPIM to successfully partition a Facebook social network with over 60,000 users, demonstrating its capability to handle ultra-large-scale real-world problems. Our research substantially extended the applicability of IPIM, offering a promising solution to the increasing global demand for computational resources.
Ising machines promise scaling advantages when solving highly complex combinatorial optimization problems compared to traditional computers. To fully exploit this, highly parallel physical systems must be identified. Here, we constructed and characterized an all-optical Ising machine utilizing a free-space Mach–Zehnder interferometer, which theoretically supports an unlimited number of spins and all-to-all programmable spin interactions via a matrix partitioning method. Crucially, in our proposed system, all bottleneck-producing mathematical operations like matrix-vector multiplication and nonlinear operations are performed optically in parallel, while electronic devices only need to execute simple arithmetic such as addition and storage/retrieval, ensuring fast nominal operation speeds. With periodic auto-calibration, the Ising machine has achieved over 160 h of high optical stability and accurate calculation. The machine is experimentally demonstrated with MAXCUT problems involving 1024 spins. The design itself is highly amenable to fabrication on an integrated chip-based photonics platform; a smooth trade-off exists between chip size and solution time.