Talk:Quadratic unconstrained binary optimization

Computing Stub‑class

	This article is within the scope of WikiProject Computing, a collaborative effort to improve the coverage of computers, computing, and information technology on Wikipedia. If you would like to participate, please visit the project page, where you can join the discussion and see a list of open tasks.ComputingWikipedia:WikiProject ComputingTemplate:WikiProject ComputingComputing
Stub	This article has been rated as Stub-class on Wikipedia's content assessment scale.
???	This article has not yet received a rating on the project's importance scale.

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

I added that X are binary and Q real-valued and corrected the objective which missed the linear term $sum_{j=1}^{n}a_{i}x_{i}$ Alexander Mitsos (talk) 21:51, 31 March 2016 (UTC)[reply]