https://hackerpaper.kaipfister.de/p/quant-ph_9605043/Collected HN comments and submissions linking this paper.enMon, 02 Nov 2026 11:16:22 GMThttps://news.ycombinator.com/item?id=9929868urn:hackerpapers:mention:quant-ph_9605043:9929868Wed, 22 Jul 2015 14:36:21 GMT<p>After quickly reading through the paper it seems that the algorithm they employ is very similar to Grover search [1], which provides a quadratic/square-root speed-up for generic search problems, so O(2^m) -&gt; O(2^(n/2)). Basically, they perform the following three steps: 1) Generate an even superposition of all possible solution states using a Hadamard transform (so go from |000000...&gt; to 1/sqrt(N)*(|00000..0&gt;+|000...1&gt;+|1111...1&gt;). This is pretty standard and used in almost all quantum algorithms. 2) Evaluate each clause of their Boolean E3-CNF function on the superposed input state and…</p><p><a href="https://hackerpaper.kaipfister.de/p/quant-ph_9605043/">Paper and discussion history</a>. A mention is not an endorsement.</p>quant-ph