<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Random Numbers Certified by Bell's Theorem · HackerPapers discussions</title><link>https://hackerpaper.kaipfister.de/p/0911.3427/</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/0911.3427/feed.xml" rel="self" type="application/rss+xml" /><item><title>Random Numbers Certified by Bell's Theorem — mentioned by amluto</title><link>https://news.ycombinator.com/item?id=12613897</link><guid isPermaLink="false">urn:hackerpapers:mention:0911.3427:12613897</guid><pubDate>Fri, 30 Sep 2016 17:37:09 GMT</pubDate><description>&lt;p&gt;It always makes me a little bit sad when people get excited about about fancy &amp;quot;quantum&amp;quot; things that don&amp;#x27;t use the full potential of quantum computation. With classical computing, if you plug in a widget and that widget spits out a bunch of supposedly random numbers, then you have to take it on faith that the widget isn&amp;#x27;t cheating and generating highly biased output. (For example, a deterministic cryptographic RNG is almost maximally biased, but it&amp;#x27;s computationally infeasible to tell just by examining the output.) With quantum techniques, if you are willing to plug in two devices and process…&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/0911.3427/"&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>
