PERSONAL Sign in with your SPIE account to access your personal subscriptions or to use specific features such as save to my library, sign up for alerts, save searches, etc.
The maximum independent set (MIS) problem is an optimization problem in graph theory and is related to various applications such as network design and resource allocation. Here we report that a coherent Ising machine based on a network of optical parametric oscillators can find large independent sets in graphs that consist of thousands of nodes faster than simulated annealing implemented many-core CPU.
PERSONAL Sign in with your SPIE account to access your personal subscriptions or to use specific features such as save to my library, sign up for alerts, save searches, etc.
The alert did not successfully save. Please try again later.
Hiroki Takesue, Kensuke Inaba, Toshimori Honjo, Takuya Ikuta, Yuya Yonezu, Yasuhiro Yamada, Takahiro Inagaki, "Solving maximum independent set problems with a coherent Ising machine," Proc. SPIE PC13113, Photonic Computing: From Materials and Devices to Systems and Applications, PC131130H (3 October 2024); https://doi.org/10.1117/12.3026866