<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>The theory of variational hybrid quantum-classical algorithms · HackerPapers discussions</title><link>https://hackerpaper.kaipfister.de/p/1509.04279/</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/1509.04279/feed.xml" rel="self" type="application/rss+xml" /><item><title>The theory of variational hybrid quantum-classical algorithms — mentioned by dangirsh</title><link>https://news.ycombinator.com/item?id=14596593</link><guid isPermaLink="false">urn:hackerpapers:mention:1509.04279:14596593</guid><pubDate>Tue, 20 Jun 2017 17:32:46 GMT</pubDate><description>&lt;p&gt;Great question. Both the IBM Q experience and Rigetti Forest allow users to write quantum algorithms with Python that can execute on real quantum hardware. Forest is different in 3 main ways: 1. Forest was designed with near-term applications in mind. Specifically, it uses our quantum instruction set (Quil) [1], which was designed for implementing classical/quantum hybrid algorithms [2]. These algorithms can leverage near-term quantum devices significantly more than &amp;quot;textbook&amp;quot; quantum algorithms (like Shor&amp;#x27;s). IBM Q places much less emphasis on hybrid computation. 2. Forest provides raw…&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/1509.04279/"&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>
