<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Classical Sampling of Random Quantum Circuits with Bounded Fidelity · HackerPapers discussions</title><link>https://hackerpaper.kaipfister.de/p/2112.15083/</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/2112.15083/feed.xml" rel="self" type="application/rss+xml" /><item><title>Classical Sampling of Random Quantum Circuits with Bounded Fidelity — mentioned by wasabi991011</title><link>https://news.ycombinator.com/item?id=42368656</link><guid isPermaLink="false">urn:hackerpapers:mention:2112.15083:42368656</guid><pubDate>Mon, 09 Dec 2024 18:05:16 GMT</pubDate><description>&lt;p&gt;&amp;quot;Severely flawed&amp;quot; is a matter of interpretation, and I don&amp;#x27;t want to argue for or against. But to put into context, these numbers are likely accurate, but represent the time it would take for a very naive classical algorithm (possibly brute-force, I am unsure). For example, the previous result claimed it would take Summit 10,000 years to do the same calculation as the Sycamore quantum chip. However, other researchers were able to reproduce results classically using tensor-network-based methods in 14.5 days using a &amp;quot;relatively small cluster&amp;quot;. [1] [1] G. Kalachev, P. Panteleev, P. Zhou, and…&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2112.15083/"&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>
