<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Constrained-optimization Approach Delivers Superior Classical Performance for Graph Partitioning via Quantum-ready Method · HackerPapers discussions</title><link>https://hackerpaper.kaipfister.de/p/2006.15067/</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/2006.15067/feed.xml" rel="self" type="application/rss+xml" /><item><title>Constrained-optimization Approach Delivers Superior Classical Performance for Graph Partitioning via Quantum-ready Method — mentioned by spreinhardt</title><link>https://news.ycombinator.com/item?id=26845294</link><guid isPermaLink="false">urn:hackerpapers:mention:2006.15067:26845294</guid><pubDate>Sat, 17 Apr 2021 16:08:39 GMT</pubDate><description>&lt;p&gt;Re: use cases for quantum computing: - I spent 4 years at D-Wave and now 2 years at QCI working on apps/tools for quantum computers, mostly focused on constrained optimization. I know a fair amount about how to use D-Wave&amp;#x27;s annealing QPU and a smidgen about how to use gate-model QPUs but am not a quantum physicist. - Yes, the QPUs available via AWS&amp;#x27; Braket are real QPUs that run real quantum problems, and cost real money. :) IBM, Honeywell, and others have QPUs available directly from the vendor. - To my knowledge there are no real-world problems that today deliver better performance…&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2006.15067/"&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>
