<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>The State of Factoring on Quantum Computers · HackerPapers discussions</title><link>https://hackerpaper.kaipfister.de/p/2410.14397/</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/2410.14397/feed.xml" rel="self" type="application/rss+xml" /><item><title>The State of Factoring on Quantum Computers — mentioned by Strilanc</title><link>https://news.ycombinator.com/item?id=46537714</link><guid isPermaLink="false">urn:hackerpapers:mention:2410.14397:46537714</guid><pubDate>Thu, 08 Jan 2026 05:59:34 GMT</pubDate><description>&lt;p&gt;&amp;gt; By late 2024 the biggest numbers that had been factored by an actual digital quantum computer had 35 bits (citing https://arxiv.org/pdf/2410.14397v1 ) This is incorrect. The cited reference says &amp;quot;N &amp;lt;= 35&amp;quot;. That N is the number being factored, not the number of bits in the number. Also, footnote a of that paper points out (correctly) that the circuits that were used likely needed knowledge of the factors to create (e.g. as explained in https://arxiv.org/abs/1301.7007 ). As far as I know, only N=15 has been factored on a quantum computer in a no-shenanigans way. It&amp;#x27;s conceivable that current…&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2410.14397/"&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>
