Jump to content

Talk:Quadratic unconstrained binary optimization

Page contents not supported in other languages.
From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by Alexander.mitsos (talk | contribs) at 11:22, 6 March 2017 (answered a question in the talk and added an apparent typo). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.

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]

To answer the question above: surely are real and are binary. What bothers me is that the article misses the which is shown in both the link of Wang and Kleinberg and the q-wave documentation Alexander Mitsos (talk) 21:51, 31 March 2016 (UTC)[reply]