20736-node weighted max-cut problem solving by quadrature photonic spatial Ising machine  

作　　者：Xin YE Wenjia ZHANG Shaomeng WANG Xiaoxuan YANG Zuyuan HE 

机构地区：[1]State Key Laboratory of Advanced Optical Communication Systems and Networks,Shanghai Jiao Tong University,Shanghai 200240,China [2]Peng Cheng Laboratory,Shenzhen 518055,China

出　　处：《Science China(Information Sciences)》2023年第12期285-286,共2页中国科学（信息科学）（英文版）

基　　金：supported by National Key Research and Development Program of China (Grant No.2019YFB1802903);National Natural Science Foundation of China (Grant Nos.62175146,62235011);Major Key Project of PCL (Grant No.PCL2021A14)。

摘　　要：The max-cut problem is one of the fundamental NP-hard problems in combinatorial optimization,which can describe the practical applications such as data clustering,machine scheduling,and image recognition.This problem can be formulated into an equivalent Ising model without local fields.

关 键 词：problem optimization image 

分 类 号：TP18[自动化与计算机技术—控制理论与控制工程]