Dynamical Process of a Bit-Width Reduced Ising Model With Simulated Annealing
Ising machines have attracted attention as efficient solvers for combinatorial optimization problems, which are formulated as ground-state (lowest-energy) search problems of the Ising model. Due to the limited bit-width of coefficients on Ising machines, the Ising model must be transformed into a bi...
Main Authors: | Shuta Kikuchi, Nozomu Togawa, Shu Tanaka |
---|---|
Format: | Article |
Language: | English |
Published: |
IEEE
2023-01-01
|
Series: | IEEE Access |
Subjects: | |
Online Access: | https://ieeexplore.ieee.org/document/10235958/ |
Similar Items
-
Ising Machine Approach to the Lecturer–Student Assignment Problem
by: Sora Tomita, et al.
Published: (2024-01-01) -
Scalable Fully-Coupled Annealing Processing System Implementing 4096 Spins Using 22nm CMOS LSI
by: Taichi Megumi, et al.
Published: (2024-01-01) -
A Three-Stage Annealing Method Solving Slot-Placement Problems Using an Ising Machine
by: Keisuke Fukada, et al.
Published: (2021-01-01) -
A GPU-Based Ising Machine With a Multi-Spin-Flip Capability for Constrained Combinatorial Optimization
by: Satoru Jimbo, et al.
Published: (2024-01-01) -
Ising-Based Kernel Clustering
by: Masahito Kumagai, et al.
Published: (2023-04-01)