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

Photonics Research

Integrated spatial photonic XY Ising sampler based on a high-uniformity 1 × 8 multi-mode interferometer

Xin Ye, Wenjia Zhang, Zuyuan He

Published Mar 17, 2025• 5 citations
Publisher

Abstract

Spatial photonic Ising machines, as emerging artificial intelligence hardware solutions by leveraging unique physical phenomena, have shown promising results in solving large-scale combinatorial problems. However, spatial light modulator enabled Ising machines still remain bulky, are very power demanding, and have poor stability. In this study, we propose an integrated XY Ising sampler based on a highly uniform multimode interferometer and a phase shifter array, enabling the minimization of both discrete and continuous spin Hamiltonians. We elucidate the performance of this computing platform in achieving fully programmable spin couplings and external magnetic fields. Additionally, we successfully demonstrate the weighted full-rank Ising model with a linear dependence of 0.82 and weighted MaxCut problem solving with the proposed sampler. Our results illustrate that the developed structure has significant potential for larger-scale, reduced power consumption and increased operational speed, positioning it as a versatile platform for commercially viable high-performance samplers of combinatorial optimization problems.

DOI
10.1364/prj.542991

Related papers

InteGrated Spatial Photonic Ising Sampler Based on High-Uniformity 1 × 8 Multi-Mode Interferometer

Xin Ye, Wenjia Zhang, Zuyuan He

We propose an integrated spatial photonic Ising sampler using a high-uniformity multi-mode interferometer. It minimizes discrete and continuous spin Hamiltonians, achieves programmable spin couplings and external magnetic fields, with a linear dependence of 0.82.

Asia Communications and Photonics Conference•Nov 2, 2024•0 citations

Ising accelerator with a reconfigurable interferometric photonic processor

Rausell-Campo, José Roberto, Kayed, Nayem Al, Pérez-Lppez, Daniel +3 more

The general-purpose programmable photonic processors offer a scalable and reconfigurable solution for a wide range of RF and optical applications. Therefore, implementing photonic Ising machines using programmable processors leverages the advantages of high speed and parallelism, enabling efficient hardware acceleration for finding ground-state solutions to combinatorial optimization problems. In this work, we demonstrate a novel programmable photonic Ising solver based on a hexagonal mesh general-purpose programmable photonic platform. The integrated system allows reconfigurable matrix multiplication and computes the Hamiltonian iteratively using an annealing algorithm that facilitates spin updates and effectively searches for the ground state. As a proof of concept, we experimentally solve two benchmark optimization problems, a fundamental three-node ferromagnetic coupling problem with external bias that demonstrates nontrivial spin interactions, and a four-node Max-Cut problem with arbitrary coupling matrices. Furthermore, to establish a large-scale capability, we emulated Ising problems with sizes up to N = 50, achieving success probabilities exceeding 80\%. Additionally, we examined the impact of errors, such as phase and coupling, on the performance of the programmable photonic Ising machine. Our general-purpose photonic Ising machine paves the way for implementing large-scale, programmable architectures for solving optimization problems.

arXiv:2511.13284•Nov 17, 2025•1 citation

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

Incorporating rank-free coupling and external field via an incoherent modulated spatial photonic Ising machine

Ze Zheng, Yuegang Li, Hang Xu +3 more

Spatial photonic Ising machines offer a novel optical platform for optimization and spin-model simulation, but existing diffraction-based schemes rely on auxiliary spins or multiplexing to encode high-rank couplings and external fields, reducing either speed or spin count. We demonstrate an amplitude-only, rank-free spatial photonic Ising machine in which arbitrary Ising Hamiltonians are encoded as Hadamard products on aligned amplitude and binary spatial modulators and read out by a single-pixel intensity measurement. The machine directly programs fully connected 797-spin Ising models with external fields at nearly 9-bit precision and operates at a constant iteration rate of ~200 Hz. By removing zero-valued product terms, the same architecture scales to sparse problems and experimentally solves a Max-Cut instance on a 424,108-vertex Mobius ladder graph. We also observe the phase transition of the Sherrington-Kirkpatrick model, demonstrating programmable optical simulation beyond low-rank couplings. These results establish amplitude modulation as a scalable route to programmable photonic Ising machines.

arXiv:2512.21587•Dec 25, 2025•2 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

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
Spatial photonic Ising machines, as emerging artificial intelligence hardware solutions by leveraging unique physical phenomena, have shown promising results in solving large-scale combinatorial problems. However, spatial light modulator enabled Ising machines still remain bulky, are very power demanding, and have poor stability. In this study, we propose an integrated XY Ising sampler based on a highly uniform multimode interferometer and a phase shifter array, enabling the minimization of both discrete and continuous spin Hamiltonians. We elucidate the performance of this computing platform in achieving fully programmable spin couplings and external magnetic fields. Additionally, we successfully demonstrate the weighted full-rank Ising model with a linear dependence of 0.82 and weighted MaxCut problem solving with the proposed sampler. Our results illustrate that the developed structure has significant potential for larger-scale, reduced power consumption and increased operational speed, positioning it as a versatile platform for commercially viable high-performance samplers of combinatorial optimization problems.
The general-purpose programmable photonic processors offer a scalable and reconfigurable solution for a wide range of RF and optical applications. Therefore, implementing photonic Ising machines using programmable processors leverages the advantages of high speed and parallelism, enabling efficient hardware acceleration for finding ground-state solutions to combinatorial optimization problems. In this work, we demonstrate a novel programmable photonic Ising solver based on a hexagonal mesh general-purpose programmable photonic platform. The integrated system allows reconfigurable matrix multiplication and computes the Hamiltonian iteratively using an annealing algorithm that facilitates spin updates and effectively searches for the ground state. As a proof of concept, we experimentally solve two benchmark optimization problems, a fundamental three-node ferromagnetic coupling problem with external bias that demonstrates nontrivial spin interactions, and a four-node Max-Cut problem with arbitrary coupling matrices. Furthermore, to establish a large-scale capability, we emulated Ising problems with sizes up to N = 50, achieving success probabilities exceeding 80\%. Additionally, we examined the impact of errors, such as phase and coupling, on the performance of the programmable photonic Ising machine. Our general-purpose photonic Ising machine paves the way for implementing large-scale, programmable architectures for solving optimization problems.
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.
Spatial photonic Ising machines offer a novel optical platform for optimization and spin-model simulation, but existing diffraction-based schemes rely on auxiliary spins or multiplexing to encode high-rank couplings and external fields, reducing either speed or spin count. We demonstrate an amplitude-only, rank-free spatial photonic Ising machine in which arbitrary Ising Hamiltonians are encoded as Hadamard products on aligned amplitude and binary spatial modulators and read out by a single-pixel intensity measurement. The machine directly programs fully connected 797-spin Ising models with external fields at nearly 9-bit precision and operates at a constant iteration rate of ~200 Hz. By removing zero-valued product terms, the same architecture scales to sparse problems and experimentally solves a Max-Cut instance on a 424,108-vertex Mobius ladder graph. We also observe the phase transition of the Sherrington-Kirkpatrick model, demonstrating programmable optical simulation beyond low-rank couplings. These results establish amplitude modulation as a scalable route to programmable photonic Ising machines.
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.
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.