<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Option Pricing using Quantum Computers · HackerPapers discussions</title><link>https://hackerpaper.kaipfister.de/p/1905.02666/</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/1905.02666/feed.xml" rel="self" type="application/rss+xml" /><item><title>Option Pricing using Quantum Computers — mentioned by kvathupo</title><link>https://news.ycombinator.com/item?id=32727009</link><guid isPermaLink="false">urn:hackerpapers:mention:1905.02666:32727009</guid><pubDate>Mon, 05 Sep 2022 17:45:31 GMT</pubDate><description>&lt;p&gt;Frankly, the article reads as if the author has an axe to grind. On utility, there&amp;#x27;s more than just Shor&amp;#x27;s: unstructured search [1], finance ([2], [3]). Even if quantum computers ultimately prove unfruitful commercially, that doesn&amp;#x27;t render it a useless endeavor. Like String Theory, it can beget findings in other areas, regardless of whether you can profit from them: novel classical recommendation algorithms ([4]), quantum algorithms for SAT that could possibly help automated theorem proving ([5]). Part of the difficulty of quantum computing is that to show speedup, you need to find…&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/1905.02666/"&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>
