https://hackerpaper.kaipfister.de/p/2104.00687/Collected HN comments and submissions linking this paper.enMon, 02 Nov 2026 11:16:22 GMThttps://news.ycombinator.com/item?id=42380592urn:hackerpapers:mention:2104.00687:42380592Tue, 10 Dec 2024 19:40:32 GMT<p>I would add one more to this, which I would argue is the main reason: (0) For a quantum algorithm/simulation to be classically verifiable, it needs additional structure; something that leads to a structured, verifiable output despite the intermediate steps being intractable to simulate classically. That additional structure necessarily adds complexity beyond what can be run on current devices. To pick an arbitrary example I&#x27;m familiar with, this paper (https://arxiv.org/abs/2104.00687) relies on the quantum computer implementing a certain cryptographic hash function. This alone makes the…</p><p><a href="https://hackerpaper.kaipfister.de/p/2104.00687/">Paper and discussion history</a>. A mention is not an endorsement.</p>quant-ph