<?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 with Constant Overhead · HackerPapers discussions</title><link>https://hackerpaper.kaipfister.de/p/1310.2984/</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/1310.2984/feed.xml" rel="self" type="application/rss+xml" /><item><title>Fault-Tolerant Quantum Computation with Constant Overhead — mentioned by s1dev</title><link>https://news.ycombinator.com/item?id=31051019</link><guid isPermaLink="false">urn:hackerpapers:mention:1310.2984:31051019</guid><pubDate>Sat, 16 Apr 2022 09:39:32 GMT</pubDate><description>&lt;p&gt;There is an extremely broad range of scaling between linear and exponential… Even in architectures with nearest neighbor gates, the (multiplicative) overhead stemming from error correction will only need to be logarithmic in the size of the computation. The constants may be unfavorable, but a log is still a log. See for example https://arxiv.org/abs/1208.0928 and https://arxiv.org/abs/1310.2984&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/1310.2984/"&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>
