<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Some Initial Guidelines for Building Reusable Quantum Oracles · HackerPapers discussions</title><link>https://hackerpaper.kaipfister.de/p/2303.14959/</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/2303.14959/feed.xml" rel="self" type="application/rss+xml" /><item><title>Some Initial Guidelines for Building Reusable Quantum Oracles — mentioned by thesz</title><link>https://news.ycombinator.com/item?id=47493712</link><guid isPermaLink="false">urn:hackerpapers:mention:2303.14959:47493712</guid><pubDate>Mon, 23 Mar 2026 19:01:24 GMT</pubDate><description>&lt;p&gt;The difference is quantum oracles can be constructed [1] and Turing oracle can&amp;#x27;t be [2]: &amp;quot;An oracle machine or o-machine is a Turing a-machine that pauses its computation at state &amp;quot;o&amp;quot; while, to complete its calculation, it &amp;quot;awaits the decision&amp;quot; of &amp;quot;the oracle&amp;quot;—an entity unspecified by Turing &amp;quot;apart from saying that it cannot be a machine&amp;quot; (Turing (1939).&amp;quot; [1] https://arxiv.org/abs/2303.14959 [2] https://en.wikipedia.org/wiki/Turing_machine&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2303.14959/"&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>
