Quadratic unconstrained binary optimization

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

Quadratic unconstrained binary optimization (QUBO), also known as unconstrained binary quadratic programming (UBQP), is a combinatorial optimization problem with a wide range of applications from finance and economics to machine learning.[1] QUBO is an NP hard problem, and for many classical problems from theoretical computer science, like maximum cut, graph coloring and the partition problem, embeddings into QUBO have been formulated.[2][3] Embeddings for machine learning models include support-vector machines, clustering and probabilistic graphical models.[4] Moreover, due to its close connection to Ising models, QUBO constitutes a central problem class for adiabatic quantum computation, where it is solved through a physical process called quantum annealing.[5]


Let be a quadratic polynomial over binary variables,

with for and coefficients for . Here denotes the set of strictly positive integers less or equal to , and . The QUBO problem consists of finding a binary vector that is minimal with respect to among all other binary vectors, namely

Sometimes, QUBO is defined as a maximization instead of a minimization problem, which has no effect on the problem's complexity class, as maximizing is the same as minimizing (see below). Another, more compact way to formulate is using matrix notation,

where is the symmetric matrix containing the coefficients .


  • Multiplying the coefficients with a positive factor scales the output of accordingly, leaving the optimum unchanged:
  • Flipping the sign of all coefficients flips the sign of 's output, making the binary vector that maximizes :
  • If all coefficients are positive, the optimum is trivially . Similarly, if all coefficients are negative, the optimum is .
  • If , then the corresponding QUBO problem is solvable in , the optimal variable assignments simply being 1 if and 0 otherwise.

Connection to Ising models[edit]

QUBO is very closely related and computationally equivalent to the Ising model, whose Hamiltonian function is defined as

with real-valued parameters for all . The spin variables are binary with values from instead of . Moreover, in the Ising model the variables are typically arranged in a lattice where only neighboring pairs of variables can have non-zero coefficients. Applying the identity yields an equivalent QUBO problem:[2]


As the constant does not change the position of the optimum , it can be neglected during optimization and is only important for recovering the original Hamiltonian function value.


  1. ^ Kochenberger, Gary; Hao, Jin-Kao (2014). "The unconstrained binary quadratic programming problem: a survey" (PDF). Journal of Combinatorial Optimization. 28: 58–81. doi:10.1007/s10878-014-9734-0. S2CID 16808394.
  2. ^ a b Glover, Fred; Kochenberger, Gary (2019). "A Tutorial on Formulating and Using QUBO Models". arXiv:1811.11538 [cs.DS].
  3. ^ Lucas, Andrew (2014). "Ising formulations of many NP problems". Frontiers in Physics. 2: 5. arXiv:1302.5843. Bibcode:2014FrP.....2....5L. doi:10.3389/fphy.2014.00005.
  4. ^ Mücke, Sascha; Piatkowski, Nico; Morik, Katharina (2019). "Learning Bit by Bit: Extracting the Essence of Machine Learning" (PDF). LWDA. S2CID 202760166. Archived from the original (PDF) on 2020-02-27.
  5. ^ 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]