https://hackerpaper.kaipfister.de/p/cond-mat_0012334/Collected HN comments and submissions linking this paper.enMon, 02 Nov 2026 11:16:22 GMThttps://news.ycombinator.com/item?id=7788004urn:hackerpapers:mention:cond-mat_0012334:7788004Fri, 23 May 2014 04:38:31 GMT<p>Maybe you mean subexponential time? Which is not much of an improvement. This is a question which I would like someone like Scott Aaronson to answer. The sign problem is NP-hard[1]. So it&#x27;s not currently believed that quantum computers can actually help with the sign problem [2]. On the other hand, we have papers that seem to say they could [3]. &quot;today it seems extremely unlikely that quantum computers can solve NP-complete problems in polynomial time&quot; -- Scott Aaronson [1] http://arxiv.org/pdf/cond-mat/0408370.pdf [2] http://www.scottaaronson.com/papers/bqpph.pdf [3]…</p><p><a href="https://hackerpaper.kaipfister.de/p/cond-mat_0012334/">Paper and discussion history</a>. A mention is not an endorsement.</p>cond-mat