<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Asymptotically Efficient Quantum Karatsuba Multiplication · HackerPapers discussions</title><link>https://hackerpaper.kaipfister.de/p/1904.07356/</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/1904.07356/feed.xml" rel="self" type="application/rss+xml" /><item><title>Asymptotically Efficient Quantum Karatsuba Multiplication — mentioned by Strilanc</title><link>https://news.ycombinator.com/item?id=19764046</link><guid isPermaLink="false">urn:hackerpapers:mention:1904.07356:19764046</guid><pubDate>Sat, 27 Apr 2019 05:59:36 GMT</pubDate><description>&lt;p&gt;I wrote the paper that this article is describing [1], and can answer questions. The paper is probably more approachable than you think. Basically I rewrite code like `let intermediate_value = recursive_call(...)` into code like `output += recursive_call(...)`, which allows you to make recursive calls in a way that avoids ever storing the intermediate value. That&amp;#x27;s important in contexts where you can&amp;#x27;t simply discard information, namely quantum computing. [1]: https://arxiv.org/abs/1904.07356&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/1904.07356/"&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>
