<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Exact search algorithm to factorize large biprimes and a triprime on IBM quantum computer · HackerPapers discussions</title><link>https://hackerpaper.kaipfister.de/p/1805.10478/</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/1805.10478/feed.xml" rel="self" type="application/rss+xml" /><item><title>Exact search algorithm to factorize large biprimes and a triprime on IBM quantum computer — mentioned by c1own</title><link>https://news.ycombinator.com/item?id=22019646</link><guid isPermaLink="false">urn:hackerpapers:mention:1805.10478:22019646</guid><pubDate>Sat, 11 Jan 2020 13:01:23 GMT</pubDate><description>&lt;p&gt;arXiv:1805.10478 (and most non-Shor records on the wiki page) are hacks. They essentially reduce factoring to SAT, pick numbers so that the SAT instance is easy, and then solve that SAT instance. Which is a bad non-scalable way to factor numbers. The scalable way to factor is using Shor, but Shor only becomes practical once we have thousands of qubits, and it breaks RSA2048 with about 20 million qubits. (For clarification, a &amp;quot;qubit&amp;quot; here is a noisy qubit.)&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/1805.10478/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>quant-ph</category></item><item><title>Exact search algorithm to factorize large biprimes and a triprime on IBM quantum computer — mentioned by mcpherrinm</title><link>https://news.ycombinator.com/item?id=22018029</link><guid isPermaLink="false">urn:hackerpapers:mention:1805.10478:22018029</guid><pubDate>Sat, 11 Jan 2020 04:01:19 GMT</pubDate><description>&lt;p&gt;We haven&amp;#x27;t gotten quantum computers to do anything faster than classical computers, except possibly contrived problems designed to be fast on quantum computers. We have factored some small numbers on quantum computers but nothing a classical one couldn&amp;#x27;t do in a split second. https://en.wikipedia.org/wiki/Integer_factorization_records / https://arxiv.org/abs/1805.10478&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/1805.10478/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>quant-ph</category></item><item><title>Exact search algorithm to factorize large biprimes and a triprime on IBM quantum computer — mentioned by gundmc</title><link>https://news.ycombinator.com/item?id=20017337</link><guid isPermaLink="false">urn:hackerpapers:mention:1805.10478:20017337</guid><pubDate>Sun, 26 May 2019 20:35:58 GMT</pubDate><description>&lt;p&gt;&amp;quot;Here we experimentally demonstrate the factorization of two bi-primes, 4088459 and 966887 using IBM&amp;#x27;s 5- and 16-qubit quantum processors, hence making those the largest numbers that have been factorized on a quantum device.&amp;quot;[1] It looks like some real progress has been made with qbit quality and stability in the last few years! I think that 21 figure held for quite a while. Maybe it still does hold and I&amp;#x27;m misunderstanding some of the nuance. 1 - https://arxiv.org/abs/1805.10478&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/1805.10478/"&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>
