https://hackerpaper.kaipfister.de/p/2209.10398/Collected HN comments and submissions linking this paper.enMon, 02 Nov 2026 11:16:22 GMThttps://news.ycombinator.com/item?id=48567231urn:hackerpapers:mention:2209.10398:48567231Wed, 17 Jun 2026 07:59:10 GMT<p>No. As far as we know, no realization of a quantum algorithm can solve NP-complete problems in polynomial many steps. Some people that worked on this topic told me that there seems to be some improvements on the quasi-optimal solution found, but that due to the scale of current quantum computers, it just have been tried out on small-sized problems. Theoretically, there are some papers suggesting that there are problems in BQP (the computational model of quantum computers) outside of NP [1] and even, the PH [2] (Polynomial Hierarchy, the infinite hierarchy of composition of NP and co-NP…</p><p><a href="https://hackerpaper.kaipfister.de/p/2209.10398/">Paper and discussion history</a>. A mention is not an endorsement.</p>cs.CC