<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Quantum Random Number Generators · HackerPapers discussions</title><link>https://hackerpaper.kaipfister.de/p/1604.03304/</link><description>Collected HN comments and submissions linking this paper.</description><language>en</language><lastBuildDate>Mon, 02 Nov 2026 11:16:22 GMT</lastBuildDate><atom:link href="https://hackerpaper.kaipfister.de/p/1604.03304/feed.xml" rel="self" type="application/rss+xml" /><item><title>Quantum Random Number Generators — mentioned by thamer</title><link>https://news.ycombinator.com/item?id=21881668</link><guid isPermaLink="false">urn:hackerpapers:mention:1604.03304:21881668</guid><pubDate>Thu, 26 Dec 2019 02:19:19 GMT</pubDate><description>&lt;p&gt;That&amp;#x27;s the method described in https://arxiv.org/pdf/1604.03304.pdf on page 11: &amp;gt; A fast clock (down) is used to increase a counter. Whenever a detection is made (up), the counter is read and reset, generating one random number. &amp;gt; We restrict to a counter that generates values from 0 to M −1, a modulo M counter. When M = 2 we have a binary random number generator. It doesn&amp;#x27;t have to be a millisecond timestamp, any clock that&amp;#x27;s much faster than the rate of decay should work. Every time a decay is detected, take the elapsed time in clock units mod 2 and that&amp;#x27;s your random bit.&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/1604.03304/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>quant-ph</category></item></channel></rss>
