<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>The computational power of random quantum circuits in arbitrary geometries · HackerPapers discussions</title><link>https://hackerpaper.kaipfister.de/p/2406.02501/</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/2406.02501/feed.xml" rel="self" type="application/rss+xml" /><item><title>The computational power of random quantum circuits in arbitrary geometries — mentioned by Strilanc</title><link>https://news.ycombinator.com/item?id=47320898</link><guid isPermaLink="false">urn:hackerpapers:mention:2406.02501:47320898</guid><pubDate>Tue, 10 Mar 2026 09:28:40 GMT</pubDate><description>&lt;p&gt;What do you mean? The original 2019 supremacy experiment was eventually simulated, as better classical methods were found, but the followups are still holding strong (for example [4] and [5]). There was recently a series of blog posts by Dominik Hangleiter summarizing the situation: [1][2][3]. [1]: https://quantumfrontiers.com/2026/01/06/has-quantum-advantag... [2]: https://quantumfrontiers.com/2026/01/25/has-quantum-advantag... [3]: https://quantumfrontiers.com/2026/02/28/what-is-next-in-quan... [4]: https://arxiv.org/abs/2303.04792 [5]: https://arxiv.org/abs/2406.02501&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2406.02501/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>quant-ph</category></item><item><title>The computational power of random quantum circuits in arbitrary geometries — HN submission</title><link>https://news.ycombinator.com/item?id=40959241</link><guid isPermaLink="false">urn:hackerpapers:submission:2406.02501:40959241</guid><pubDate>Sun, 14 Jul 2024 06:29:06 GMT</pubDate><description>&lt;p&gt;The computational power of random quantum circuits in arbitrary geometries&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;2 points; 0 discussion replies on HN. &lt;a href="https://hackerpaper.kaipfister.de/p/2406.02501/"&gt;Paper and source history&lt;/a&gt;. A submission is not an endorsement.&lt;/p&gt;</description><category>quant-ph</category></item><item><title>The computational power of random quantum circuits in arbitrary geometries — HN submission</title><link>https://news.ycombinator.com/item?id=40938274</link><guid isPermaLink="false">urn:hackerpapers:submission:2406.02501:40938274</guid><pubDate>Thu, 11 Jul 2024 16:30:02 GMT</pubDate><description>&lt;p&gt;The computational power of random quantum circuits in arbitrary geometries&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;2 points; 0 discussion replies on HN. &lt;a href="https://hackerpaper.kaipfister.de/p/2406.02501/"&gt;Paper and source history&lt;/a&gt;. A submission is not an endorsement.&lt;/p&gt;</description><category>quant-ph</category></item></channel></rss>
