A Scalable CMOS Ising Computer Featuring Sparse and Reconfigurable Spin Interconnects for Solving Combinatorial Optimization Problems

No existing algorithms can find exact solutions to the combinatorial optimization problems (COPs) classified as non-deterministic polynomial-time (NP) hard problems. Alternatively, Ising computer based on the Ising model and annealing process has recently drawn significant attention. The Ising compu...

Full description

Saved in:

Bibliographic Details
Published in:	IEEE journal of solid-state circuits Vol. 57; no. 3; pp. 858 - 868
Main Authors:	Su, Yuqi, Mu, Junjie, Kim, Hyunjoon, Kim, Bongjin
Format:	Journal Article
Language:	English
Published:	New York IEEE 01.03.2022 The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subjects:	Algorithms Annealing Annealing processor CMOS Combinatorial analysis combinatorial optimization problems (COPs) Computational modeling Couplers Exact solutions Hardware Integrated circuit interconnections Interconnections Ising computer Ising model Lattices Mapping minor embedding Optimization Polynomials Qubit Reconfigurable hardware sparse and reconfigurable interconnects Spin dynamics
ISSN:	0018-9200, 1558-173X
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!