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...

Celý popis

Uloženo v:

Podrobná bibliografie
Vydáno v:	IEEE journal of solid-state circuits Ročník 57; číslo 3; s. 858 - 868
Hlavní autoři:	Su, Yuqi, Mu, Junjie, Kim, Hyunjoon, Kim, Bongjin
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	New York IEEE 01.03.2022 The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Témata:	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
On-line přístup:	Získat plný text
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!

Buďte první, kdo okomentuje tento záznam!