A Reconfigurable lsing Machine for Boolean Satisfiability Problems Featuring Many-Body Spin Interactions

Ising machines [1-6] have recently shown their unique capabilities in solving hard combinatorial optimization problems (COPs) intractable using conventional computers. We map the COPs to the Ising model implemented in a network of hardware spins (i.e., computing units of the Ising machine) and find...

Full description

Bibliographic Details

Published in:	Proceedings of the Custom Integrated Circuits Conference pp. 1 - 2
Main Authors:	Su, Yuqi, Kim, Tony Tae-Hyoung, Kim, Bongjin
Format:	Conference Proceeding
Language:	English
Published:	IEEE 01.04.2023
Subjects:	Costs Hardware Network topology Optical network units Prototypes Scalability Semiconductor device modeling
ISSN:	2152-3630
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!