<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Quantum computers can search arbitrarily large databases by a single query · HackerPapers discussions</title><link>https://hackerpaper.kaipfister.de/p/quant-ph_9706005/</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_9706005/feed.xml" rel="self" type="application/rss+xml" /><item><title>Quantum computers can search arbitrarily large databases by a single query — mentioned by naasking</title><link>https://news.ycombinator.com/item?id=15915271</link><guid isPermaLink="false">urn:hackerpapers:mention:quant-ph_9706005:15915271</guid><pubDate>Wed, 13 Dec 2017 16:34:01 GMT</pubDate><description>&lt;p&gt;&amp;gt; The answer I hear is that it helps solve the traveling salesman in record time, and that&amp;#x27;s all great and everything, but how will quantum computing be able to do things such as decrease the time it takes to train a RNN, or look up data in a database? &amp;quot;Quantum computers can search arbitrarily large databases by a single query&amp;quot; [1]. That&amp;#x27;s Grover&amp;#x27;s algorithm from 1997, one of the pinnacle results that got people excited about quantum computing. If you haven&amp;#x27;t come across it before, then you must not have read too much about quantum computing! [1] https://arxiv.org/pdf/quant-ph/9706005.pdf&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/quant-ph_9706005/"&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>
