sparse Ising machine

Hard optimization problems can be expressed as interacting networks of probabilistic bits. Efficient solution of these problems require making them less dense at the expense of more p-bits.
Just what is the potential of probabilistic computers?