<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Certified Randomness from Quantum Supremacy · HackerPapers discussions</title><link>https://hackerpaper.kaipfister.de/p/2303.01625/</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/2303.01625/feed.xml" rel="self" type="application/rss+xml" /><item><title>Certified Randomness from Quantum Supremacy — mentioned by magicalhippo</title><link>https://news.ycombinator.com/item?id=43531845</link><guid isPermaLink="false">urn:hackerpapers:mention:2303.01625:43531845</guid><pubDate>Mon, 31 Mar 2025 06:37:47 GMT</pubDate><description>&lt;p&gt;The whole point of the result here, which is an implementation of this[1] paper, is exactly that you don&amp;#x27;t have to take anyone&amp;#x27;s word for how good their quantum chip is, but rather that you can yourself verify that it is good. From the referenced paper: The problem is, how do we convince a skeptic over the Internet, with no access to our hardware, that the bits were indeed random, and not secretly backdoored? In our protocol, a classical verifier uses a small random seed to generate n-qubit challenge circuits C1, C2, . . . pseudorandomly. The verifier then submits these Ci’s one at a time…&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2303.01625/"&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>
