<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Trapped-ion two-qubit gates with &gt;99.99% fidelity without ground-state cooling · HackerPapers discussions</title><link>https://hackerpaper.kaipfister.de/p/2510.17286/</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/2510.17286/feed.xml" rel="self" type="application/rss+xml" /><item><title>Trapped-ion two-qubit gates with &gt;99.99% fidelity without ground-state cooling — mentioned by Strilanc</title><link>https://news.ycombinator.com/item?id=47669172</link><guid isPermaLink="false">urn:hackerpapers:mention:2510.17286:47669172</guid><pubDate>Tue, 07 Apr 2026 00:25:36 GMT</pubDate><description>&lt;p&gt;&amp;gt; That graph suggests that even with the best error correction in the graph, it is impossible to factor RSA-4 with less then 10^4 qubits. Which seems very odd. It&amp;#x27;s because the plot is assuming the use of error correction even for the smallest cases. Error correction has minimum quantity and quality bars that you must clear in order for it to work at all, and most of the cost of breaking RSA4 is just clearing those bars. (You happen to be able to do RSA4 without error correction, as was done in 2001 [0], but it&amp;#x27;s kind of irrelevant because you need error correction to scale so results without…&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2510.17286/"&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>
