Optimization with photonic wave-based annealers. (23rd January 2023)

• Record Type: Journal Article
• Authors: Prabhakar, A.; Shah, P.; Gautham, U.; Natarajan, V.; Ramesh, V.; Chandrachoodan, N.; Tayur, S.
• Is Part Of: Philosophical transactions. Volume 381:Number 2241(2023)
• Publication Date: 2023-01-23
• Subjects: photonics -- Ising -- quadratic unconstrained binary optimization -- Max-cut -- number partitioning; Physical sciences -- Periodicals; Engineering -- Periodicals; Mathematics -- Periodicals; 500
• DOI: 10.1098/rsta.2021.0409
• Languages: English
• ISSNs: 1364-503X

Abstract

Abstract : 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'.