Algorithmic QUBO Formulations for k-SAT and Hamiltonian Cycles

Abstract

Quadratic unconstrained binary optimization (QUBO) can be seen as a generic language for optimization problems. QUBOs attract particular attention since they can be solved with quantum hardware, like quantum annealers or quantum gate computers running QAOA. In this paper, we present two novel QUBO formulations for $k$-SAT and Hamiltonian Cycles that scale significantly better than existing approaches. For $k$-SAT we reduce the growth of the QUBO matrix from $O(k)$ to $O(log(k))$. For Hamiltonian Cycles the matrix no longer grows quadratically in the number of nodes, as currently, but linearly in the number of edges and logarithmically in the number of nodes. We present these two formulations not as mathematical expressions, as most QUBO formulations are, but as meta-algorithms that facilitate the design of more complex QUBO formulations and allow easy reuse in larger and more complex QUBO formulations.

arXiv commentAccepted at GECCO 2022

References in corpus (7)

• Ising formulations of many NP problems
• Adiabatic Quantum Computing
• Physics-Inspired Optimization for Quadratic Unconstrained Problems Using a Digital Annealer
• Measuring the Capabilities of Quantum Computers
• A Direct Mapping of Max k-SAT and High Order Parity Checks to a Chimera Graph
• Different Adiabatic Quantum Optimization Algorithms for the NP-Complete Exact Cover and 3SAT Problems
• Many-Qudit representation for the Travelling Salesman Problem Optimisation

Cited by in corpus (2)

• An introduction to variational quantum algorithms for combinatorial optimization problems
• Amplitude amplification-inspired QAOA: Improving the success probability for solving 3SAT