<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Identifying hard native instances for the maximum independent set problem on neutral atoms quantum processors · HackerPapers discussions</title><link>https://hackerpaper.kaipfister.de/p/2502.04291/</link><description>Collected HN comments and submissions linking this paper.</description><language>en</language><lastBuildDate>Mon, 02 Nov 2026 11:27:26 GMT</lastBuildDate><atom:link href="https://hackerpaper.kaipfister.de/p/2502.04291/feed.xml" rel="self" type="application/rss+xml" /><item><title>Identifying hard native instances for the maximum independent set problem on neutral atoms quantum processors — HN submission</title><link>https://news.ycombinator.com/item?id=44592444</link><guid isPermaLink="false">urn:hackerpapers:submission:2502.04291:44592444</guid><pubDate>Thu, 17 Jul 2025 12:13:20 GMT</pubDate><description>&lt;p&gt;Show HN: Open-Source Quantum Solver for Maximum Independent Set Problems&lt;/p&gt;&lt;p&gt;We’ve just released an open-source library for solving the Maximum Independent Set (MIS) problem with neutral atom quantum computing, running on both quantum processing units (QPUs) and classical hardware, thanks to emulators. This project is the result of collaboration between Pasqal, academic researchers, and industry partners, aiming to make it practical to experiment with quantum approaches to hard combinatorial optimization tasks. The MIS problem appears in real-world scenarios like scheduling, resource allocation, and network optimization, areas where classical solvers often struggle as…&lt;/p&gt;&lt;p&gt;6 points; 0 discussion replies on HN. &lt;a href="https://hackerpaper.kaipfister.de/p/2502.04291/"&gt;Paper and source history&lt;/a&gt;. A submission is not an endorsement.&lt;/p&gt;</description><category>quant-ph</category></item></channel></rss>
