Jump to content

Talk:Quadratic unconstrained binary optimization

Page contents not supported in other languages.
From Wikipedia, the free encyclopedia
The printable version is no longer supported and may have rendering errors. Please update your browser bookmarks and please use the default browser print function instead.

To do

Some things that come to mind that are missing in this article are

  • Approaches/Algorithms for solving QUBO (Branch&Bound, Heuristic Local Search, Adiabatic Quantum Computing, ...)
  • Complexity (NP hardness/completeness)
  • Some more application examples

--Smuecke1 (talk) 17:32, 16 December 2022 (UTC)[reply]

[untitled]

The claim about quantum computing is problematic. The paper by McGeoch was a comparison between optimized hardware and unoptimized software, and further examination has demonstrated no advantage for existing quantum hardware (http://www.archduke.org/stuff/d-wave-comment-on-comparison-with-classical-computers/). If there is a theoretical reason why QUBO would be well-suited to quantum solving, then the article should reference that. 71.186.212.34 (talk) 16:31, 2 July 2013 (UTC)[reply]

Leaving doubts aside, the page does not explain the problem being solved. The formula without annotations is useless. PetrGlad (talk) 09:16, 12 January 2017 (UTC)[reply]

Domain

From what domain are and ? HenningThielemann (talk) 21:51, 31 March 2016 (UTC)[reply]

I added that X are binary and Q real-valued and corrected the objective which missed the linear term Alexander Mitsos (talk) 21:51, 31 March 2016 (UTC)[reply]

Connection to Ising models - sign problem

In the first line of the derivation of the connection to Ising models, the sign in front of $\mu$ suddenly changes and no commented is made. Also, $x_i=x_i x_i$ is not in fact used on line two. Should be fixed. Maruti.punekar.patil (talk) 13:44, 28 July 2023 (UTC)[reply]