Corpus ID: 236428504

Efficient QUBO transformation for Higher Degree Pseudo Boolean Functions

  title={Efficient QUBO transformation for Higher Degree Pseudo Boolean Functions},
  author={Amit Verma and Mark W. Lewis and Gary A. Kochenberger},
Quadratic Unconstrained Binary Optimization (QUBO) is recognized as a unifying framework for modeling a wide range of problems. Problems can be solved with commercial solvers customized for solving QUBO and since QUBO have degree two, it is useful to have a method for transforming higher degree pseudo-Boolean problems to QUBO format. The standard transformation approach requires additional auxiliary variables supported by penalty terms for each higher degree term. This paper improves on the… Expand

Tables from this paper


Optimal quadratic reformulations of fourth degree Pseudo-Boolean functions
A preprocessing approach for fourth degree pseudo-Boolean polynomials based on an exact integer programming model that minimizes the number of auxiliary variables and penalty magnitude is presented. Expand
Path relinking for unconstrained binary quadratic programming
This paper presents two path relinking algorithms to solve the unconstrained binary quadratic programming (UBQP) problem. One is based on a greedy strategy to generate the relinking path from theExpand
Goal Seeking Quadratic Unconstrained Binary Optimization
This paper presents two variants of goal-seeking QUBO that minimize the deviation from the goal through a tabu-search based greedy one-flip heuristic and illustrates the efficacy of the proposed approach over Constraint Programming for quickly finding a satisficing set of solutions. Expand
Quadratization in discrete optimization and quantum mechanics
This book explores quadratizations for pseudo-Boolean optimization, perturbative gadgets used in QMA completeness theorems, and also non-perturbative k-local to 2-local transformations used for quantum mechanics, quantum annealing and universal adiabatic quantum computing. Expand
Efficient Reduction of Polynomial Zero-One Optimization to the Quadratic Case
It is shown that a complete polyhedral description of the linearization of a polynomial with real coefficients over binary variables can be derived in a simple way from the polyhedral descriptions of thelinearization of some quadratic optimization problem. Expand
QUBO transformation using Eigenvalue Decomposition
The eigenvalue decomposition of the underlying Q matrix is utilizes to alter and improve the search process by extracting the information from dominant eigenvalues and eigenvectors to implicitly guide the search towards promising areas of the solution landscape. Expand
A Penalty Function Approach to Max 3-SAT Problems
We consider a penalty function approach for the solving of the Max 3-SAT problem. The algorithm introduced is a multi-start approach that makes use of elite-solution techniques derived from scatterExpand
Assessing Solution Quality of 3SAT on a Quantum Annealing Platform
It is shown that the phase transition regarding the computational complexity of the problem, which is well-known to occur for 3SAT on classical machines (where it causes a detrimental increase in runtime), persists in some form (but possibly to a lesser extent) for quantum annealing. Expand
An Unconstrained Quadratic Binary Programming Approach to the Vertex Coloring Problem
A UQP approach to the vertex coloring problem is presented and its attractiveness is illustrated with preliminary computational experience. Expand
Pseudo-Boolean optimization
This survey examines the state of the art of a variety of problems related to pseudo-Boolean optimization, i.e. to the optimization of set functions represented by closed algebraic expressions. TheExpand