An inertia term in p-bit dynamics allows fully parallel updates in Ising machines, yielding up to 150x speedups on dense Max-Cut and SK instances while preserving or improving success probability.
As shown in Algorithm 5, each update step corresponds to a single spin index i = tmodN , which needs to be updated across all trials before advancing to the next spin
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.ET 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
A fully parallel densely connected probabilistic Ising machine with inertia for real-time applications
An inertia term in p-bit dynamics allows fully parallel updates in Ising machines, yielding up to 150x speedups on dense Max-Cut and SK instances while preserving or improving success probability.