Deng, Yi, Zhang, Yi, Zhang, Xinyuan, Jiang, Yang, Chen, Xi, Yang, Yansong, Tong, Xin, Cai, Yao, Liu, Wenjuan, Sun, Chengliang, Shang, Dashan, Wang, Qing, Yu, Hongyu, and Wang, Zhongrui
Combinatorial optimization (CO) has a broad range of applications in various fields, including operations research, computer science, and artificial intelligence. However, many of these problems are classified as nondeterministic polynomial‐time (NP)‐complete or NP‐hard problems, which are known for their computational complexity and cannot be solved in polynomial time on traditional digital computers. To address this challenge, continuous‐time Ising machine solvers have been developed, utilizing different physical principles to map CO problems to ground state finding. However, most Ising machine prototypes operate at speeds comparable to digital hardware and rely on binarizing node states, resulting in increased system complexity and further limiting operating speed. To tackle these issues, a novel device‐algorithm co‐design method is proposed for fast sub‐optimal solution finding with low hardware complexity. On the device side, a piezoelectric lithium niobate (LiNbO3) microelectromechanical system (MEMS) oscillator network‐based Ising machine without second‐harmonic injection locking (SHIL) is devised to solve Max‐cut and graph coloring problems. The LiNbO3 oscillator operates at speeds greater than 9 GHz, making it one of the fastest oscillatory Ising machines. System‐wise, an innovative grouping method is used that achieves a performance guarantee of 0.878 for Max‐cut and 0.658 for graph coloring problems, which is comparable to Ising machines that utilize binarization. [ABSTRACT FROM AUTHOR]