<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>What is the Computational Value of Finite Range Tunneling? · HackerPapers discussions</title><link>https://hackerpaper.kaipfister.de/p/1512.02206/</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/1512.02206/feed.xml" rel="self" type="application/rss+xml" /><item><title>What is the Computational Value of Finite Range Tunneling? — mentioned by eghad</title><link>https://news.ycombinator.com/item?id=12572982</link><guid isPermaLink="false">urn:hackerpapers:mention:1512.02206:12572982</guid><pubDate>Sat, 24 Sep 2016 22:48:27 GMT</pubDate><description>&lt;p&gt;It is indeed, correct. The annealing example I linked is from his team (here&amp;#x27;s another one with full citation with Martinis at the end there [0]). And if you want further proof that Martinis and the Google Quantum team are pursing quantum annealing look no further than the Adiabtic Quantum Computing Conference that was held this summer where their team held several talks including &amp;quot;Building Quantum Annealer v2.0&amp;quot; [1]. And I didn&amp;#x27;t touch on your earlier (erroneous) comment on the scientific community&amp;#x27;s perception of D-Wave, but I think it needs to be said that in actual professional circles…&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/1512.02206/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>quant-ph</category></item><item><title>What is the Computational Value of Finite Range Tunneling? — mentioned by radioactivist</title><link>https://news.ycombinator.com/item?id=11670114</link><guid isPermaLink="false">urn:hackerpapers:mention:1512.02206:11670114</guid><pubDate>Tue, 10 May 2016 19:55:09 GMT</pubDate><description>&lt;p&gt;This article and the discussed work was put out last December (see http://arxiv.org/abs/1512.02206). Scott Aaronson weighed in around that time; see http://www.scottaaronson.com/blog/?p=2555.&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/1512.02206/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>quant-ph</category></item><item><title>What is the Computational Value of Finite Range Tunneling? — HN submission</title><link>https://news.ycombinator.com/item?id=10710349</link><guid isPermaLink="false">urn:hackerpapers:submission:1512.02206:10710349</guid><pubDate>Thu, 10 Dec 2015 12:48:11 GMT</pubDate><description>&lt;p&gt;What Is the Computational Value of Finite Range Tunneling?&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;1 point; 0 discussion replies on HN. &lt;a href="https://hackerpaper.kaipfister.de/p/1512.02206/"&gt;Paper and source history&lt;/a&gt;. A submission is not an endorsement.&lt;/p&gt;</description><category>quant-ph</category></item><item><title>What is the Computational Value of Finite Range Tunneling? — mentioned by eveningcoffee</title><link>https://news.ycombinator.com/item?id=10708131</link><guid isPermaLink="false">urn:hackerpapers:mention:1512.02206:10708131</guid><pubDate>Thu, 10 Dec 2015 01:00:27 GMT</pubDate><description>&lt;p&gt;If we compare single core CPU performance against heavily motivated special solution, then it is not (it does not follow that the same method can be applied in this case, but then again, a better classical algorithm on single core beats the reported quantum result according to the paper (PS. this is in the paper, not on the graph)). Here is comparison http://bitcoin.stackexchange.com/questions/36412/what-is-the... between GPU and ASIC bitcoin mining and here is https://en.bitcoin.it/wiki/Non-specialized_hardware_comparis... GPU and CPU comparison. From this the difference between between GPU…&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/1512.02206/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>quant-ph</category></item><item><title>What is the Computational Value of Finite Range Tunneling? — HN submission</title><link>https://news.ycombinator.com/item?id=10707090</link><guid isPermaLink="false">urn:hackerpapers:submission:1512.02206:10707090</guid><pubDate>Wed, 09 Dec 2015 22:01:08 GMT</pubDate><description>&lt;p&gt;What Is the Computational Value of Finite Range Tunneling?&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;2 points; 0 discussion replies on HN. &lt;a href="https://hackerpaper.kaipfister.de/p/1512.02206/"&gt;Paper and source history&lt;/a&gt;. A submission is not an endorsement.&lt;/p&gt;</description><category>quant-ph</category></item><item><title>What is the Computational Value of Finite Range Tunneling? — mentioned by valhalla</title><link>https://news.ycombinator.com/item?id=10704382</link><guid isPermaLink="false">urn:hackerpapers:mention:1512.02206:10704382</guid><pubDate>Wed, 09 Dec 2015 15:59:30 GMT</pubDate><description>&lt;p&gt;pdf of the research paper for the curious http://arxiv.org/pdf/1512.02206v1.pdf&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/1512.02206/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>quant-ph</category></item><item><title>What is the Computational Value of Finite Range Tunneling? — HN submission</title><link>https://news.ycombinator.com/item?id=10702897</link><guid isPermaLink="false">urn:hackerpapers:submission:1512.02206:10702897</guid><pubDate>Wed, 09 Dec 2015 10:28:36 GMT</pubDate><description>&lt;p&gt;What Is the Computational Value of Finite Range Tunneling?&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;1 point; 0 discussion replies on HN. &lt;a href="https://hackerpaper.kaipfister.de/p/1512.02206/"&gt;Paper and source history&lt;/a&gt;. A submission is not an endorsement.&lt;/p&gt;</description><category>quant-ph</category></item><item><title>What is the Computational Value of Finite Range Tunneling? — mentioned by ivan_ah</title><link>https://news.ycombinator.com/item?id=10701036</link><guid isPermaLink="false">urn:hackerpapers:mention:1512.02206:10701036</guid><pubDate>Wed, 09 Dec 2015 00:43:03 GMT</pubDate><description>&lt;p&gt;&amp;gt; from the paper http://arxiv.org/abs/1512.02206 : we report the total computational effort of QMC in standard units of time per single core. That&amp;#x27;s an interesting way to compare quantum and classical computer &amp;quot;substrates&amp;quot; on the same footing: running time. &amp;gt; Based on the results presented here, one cannot claim a quantum speedup [...] as this would require that the quantum processor [to] outperform the best known classical algorithm. This is not the case... because a variety of heuristic classical algorithms can solve most instances of Chimera structured problems much faster than SA, QMC…&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/1512.02206/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>quant-ph</category></item><item><title>What is the Computational Value of Finite Range Tunneling? — HN submission</title><link>https://news.ycombinator.com/item?id=10700926</link><guid isPermaLink="false">urn:hackerpapers:submission:1512.02206:10700926</guid><pubDate>Wed, 09 Dec 2015 00:22:57 GMT</pubDate><description>&lt;p&gt;What Is the Computational Value of Finite Range Tunneling?&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;2 points; 0 discussion replies on HN. &lt;a href="https://hackerpaper.kaipfister.de/p/1512.02206/"&gt;Paper and source history&lt;/a&gt;. A submission is not an endorsement.&lt;/p&gt;</description><category>quant-ph</category></item><item><title>What is the Computational Value of Finite Range Tunneling? — mentioned by ottoborden</title><link>https://news.ycombinator.com/item?id=10699881</link><guid isPermaLink="false">urn:hackerpapers:mention:1512.02206:10699881</guid><pubDate>Tue, 08 Dec 2015 21:56:18 GMT</pubDate><description>&lt;p&gt;Link to Google&amp;#x27;s paper: http://arxiv.org/abs/1512.02206&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/1512.02206/"&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>
