Quadratic unconstrained binary optimization

From Wikipedia, the free encyclopedia
Jump to: navigation, 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 given by the formula: E(X_1, X_2, ... , X_N) = \sum_{i<j=1}^N Q_{ij} \times X_i \times X_j

References[edit]

  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]