VeloxQ: A Fast and Efficient QUBO Solver
J. Paw{\l}owski, J. Tuziemski, P. Tarasiuk, H. Louzada, R. Adamski, K. Hendzel, {\L}. Pawela, B. Gardas

TL;DR
VeloxQ is a new classical solver for QUBO problems that offers competitive performance and scalability, rivaling quantum and traditional methods on large-scale instances.
Contribution
VeloxQ provides a fast, scalable, and practical classical solution for large QUBO/HUBO problems, outperforming several state-of-the-art solvers in various regimes.
Findings
VeloxQ achieves competitive solution quality and runtime.
It can handle problems with up to 10^8 variables.
VeloxQ outperforms some quantum and classical solvers on large instances.
Abstract
We introduce VeloxQ, a fast solver for Quadratic Unconstrained Binary Optimization (QUBO) problems, which are central to many real-world optimization tasks. Unlike approaches that depend on emerging quantum hardware, VeloxQ can be deployed on conventional computing infrastructure. We benchmark VeloxQ against state-of-the-art QUBO solvers from several families. These include quantum annealers, specifically D-Wave's Advantage and Advantage2 platforms; the digital-quantum BF-DCQO algorithm for Higher-Order Unconstrained Binary Optimization (HUBO) developed by Kipu Quantum; physics-inspired algorithms including Simulated Bifurcation, Parallel Annealing, and tropical tensor networks; and conventional methods including CPLEX, brute force, BEIT's Chimera solver, and Branch-and-Bound variants. The benchmark suite covers native quantum-annealer topologies, embedded all-to-all instances,…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
