<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>A Quantum Adiabatic Algorithm for Factorization and Its Experimental Implementation · HackerPapers discussions</title><link>https://hackerpaper.kaipfister.de/p/0808.1935/</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/0808.1935/feed.xml" rel="self" type="application/rss+xml" /><item><title>A Quantum Adiabatic Algorithm for Factorization and Its Experimental Implementation — mentioned by khed</title><link>https://news.ycombinator.com/item?id=10096935</link><guid isPermaLink="false">urn:hackerpapers:mention:0808.1935:10096935</guid><pubDate>Fri, 21 Aug 2015 11:59:28 GMT</pubDate><description>&lt;p&gt;There was a paper in 2008 claiming that adiabatic quantum computers could factor with a quantum speed up. http://arxiv.org/abs/0808.1935&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/0808.1935/"&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>A Quantum Adiabatic Algorithm for Factorization and Its Experimental Implementation — mentioned by mtrimpe</title><link>https://news.ycombinator.com/item?id=5699835</link><guid isPermaLink="false">urn:hackerpapers:mention:0808.1935:5699835</guid><pubDate>Mon, 13 May 2013 17:00:52 GMT</pubDate><description>&lt;p&gt;edit: Just to be clear, it does seem that adiabatic quantum computing can do factorization in quadratic time [1] http://arxiv.org/abs/0808.1935&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/0808.1935/"&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>
