<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Analyzing the Performance of Variational Quantum Factoring on a Superconducting Quantum Processor · HackerPapers discussions</title><link>https://hackerpaper.kaipfister.de/p/2012.07825/</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/2012.07825/feed.xml" rel="self" type="application/rss+xml" /><item><title>Analyzing the Performance of Variational Quantum Factoring on a Superconducting Quantum Processor — mentioned by eigenket</title><link>https://news.ycombinator.com/item?id=40021482</link><guid isPermaLink="false">urn:hackerpapers:mention:2012.07825:40021482</guid><pubDate>Sat, 13 Apr 2024 08:28:24 GMT</pubDate><description>&lt;p&gt;Significantly larger numbers than 15 have been factored [1] but not using Shor&amp;#x27;s algorithm. Shor&amp;#x27;s algorithm is particularly sensitive to noise/errors in your quantum computer and isn&amp;#x27;t going to be useful unless we get a properly error corrected machine working. The algorithms used in [1] are considerably less fancy (with worse asymptomatic performance) but are more resilient to noise. [1] https://arxiv.org/abs/2012.07825&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2012.07825/"&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>
