260 citations · 468 across the 20 of their papers we have counts for
4 papers · 1 filter
A Unified Performance-Cost Landscape of Parallel p-bit Ising Machines Based on Update Dynamics
Naoya Onizawa, Takahiro Hanyu
Parallel p-bit Ising machines are a promising platform for fast and energy-efficient combinatorial optimization, but their scalability depends on update synchronization, hardware d…
High Convergence Rates of CMOS Invertible Logic Circuits Based on Many-Body Hamiltonians
Naoya Onizawa, Takahiro Hanyu
This paper introduces CMOS invertible-logic (CIL) circuits based on many-body Hamiltonians. CIL can realize probabilistic forward and backward operations of a function by annealing…
Enhanced Convergence in p-bit Based Simulated Annealing with Partial Deactivation for Large-Scale Combinatorial Optimization Problems
Naoya Onizawa, Takahiro Hanyu
This article critically investigates the limitations of the simulated annealing algorithm using probabilistic bits (pSA) in solving large-scale combinatorial optimization problems.…
Analog-to-Stochastic Converter Using Magnetic Tunnel Junction Devices for Vision Chips
Naoya Onizawa, Daisaku Katagiri, Warren J. Gross +1
This paper introduces an analog-to-stochastic converter using a magnetic tunnel junction (MTJ) device for vision chips based on stochastic computation. Stochastic computation has b…