Quadratic unconstrained binary optimization

From Wikipedia, the free encyclopedia
Jump to navigation Jump to search

Quadratic unconstrained binary optimization (QUBO) is a pattern matching technique, common in machine learning applications. QUBO is an NP hard problem. Examples of problems that can be formulated as QUBO problems are the Maximum cut, Graph coloring and the Partition problem.[1]

QUBO problems may sometimes be well-suited to algorithms aided by quantum annealing.[2]

QUBO is the problem of minimizing a quadratic polynomial over binary variables. The quadratic polynomial will be of the form with and .


  1. ^ Glover, Fred; Kochenberger, Gary (2019). "A Tutorial on Formulating and Using QUBO Models". arXiv:1811.11538 [cs.DS].
  2. ^ Tom Simonite (8 May 2013). "D-Wave's Quantum Computer Goes to the Races, Wins". MIT Technology Review. Retrieved 12 May 2013.

External links[edit]