Quadratic unconstrained binary optimization

From Infogalactic: the planetary knowledge core
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

<templatestyles src="Reflist/styles.css" />

Cite error: Invalid <references> tag; parameter "group" is allowed only.

Use <references />, or <references group="..." />

External links

  • Lua error in package.lua at line 80: module 'strict' not found.
  • Lua error in package.lua at line 80: module 'strict' not found.


<templatestyles src="Asbox/styles.css"></templatestyles>

Stub icon

This artificial intelligence-related article is a stub. You can help Wikipedia by expanding it.
  1. ↑ Lua error in package.lua at line 80: module 'strict' not found.
Retrieved from "https://infogalactic.com/w/index.php?title=Quadratic_unconstrained_binary_optimization&oldid=626506792"