Skip to content
aiqbench takeQuantum Computing

aiqbench analysis

This release introduces a distributed GPU brute-force plugin for Omnisolver, enabling exact exhaustive searches of QUBO and Ising problems up to $N=60$ on clusters of NVIDIA H100s. The update provides a critical ground-truth oracle for validating classical heuristics like the Simulated Bifurcation Machine while offering automatic numerical stabilization for larger problem sizes.
Source coveringarXiv
What this isA model's reading of the article and related coverage, written for aiqbench. Not the publisher's words.

Omnisolver: An extensible interface to Ising spin-glass and QUBO solvers: adding a distributed GPU brute-force plugin

arXiv2 min read

arXiv:2610.10542v1 Announce Type: cross Abstract: This software update extends Omnisolver with \texttt{omnisolver-bruteforce}, a first-class plugin for exact exhaustive search of QUBO and Ising instances on CUDA-enabled GPUs. The update contributes three components: packaging of the single-GPU brute-force kernel of [Computer Physics Communications 260, 107728, 2021] as a first-class Omnisolver plugin with a uniform Python and CLI interface, a Ray-based distributed framework that splits the search into $2^{k}$ fixed-variable subproblems and dispatches them across multiple GPUs and hosts, with a controller that gathers and merges partial results, and numerical stabilization of the fast \texttt{float32} ground-state path through compensated incremental updates, periodic exact energy re-anchoring, and best-buffer refresh. Stabilization activates automatically for $N \geq 40$ leaving the public sampler API is unchanged. On dense random Ising instances we measure exhaustive solve times up to $N=60$ on $8\times$ NVIDIA H100 (96 GB) GPUs, reaching $\approx\!3.15$ days at $N=60$ in close agreement with the empirical $t_{N+1}=2\,t_N$ doubling rule, with the distributed sampler reaching the full $\approx\!8\times$ speedup over a single H100 from $N\!\gtrsim\!44$ onwards. The plugin thereby serves as a practical ground-truth oracle for state-of-the-art classical heuristics such as the Simulated Bifurcation Machine.

Abstract:This software update extends Omnisolver with \texttt{omnisolver-bruteforce}, a first-class plugin for exact exhaustive search of QUBO and Ising instances on CUDA-enabled GPUs. The update contributes three components: packaging of the single-GPU brute-force kernel of [Computer Physics Communications 260, 107728, 2021] as a first-class Omnisolver plugin with a uniform Python and CLI interface, a Ray-based distributed framework that splits the search into $2^{k}$ fixed-variable subproblems and dispatches them across multiple GPUs and hosts, with a controller that gathers and merges partial results, and numerical stabilization of the fast \texttt{float32} ground-state path through compensated incremental updates, periodic exact energy re-anchoring, and best-buffer refresh. Stabilization activates automatically for $N \geq 40$ leaving the public sampler API is unchanged. On dense random Ising instances we measure exhaustive solve times up to $N=60$ on $8\times$ NVIDIA H100 (96 GB) GPUs, reaching $\approx\!3.15$ days at $N=60$ in close agreement with the empirical $t_{N+1}=2\,t_N$ doubling rule, with the distributed sampler reaching the full $\approx\!8\times$ speedup over a single H100 from $N\!\gtrsim\!44$ onwards. The plugin thereby serves as a practical ground-truth oracle for state-of-the-art classical heuristics such as the Simulated Bifurcation Machine.

Computational Physics (physics.comp-ph); Disordered Systems and Neural Networks (cond-mat.dis-nn); Distributed, Parallel, and Cluster Computing (cs.DC); Quantum Physics (quant-ph)

arXiv:2610.10542 [physics.comp-ph]

(or arXiv:2610.10542v1 [physics.comp-ph] for this version)

Full text under the publisher's open licence · 210 words

Related coverage