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.

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

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


  1. ^ 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]