Impact of Network Complexity on the Computational Performance of Ising Machines

Recent demonstrations of massively parallel probabilistic computing have shown a practical route to tackling computationally hard problems in various combinatorial optimizations, with impressive performance that can be further accelerated using emerging devices. A technique known as network sparsifi...

Full description

Saved in:
Bibliographic Details
Main Author: Seokmin Hong
Format: Article
Language:English
Published: IEEE 2025-01-01
Series:IEEE Access
Subjects:
Online Access:https://ieeexplore.ieee.org/document/11071707/
Tags: Add Tag
No Tags, Be the first to tag this record!