https://hackerpaper.kaipfister.de/p/quant-ph_0001106/Collected HN comments and submissions linking this paper.enMon, 02 Nov 2026 11:16:22 GMThttps://news.ycombinator.com/item?id=1403171urn:hackerpapers:mention:quant-ph_0001106:1403171Fri, 04 Jun 2010 01:04:46 GMT<p>This has almost certainly only been shown for a restricted class of adiabatic quantum computers. The full adiabatic quantum computing model is equivalent to ordinary quantum computing (http://arxiv.org/abs/quant-ph/0405098 ). If the linked article is literally correct, then that means quantum computers can efficiently solve NP-complete problems if and only if classical computers can efficiently solve NP-complete problems. That may be true, but I&#x27;d be very surprised if someone has proved it. My guess: the paper under discussion probably shows that some particular adiabatic approach to solving…</p><p><a href="https://hackerpaper.kaipfister.de/p/quant-ph_0001106/">Paper and discussion history</a>. A mention is not an endorsement.</p>quant-ph