<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Quantum-assisted quantum compiling · HackerPapers discussions</title><link>https://hackerpaper.kaipfister.de/p/1807.00800/</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/1807.00800/feed.xml" rel="self" type="application/rss+xml" /><item><title>Quantum-assisted quantum compiling — mentioned by tagrun</title><link>https://news.ycombinator.com/item?id=20171034</link><guid isPermaLink="false">urn:hackerpapers:mention:1807.00800:20171034</guid><pubDate>Thu, 13 Jun 2019 01:16:42 GMT</pubDate><description>&lt;p&gt;There reference is probably this: https://arxiv.org/pdf/1807.00800.pdf They don&amp;#x27;t do anything to suppress errors, they&amp;#x27;re just trying to find a gate sequence (chosen from a pre-determined small set of primitives) that will perform a specific operation in minimal time, which will also minimize the impact of the noise. Unfortunately, given the current error rates, this alone isn&amp;#x27;t enough. They entirely omit dynamically corrected gates, which doesn&amp;#x27;t &amp;quot;consume&amp;quot; (require) even a single additional qubit, which will be employed in any useful implementation alongside a surface code variant. Another…&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/1807.00800/"&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>
