A coherent Ising machine for 2000-node optimization problems
A coherent Ising machine for 2000-node optimization problems
复制标题
DOI：
10.1126/science.aah4243
复制
发表时间：
2016-11-04
期刊：
影响因子：
56.9
通讯作者：
Takesue, Hiroki
中科院分区：
文献类型：
--
作者：
Inagaki, Takahiro;Haribara, Yoshitaka;Takesue, Hiroki
复杂系统的分析和优化可以归结为数学问题，统称为组合优化。许多这样的问题可以映射到伊辛模型的基态搜索问题，各种人工自旋系统正在成为有前途的方法。然而，物理伊辛机遭受有限数量的自旋-自旋耦合，因为基于局部自旋的实现，导致严重的可扩展性问题。我们报道了一个2000自旋的网络，具有全对全自旋-自旋耦合。使用测量和反馈方案，我们耦合时分复用简并光学参量振荡器，以实现最大切割问题的任意图形拓扑结构与多达2000个节点。我们的相干伊辛机优于模拟退火的准确性和计算时间为2000节点的完整图。
The analysis and optimization of complex systems can be reduced to mathematical problems collectively known as combinatorial optimization. Many such problems can be mapped onto ground-state search problems of the Ising model, and various artificial spin systems are now emerging as promising approaches. However, physical Ising machines have suffered from limited numbers of spin-spin couplings because of implementations based on localized spins, resulting in severe scalability problems. We report a 2000-spin network with all-to-all spin-spin couplings. Using a measurement and feedback scheme, we coupled time-multiplexed degenerate optical parametric oscillators to implement maximum cut problems on arbitrary graph topologies with up to 2000 nodes. Our coherent Ising machine outperformed simulated annealing in terms of accuracy and computation time for a 2000-node complete graph.