Jump to content

Quadratic unconstrained binary optimization

Edit links
From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by Raul654 (talk | contribs) at 03:44, 23 November 2008 (new article). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.
(diff) ← Previous revision | Latest revision (diff) | Newer revision → (diff)

Quadratic unconstrained binary optimization (QUBO) is a pattern matching technique, common in machine learning applications.

QUBO problems are particularly well suited for processing on quantum computers.

This article is a stub. You can help Wikipedia by expanding it.

Retrieved from "https://en.wikipedia.org/w/index.php?title=Quadratic_unconstrained_binary_optimization&oldid=253525855"