Affiliation:
1. Department of Electrical and Electronic Engineering The University of Hong Kong Pokfulam Road Hong Kong 999077 China
2. ACCESS ‐ AI Chip Center for Emerging Smart Systems InnoHK Centers Hong Kong Science Park Hong Kong 999077 China
3. School of Microelectronics Southern University of Science and Technology Shenzhen 518055 China
4. Department of Electronic and Computer Engineering Hong Kong University of Science and Technology Hong Kong 999077 China
5. Institute of Technological Sciences Wuhan University Wuhan 430072 China
6. Institute of Microelectronics Chinese Academy of Sciences Beijing 100029 China
Abstract
AbstractCombinatorial 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.
Funder
National Key Research and Development Program of China
National Natural Science Foundation of China
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献