自旋电子学
伊辛模型
实施
计算机科学
统计物理学
物理
凝聚态物理
铁磁性
程序设计语言
作者
Andrea Grimaldi,Luciano Mazza,Eleonora Raimondo,Pietro Tullo,Davi R. Rodrigues,Kerem Y. Çamsarı,Vincenza Crupi,Mario Carpentieri,Vito Puliafito,Giovanni Finocchio
出处
期刊:Physical review applied
[American Physical Society]
日期:2023-08-02
卷期号:20 (2)
被引量:2
标识
DOI:10.1103/physrevapplied.20.024005
摘要
The commercial and industrial demand for the solution of hard combinatorial optimization problems push forward the development of efficient solvers. One of them is the Ising machine which can solve combinatorial problems mapped to Ising Hamiltonians. In particular, spintronic hardware implementations of Ising machines can be very efficient in terms of area and performance, and are relatively low-cost considering the potential to create hybrid CMOS-spintronic technology. Here, we perform a comparison of coherent and probabilistic paradigms of Ising machines on several hard Max-Cut instances, analyzing their scalability and performance at software level. We show that probabilistic Ising machines outperform coherent Ising machines in terms of the number of iterations required to achieve the problem s solution. Nevertheless, high frequency spintronic oscillators with sub-nanosecond synchronization times could be very promising as ultrafast Ising machines. In addition, considering that a coherent Ising machine acts better for Max-Cut problems because of the absence of the linear term in the Ising Hamiltonian, we introduce a procedure to encode Max-3SAT to Max-Cut. We foresee potential synergic interplays between the two paradigms.
科研通智能强力驱动
Strongly Powered by AbleSci AI