https://hackerpaper.kaipfister.de/p/1804.00640/Collected HN comments and submissions linking this paper.enMon, 02 Nov 2026 11:16:22 GMThttps://news.ycombinator.com/item?id=20228075urn:hackerpapers:mention:1804.00640:20228075Wed, 19 Jun 2019 22:42:10 GMT<p>You are oversimplifying the issue and solving a &quot;strawman problem. From the abstract of one of the discussed papers [1], &gt; We give a protocol for producing certifiable randomness from a single _untrusted_ quantum device that is _polynomial-time bounded_. The randomness is certified to be statistically close to uniform from the point of view of any _computationally unbounded quantum adversary_, that may _share entanglement_ with the quantum device. where I have highlighted the important terms. Your goal is to generate a random string that you trust that your adversary does not have any…</p><p><a href="https://hackerpaper.kaipfister.de/p/1804.00640/">Paper and discussion history</a>. A mention is not an endorsement.</p>quant-phhttps://news.ycombinator.com/item?id=20003195urn:hackerpapers:mention:1804.00640:20003195Fri, 24 May 2019 16:35:51 GMT<p>For what it&#x27;s worth, quantum computers might give a provably correct source of 2 (random numbers). The version I saw (requires 2 quantum devices): http://www.henryyuen.net/fall2018/scribe2.pdf New paper that claims to do it with only one quantum device: https://arxiv.org/pdf/1804.00640.pdf</p><p><a href="https://hackerpaper.kaipfister.de/p/1804.00640/">Paper and discussion history</a>. A mention is not an endorsement.</p>quant-ph