A spatial-photonic Ising machine to solve the two-way number-partitioning problem

Abstract

We evaluate the performance of different algorithms in minimizing the Hamiltonian of a spatial-photonic Ising machine (SPIM). We then encode the number-partitioning problem on the SPIM and adiabatically arrive at good solutions for the problem for over 16000 spins, with a time complexity that only scales linearly with problem size. Finally, we benchmark our machine performance against the classical solver, Gurobi, and also a D-Wave 5000+ quantum annealer. With just one spatial light modulator, and and adiabatic evolution scheme for the phase, our results surpass current state-of-the-art SPIMs. We reduce hardware costs, and can solve larger problems more efficiently.

References in corpus (5)

• Network of Time-Multiplexed Optical Parametric Oscillators as a Coherent Ising Machine
• Phase control algorithms for focusing light through turbid media
• Large-scale photonic Ising machine by spatial light modulation
• Noise-enhanced spatial-photonic Ising machine
• Experiments with arbitrary networks in time-multiplexed delay systems