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 Pacific Rim (CLEO-PR)

Numerical demonstration of spatial photonic Ising machine by using time-division multiplexing

Suguru Shimomura, Ken-ichi Okubo, Hiroshi Yamashita, Yusuke Ogura, Hideyuki Suzuki, Jun Tanida

Published Jan 1, 2022• 0 citations
Publisher

Abstract

In this study, we present a method for enhancing a function of the spatial photonic Ising machine by using time-division multiplexing. Processing of multiple signals in which spin interaction is encoded provides the representation of the Ising Hamiltonian which functions as an indicator to solve combinational optimization problems. To evaluate the performance of the proposed system, we calculated the Ising Hamiltonian by simulating light propagation. We confirmed that the optimal solution of a given Knapsack problem is effectively obtained by the proposed system.

DOI
10.1364/cleopr.2022.cthp13d_03

Related papers

Numerical Demonstration of Spatial Photonic Ising Machine by Using Time-Division Multiplexing

Suguru Shimomura, Ken-ichi Okubo, Hiroshi Yamashita +3 more

In this study, we present a method for enhancing a function of the spatial photonic Ising machine by using time-division multiplexing. Processing of multiple signals in which spin interaction is encoded provides the representation of the Ising Hamiltonian which functions as an indicator to solve combinational optimization problems. To evaluate the performance of the proposed system, we calculated the Ising Hamiltonian by simulating light propagation. We confirmed that the optimal solution of a given Knapsack problem is effectively obtained by the proposed system.

Conference on Lasers and Electro-Optics Pacific Rim (CLEO-PR)•Jul 31, 2022•0 citations

Parallel processing of spatial photonic Ising machines using spatial multiplexing

Suguru Shimomura, Yusuke Ogura, Jun Tanida

In this study, we proposed a spatial photonic Ising machine with parallel processing. Through spatial multiplexing, the spin variables indicating multiple types of solutions were expanded in space. Individual calculations of the Ising Hamiltonian for multiple types of spin variables can be performed using the designed phase patterns. To evaluate the performance of the proposed method, the optimal solution for combinational optimization problems with 100 spin variables was determined for a certain number of iterations. Experimental results show that the frequency of the obtained optimised solution increases with the number of multiplexing steps.

SPIE Machine Learning in Photonics•Apr 8, 2024•1 citation

Function Enhancement of Spatial Photonic Ising Machine by Parallel Processing Using Space-Division Multiplexing

Suguru Shimomura, Ken-ichi Okubo, Hiroshi Yamashita +3 more

Solving combinational optimization problems, which are known to be non-deterministic polynomial hard, is useful in a wide range of fields, including transportation and finance. A spatial photonic Ising machine (SPIM) enables problems with a large number of combinations to be solved by encoding the spin variables into phase [1]. However, it is difficult to handle various types of problems because the degree of freedom of the interaction between spin variables is equal to the number of spin variables. In this study, we propose a method for expanding the flexibility of the interaction between spin variables by parallel processing using space-division multiplexing. Space-division multiplexing can be used to process components of the Ising Hamiltonian simultaneously, and a wide range of Ising Hamiltonians can be represented by synthesizing the individual results.

Conference on Lasers and Electro-Optics Europe & European Quantum Electronics Conference (CLEO/Europe-EQEC)•Jun 26, 2023•1 citation

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•4 citations

Multi-channel spatial photonic Ising machine for 102400-spin 0-1 knapsack problem solving

Junze Yao, Junjie Yu

Combinatorial optimization problems are challenging for classical computing architectures, motivating the development of specialized hardware like Ising machines. The Spatial Photonic Ising Machine (SPIM) and its enhanced versions have shown promise in solving such problems by mapping them to the Ising model and leveraging optical parallelism to compute Hamiltonian energies efficiently. However, the 0-1 knapsack problem, as a representative combinatorial optimization problem, has only been reported to be solved effectively in small-scale SPIM. In this work, we analyze the factors that limit the spin scalability and propose a novel hardware-aware Hamiltonian mapping scheme to overcome this limitation. Based on this enhanced SPIM, the scheme is validated through simulated annealing experiments on a 102400-spin 0-1 knapsack problem, achieving high solution accuracy. Our method not only enables efficient solutions to large-scale 0-1 knapsack problems but also offers generalizability to other combinatorial optimization problems with similar coupling configurations. This work demonstrates the potential of SPIMs as scalable and adaptable solvers for real-world optimization challenges.

Optics Letters•Jun 1, 2026•0 citations

Encoding arbitrary Ising Hamiltonians on Spatial Photonic Ising Machines

Jason Sakellariou, Alexis Askitopoulos, Georgios Pastras +1 more

Photonic Ising Machines constitute an emergent new paradigm of computation, geared towards tackling combinatorial optimization problems that can be reduced to the problem of finding the ground state of an Ising model. Spatial Photonic Ising Machines have proven to be advantageous for simulating fully connected large-scale spin systems. However, fine control of a general interaction matrix $J$ has so far only been accomplished through eigenvalue decomposition methods that either limit the scalability or increase the execution time of the optimization process. We introduce and experimentally validate a SPIM instance that enables direct control over the full interaction matrix, enabling the encoding of Ising Hamiltonians with arbitrary couplings and connectivity. We demonstrate the conformity of the experimentally measured Ising energy with the theoretically expected values and then proceed to solve both the unweighted and weighted graph partitioning problems, showcasing a systematic convergence to an optimal solution via simulated annealing. Our approach greatly expands the applicability of SPIMs for real-world applications without sacrificing any of the inherent advantages of the system, and paves the way to encoding the full range of NP problems that are known to be equivalent to Ising models, on SPIM devices.

arXiv:2407.09161•Jul 12, 2024•1 citation
In this study, we present a method for enhancing a function of the spatial photonic Ising machine by using time-division multiplexing. Processing of multiple signals in which spin interaction is encoded provides the representation of the Ising Hamiltonian which functions as an indicator to solve combinational optimization problems. To evaluate the performance of the proposed system, we calculated the Ising Hamiltonian by simulating light propagation. We confirmed that the optimal solution of a given Knapsack problem is effectively obtained by the proposed system.
In this study, we present a method for enhancing a function of the spatial photonic Ising machine by using time-division multiplexing. Processing of multiple signals in which spin interaction is encoded provides the representation of the Ising Hamiltonian which functions as an indicator to solve combinational optimization problems. To evaluate the performance of the proposed system, we calculated the Ising Hamiltonian by simulating light propagation. We confirmed that the optimal solution of a given Knapsack problem is effectively obtained by the proposed system.
In this study, we proposed a spatial photonic Ising machine with parallel processing. Through spatial multiplexing, the spin variables indicating multiple types of solutions were expanded in space. Individual calculations of the Ising Hamiltonian for multiple types of spin variables can be performed using the designed phase patterns. To evaluate the performance of the proposed method, the optimal solution for combinational optimization problems with 100 spin variables was determined for a certain number of iterations. Experimental results show that the frequency of the obtained optimised solution increases with the number of multiplexing steps.
Solving combinational optimization problems, which are known to be non-deterministic polynomial hard, is useful in a wide range of fields, including transportation and finance. A spatial photonic Ising machine (SPIM) enables problems with a large number of combinations to be solved by encoding the spin variables into phase [1]. However, it is difficult to handle various types of problems because the degree of freedom of the interaction between spin variables is equal to the number of spin variables. In this study, we propose a method for expanding the flexibility of the interaction between spin variables by parallel processing using space-division multiplexing. Space-division multiplexing can be used to process components of the Ising Hamiltonian simultaneously, and a wide range of Ising Hamiltonians can be represented by synthesizing the individual results.
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.
Combinatorial optimization problems are challenging for classical computing architectures, motivating the development of specialized hardware like Ising machines. The Spatial Photonic Ising Machine (SPIM) and its enhanced versions have shown promise in solving such problems by mapping them to the Ising model and leveraging optical parallelism to compute Hamiltonian energies efficiently. However, the 0-1 knapsack problem, as a representative combinatorial optimization problem, has only been reported to be solved effectively in small-scale SPIM. In this work, we analyze the factors that limit the spin scalability and propose a novel hardware-aware Hamiltonian mapping scheme to overcome this limitation. Based on this enhanced SPIM, the scheme is validated through simulated annealing experiments on a 102400-spin 0-1 knapsack problem, achieving high solution accuracy. Our method not only enables efficient solutions to large-scale 0-1 knapsack problems but also offers generalizability to other combinatorial optimization problems with similar coupling configurations. This work demonstrates the potential of SPIMs as scalable and adaptable solvers for real-world optimization challenges.
Photonic Ising Machines constitute an emergent new paradigm of computation, geared towards tackling combinatorial optimization problems that can be reduced to the problem of finding the ground state of an Ising model. Spatial Photonic Ising Machines have proven to be advantageous for simulating fully connected large-scale spin systems. However, fine control of a general interaction matrix JJJ has so far only been accomplished through eigenvalue decomposition methods that either limit the scalability or increase the execution time of the optimization process. We introduce and experimentally validate a SPIM instance that enables direct control over the full interaction matrix, enabling the encoding of Ising Hamiltonians with arbitrary couplings and connectivity. We demonstrate the conformity of the experimentally measured Ising energy with the theoretically expected values and then proceed to solve both the unweighted and weighted graph partitioning problems, showcasing a systematic convergence to an optimal solution via simulated annealing. Our approach greatly expands the applicability of SPIMs for real-world applications without sacrificing any of the inherent advantages of the system, and paves the way to encoding the full range of NP problems that are known to be equivalent to Ising models, on SPIM devices.