<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Quantum algorithms and the finite element method · HackerPapers discussions</title><link>https://hackerpaper.kaipfister.de/p/1512.05903/</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/1512.05903/feed.xml" rel="self" type="application/rss+xml" /><item><title>Quantum algorithms and the finite element method — mentioned by n4r9</title><link>https://news.ycombinator.com/item?id=39537700</link><guid isPermaLink="false">urn:hackerpapers:mention:1512.05903:39537700</guid><pubDate>Wed, 28 Feb 2024 13:37:20 GMT</pubDate><description>&lt;p&gt;As I understand from Wikipedia there are four fundamental quantum algorithms that perform better in some way than the best-known classical counterparts, and many more algorithms in total. The four fundamental ones are: * HHL algorithm for solving (sparse &amp;amp; insensitive) systems of linear equations * Grover&amp;#x27;s search algorithm for determining black-box inputs * Shor&amp;#x27;s algorithm for factoring primes * Quantum fourier transforms The above have various potential applications such as: * Deep learning [0] * Finance [1] * Solving large-dimensional differential equations [2] * Solving constraint…&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/1512.05903/"&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>
