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

International Conference on Synthesis, Modeling, Analysis and Simulation Methods and Applications to Circuit Design

Paving the Path to Spatially Multiplexed Coherent Ising Machines

Matthias Thiele, Jens Lienig

Published Jun 1, 2026• 0 citations
Publisher
DOI
10.1109/smacd70206.2026.11647832

Related papers

Network of time-multiplexed optical parametric oscillators as a coherent Ising machine

Alireza Marandi, Zhe Wang, Kenta Takata +2 more

arXiv:1407.2871•Nature Photonics•Oct 24, 2014•543 citations

Benchmarking the Poor Man's Ising Machine

Gautham Umasankar, Parth S Shah, Nitin Chandrachoodan +1 more

We demonstrate the use of a Time-Multiplexed Opto-Electronic Oscillator based Coherent Ising Machine(CIM) to solve Maxcut Problems. Time multiplexing helps reduce system complexity and size, with good scaling against problem size. Benchmarks against state-of-the-art classical solvers show comparable performance, with encouraging results for further improvements.

IEEE/LEOS Summer Topical Meetings•Jul 1, 2021•3 citations

Scalable almost-linear dynamical Ising machines

Aditya Shukla, Mikhail Erementchouk, Pinaki Mazumder

arXiv:2205.14760•Natural Computing•Apr 8, 2024•2 citations

Optimization with photonic wave-based annealers

Anil Prabhakar, Parth S Shah, Gautham Umasankar +4 more

Many NP-hard combinatorial optimization (CO) problems can be cast as a quadratic unconstrained binary optimization model, which maps naturally to an Ising model. The final spin configuration in the Ising model can adiabatically arrive at a solution to a Hamiltonian, given a known set of interactions between spins. We enhance two photonic Ising machines (PIMs) and compare their performance against classical (Gurobi) and quantum (D-Wave) solvers. The temporal multiplexed coherent Ising machine (TMCIM) uses the bistable response of an electro-optic modulator to mimic the spin up and down states. We compare TMCIM performance on Max-cut problems. A spatial photonic Ising machine (SPIM) convolves the wavefront of a coherent laser beam with the pixel distribution of a spatial light modulator to adiabatically achieve a minimum energy configuration, and solve a number partitioning problem (NPP). Our computational results on Max-cut indicate that classical solvers are still a better choice, while our NPP results show that SPIM is better as the problem size increases. In both cases, connectivity in Ising hardware is crucial for performance. Our results also highlight the importance of better understanding which CO problems are most likely to benefit from which type of PIM. This article is part of the theme issue 'Quantum annealing and computation: challenges and perspectives'.

Philosophical Transactions of the Royal Society A Mathematical Physical and Engineering Sciences•Dec 4, 2022•14 citations

Ground state search of Ising model with coherent Ising machine

Takahiro Inagaki, Ryan Hamerly, Toshimori Honjo +6 more

The Japan Society of Applied Physics•Jul 21, 2017•0 citations

High-Speed Resource Allocation for Multi-User NOMA Systems Using a Coherent Ising Machine

Shuho Ishibashi, Maki Arai, Aohan Li +4 more

Non-Orthogonal Multiple Access (NOMA) is a nextgeneration communication technology that enables multiple users share the same wireless channels. To optimize the performance of NOMA, appropriate channel allocation for each user is essential. Previous research has applied a fast optimization approach using the coherent Ising machine (CIM) to channel allocation in NOMA, multiplexing up to two users per channel, which can be formulated as a basic Ising Hamiltonian including up to second-order interactions. However, NOMA can support multiplexing more than two users per channel depending on channel conditions. This paper propose a method for optimizing NOMA systems with more than two multiplexed users per channel, which becomes a Higher Order Binary Optimization problem. We apply a method to reduce the order of the objective function, converting it to Quadratic Unconstrained Binary Optimization, and derive the Ising Hamiltonian for higher-order NOMA. We evaluate our proposed method through simulations using the CIM for optimization. Our results show that the proposed method leads to better solutions than conventional methods.

International Conference on Information Networking•Jan 15, 2025•0 citations
Many NP-hard combinatorial optimization (CO) problems can be cast as a quadratic unconstrained binary optimization model, which maps naturally to an Ising model. The final spin configuration in the Ising model can adiabatically arrive at a solution to a Hamiltonian, given a known set of interactions between spins. We enhance two photonic Ising machines (PIMs) and compare their performance against classical (Gurobi) and quantum (D-Wave) solvers. The temporal multiplexed coherent Ising machine (TMCIM) uses the bistable response of an electro-optic modulator to mimic the spin up and down states. We compare TMCIM performance on Max-cut problems. A spatial photonic Ising machine (SPIM) convolves the wavefront of a coherent laser beam with the pixel distribution of a spatial light modulator to adiabatically achieve a minimum energy configuration, and solve a number partitioning problem (NPP). Our computational results on Max-cut indicate that classical solvers are still a better choice, while our NPP results show that SPIM is better as the problem size increases. In both cases, connectivity in Ising hardware is crucial for performance. Our results also highlight the importance of better understanding which CO problems are most likely to benefit from which type of PIM. This article is part of the theme issue 'Quantum annealing and computation: challenges and perspectives'.
Non-Orthogonal Multiple Access (NOMA) is a nextgeneration communication technology that enables multiple users share the same wireless channels. To optimize the performance of NOMA, appropriate channel allocation for each user is essential. Previous research has applied a fast optimization approach using the coherent Ising machine (CIM) to channel allocation in NOMA, multiplexing up to two users per channel, which can be formulated as a basic Ising Hamiltonian including up to second-order interactions. However, NOMA can support multiplexing more than two users per channel depending on channel conditions. This paper propose a method for optimizing NOMA systems with more than two multiplexed users per channel, which becomes a Higher Order Binary Optimization problem. We apply a method to reduce the order of the objective function, converting it to Quadratic Unconstrained Binary Optimization, and derive the Ising Hamiltonian for higher-order NOMA. We evaluate our proposed method through simulations using the CIM for optimization. Our results show that the proposed method leads to better solutions than conventional methods.