<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Benchmarking the Planar Honeycomb Code · HackerPapers discussions</title><link>https://hackerpaper.kaipfister.de/p/2202.11845/</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/2202.11845/feed.xml" rel="self" type="application/rss+xml" /><item><title>Benchmarking the Planar Honeycomb Code — mentioned by Strilanc</title><link>https://news.ycombinator.com/item?id=41956988</link><guid isPermaLink="false">urn:hackerpapers:mention:2202.11845:41956988</guid><pubDate>Sat, 26 Oct 2024 19:10:50 GMT</pubDate><description>&lt;p&gt;Overall this article looks pretty good. There was one major numerical error I noticed, but then the article corrected itself at the end. This was the error: &amp;gt; With an error rate of 1% the surface error correction code requires ~ 500 physical qubits required to encode one logical qubit. This was the correction near the end: &amp;gt; With an error rate of 0.3% the surface error correction code requires ~ 10 thousand physical qubits to encode one logical qubit to achieve 10^-10 logical qubit error rate. The qubit count at an error rate of 1% was clearly off because the threshold of the surface code…&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2202.11845/"&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>
