<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Fault-tolerant quantum computation · HackerPapers discussions</title><link>https://hackerpaper.kaipfister.de/p/quant-ph_9605011/</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/quant-ph_9605011/feed.xml" rel="self" type="application/rss+xml" /><item><title>Fault-tolerant quantum computation — mentioned by vtomole</title><link>https://news.ycombinator.com/item?id=40188760</link><guid isPermaLink="false">urn:hackerpapers:mention:quant-ph_9605011:40188760</guid><pubDate>Sun, 28 Apr 2024 14:17:43 GMT</pubDate><description>&lt;p&gt;&amp;gt; It is still open whether we can build quantum computers with sufficiently low noise to run Shor‘s algorithm. This statement should delimit between theory and experiment. Theoretically, the question of building a quantum computer with low enough noise to run Shor&amp;#x27;s has been solved. In fact it was solved by Shor himself in the 1990s: https://arxiv.org/abs/quant-ph/9605011. Experimentally, we are just getting started with building quantum computers with low enough noise: https://blogs.microsoft.com/blog/2024/04/03/advancing-scienc.... Experimentally, it will always be open whether a quantum…&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/quant-ph_9605011/"&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>
