https://hackerpaper.kaipfister.de/p/1809.07442/Collected HN comments and submissions linking this paper.enMon, 02 Nov 2026 11:16:22 GMThttps://news.ycombinator.com/item?id=21044364urn:hackerpapers:mention:1809.07442:21044364Sun, 22 Sep 2019 22:22:54 GMT<p>No, the distribution is thought to be hard for any classical algorithm (this is still being worked on - there are still ongoing theory development for showing it is harder and harder), and by extension, any classical process. Yes, the problem is very contrived - the distribution being sampled is given by the distribution you get from sampling from a randomly sampled quantum circuit. Of course this is easy on a quantum computer because you can just throw on the randomly chosen gates and measure it. I don&#x27;t think it will be very useful in a application sense. This problem was designed for the…</p><p><a href="https://hackerpaper.kaipfister.de/p/1809.07442/">Paper and discussion history</a>. A mention is not an endorsement.</p>quant-ph