Faster QUBO Brute-Force Solving using Gray Code

This article describes an improved brute-force solving strategy for Quadratic Unconstrained Binary Optimization (QUBO) problems that is faster than naive approaches and easily parallelizable. It exploits the Gray code ordering of natural numbers to allow for a more efficient evaluation of the QUBO o...

Full description

Saved in:
Bibliographic Details
Main Author Mücke, Sascha
Format Journal Article
LanguageEnglish
Published 30.10.2023
Subjects
Computer Science - Data Structures and Algorithms
Online AccessGet full text
DOI10.48550/arxiv.2310.19373

Cover

More Information
Summary:This article describes an improved brute-force solving strategy for Quadratic Unconstrained Binary Optimization (QUBO) problems that is faster than naive approaches and easily parallelizable. It exploits the Gray code ordering of natural numbers to allow for a more efficient evaluation of the QUBO objective function. The implementation in Python is discussed in detail, and an additional C implementation is provided.
DOI:10.48550/arxiv.2310.19373