<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>A comprehensive benchmark of an Ising machine on the Max-Cut problem · HackerPapers discussions</title><link>https://hackerpaper.kaipfister.de/p/2507.22117/</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/2507.22117/feed.xml" rel="self" type="application/rss+xml" /><item><title>A comprehensive benchmark of an Ising machine on the Max-Cut problem — mentioned by pathOf_aFineMan</title><link>https://news.ycombinator.com/item?id=48307340</link><guid isPermaLink="false">urn:hackerpapers:mention:2507.22117:48307340</guid><pubDate>Thu, 28 May 2026 11:12:08 GMT</pubDate><description>&lt;p&gt;the use of &amp;#x27;quantum&amp;#x27; appears to be tagging onto the potential of quantum annealers (which have repetitively [1] [2] been shown to be classically tractable) while trying to mimic a kind of quantum tunneling, ie the annealing schedule, without any kind of promises about exponential speedups etc. Quantum annealers themselves have few promised advantages for general combinatorial optimization problems without significant changes to extant hardware paradigms [3] [1] https://arxiv.org/abs/2503.05693 [2] https://arxiv.org/pdf/2507.22117 [3] https://arxiv.org/abs/2008.09913&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2507.22117/"&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>
