<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Forecasting timelines of quantum computing · HackerPapers discussions</title><link>https://hackerpaper.kaipfister.de/p/2009.05045/</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/2009.05045/feed.xml" rel="self" type="application/rss+xml" /><item><title>Forecasting timelines of quantum computing — mentioned by rhaps0dy</title><link>https://news.ycombinator.com/item?id=42372168</link><guid isPermaLink="false">urn:hackerpapers:mention:2009.05045:42372168</guid><pubDate>Tue, 10 Dec 2024 00:18:14 GMT</pubDate><description>&lt;p&gt;Thank you for the explanation. It&amp;#x27;s still an upwards update on the qubit timelines of https://arxiv.org/pdf/2009.05045 (see Fig. 7), but not by an insane amount. We&amp;#x27;ve realized their 95% expectation of qubit progress (1 logical qubit) for 2026, in 2024.92 instead. Which to be clear is quite a bit faster than expected in 2020, but still within the realm of plausible stuff.&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2009.05045/"&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>Forecasting timelines of quantum computing — mentioned by jessriedel</title><link>https://news.ycombinator.com/item?id=40509101</link><guid isPermaLink="false">urn:hackerpapers:mention:2009.05045:40509101</guid><pubDate>Wed, 29 May 2024 06:28:34 GMT</pubDate><description>&lt;p&gt;&amp;gt; I thought the error rate has stayed pretty exponential in terms of the number of physical qubits needed to express a logical qubit There is finite a threshold error rate (roughly 0.1-1%) at which you can produce a single logical qubit with an unbounded number of physical qubits (infinite overhead). For error rates below the threshold, the overhead becomes much less. People expect overheads in the thousands. See Fig. 1 in our paper. https://arxiv.org/pdf/2009.05045 &amp;gt; and it’s not actually known if we’re any closer on that metric vs other more easily achieved metrics. We are getting lower…&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2009.05045/"&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>Forecasting timelines of quantum computing — mentioned by jessriedel</title><link>https://news.ycombinator.com/item?id=36673670</link><guid isPermaLink="false">urn:hackerpapers:mention:2009.05045:36673670</guid><pubDate>Mon, 10 Jul 2023 22:08:25 GMT</pubDate><description>&lt;p&gt;At least as of 2020, it looked like both qubit counts and two-qubit gate quality were improving exponentially, and our naive extrapolation said RSA 2048 wouldn&amp;#x27;t get cracked by 2039 at 95% confidence. https://arxiv.org/abs/2009.05045 As far as I can tell, this website suggests that two-qubit gate infidelity has continued to improve exponentially, although it&amp;#x27;s hard to tell if these are reliable datapoints. https://metriq.info/Task/38 Because there&amp;#x27;s typically an engineering tension between qubit count and gate quality, what you want to track is something like quantum volume, which looks to be…&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2009.05045/"&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>Forecasting timelines of quantum computing — mentioned by bwesterb</title><link>https://news.ycombinator.com/item?id=31993055</link><guid isPermaLink="false">urn:hackerpapers:mention:2009.05045:31993055</guid><pubDate>Tue, 05 Jul 2022 20:08:44 GMT</pubDate><description>&lt;p&gt;It&amp;#x27;s hard to say. Here is a great paper that tries to answer this question. https://arxiv.org/pdf/2009.05045v1.pdf See Figure 11. Optimistically 15 years. Pessimistically 35 years. But anything can happen.&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2009.05045/"&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>Forecasting timelines of quantum computing — HN submission</title><link>https://news.ycombinator.com/item?id=24481692</link><guid isPermaLink="false">urn:hackerpapers:submission:2009.05045:24481692</guid><pubDate>Tue, 15 Sep 2020 14:40:12 GMT</pubDate><description>&lt;p&gt;Forecasting Timelines of Quantum Computing&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/2009.05045/"&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>
