<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Generalized Quantum Search with Parallelism · HackerPapers discussions</title><link>https://hackerpaper.kaipfister.de/p/quant-ph_9904049/</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/quant-ph_9904049/feed.xml" rel="self" type="application/rss+xml" /><item><title>Generalized Quantum Search with Parallelism — mentioned by robocat</title><link>https://news.ycombinator.com/item?id=28753390</link><guid isPermaLink="false">urn:hackerpapers:mention:quant-ph_9904049:28753390</guid><pubDate>Mon, 04 Oct 2021 22:56:36 GMT</pubDate><description>&lt;p&gt;Generalized Quantum Search with Parallelism — https://arxiv.org/abs/quant-ph/9904049 “We generalize Grover&amp;#x27;s”… “We extend the analysis to the case of a society of k quantum searches acting in parallel”. Disclaimer: I know absolutely nothing about the topic, but the first link I googled seems to justify my intuition that this decryption could be partitioned so that many quantum computers could run in parallel (thus avoiding the limit on speed of information transfer you are hypothesising). &amp;gt; Either way it&amp;#x27;s a bit beyond what&amp;#x27;s economically possible for any human organization right now. And I…&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/quant-ph_9904049/"&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>
