<?xml version="1.0" encoding="utf-8" standalone="yes"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom">
  <channel>
    <title>Challenges in Compiling Hybrid Programs on My New Hugo Site</title>
    <link>http://localhost:1313/posts/03_compiler/</link>
    <description>Recent content in Challenges in Compiling Hybrid Programs on My New Hugo Site</description>
    <generator>Hugo</generator>
    <language>en-us</language>
    <atom:link href="http://localhost:1313/posts/03_compiler/index.xml" rel="self" type="application/rss+xml" />
    <item>
      <title>Bridging the quantum-classical gap</title>
      <link>http://localhost:1313/posts/03_compiler/01_hybrid/</link>
      <pubDate>Mon, 01 Jan 0001 00:00:00 +0000</pubDate>
      <guid>http://localhost:1313/posts/03_compiler/01_hybrid/</guid>
      <description>&lt;h2 id=&#34;syndrome-extraction-an-expensive-operation&#34;&gt;&#xA;  Syndrome extraction: an expensive operation&#xA;  &lt;a class=&#34;anchor&#34; href=&#34;#syndrome-extraction-an-expensive-operation&#34;&gt;#&lt;/a&gt;&#xA;&lt;/h2&gt;&#xA;&lt;p&gt;Benchmark classical code, with and without optimisations enabled. -&amp;gt; Motivate the need for classical compiler optimisations.&lt;/p&gt;</description>
    </item>
    <item>
      <title>Programming languages and Internal Representations</title>
      <link>http://localhost:1313/posts/03_compiler/02_llvm/</link>
      <pubDate>Mon, 01 Jan 0001 00:00:00 +0000</pubDate>
      <guid>http://localhost:1313/posts/03_compiler/02_llvm/</guid>
      <description>&lt;p&gt;An important point we have been ignoring: how do we even express and represent hybrid  programs?&lt;/p&gt;&#xA;&lt;h2 id=&#34;guppy&#34;&gt;&#xA;  Guppy&#xA;  &lt;a class=&#34;anchor&#34; href=&#34;#guppy&#34;&gt;#&lt;/a&gt;&#xA;&lt;/h2&gt;&#xA;&lt;h2 id=&#34;internal-representations&#34;&gt;&#xA;  Internal representations&#xA;  &lt;a class=&#34;anchor&#34; href=&#34;#internal-representations&#34;&gt;#&lt;/a&gt;&#xA;&lt;/h2&gt;</description>
    </item>
    <item>
      <title>Limitation of Existing Techniques</title>
      <link>http://localhost:1313/posts/03_compiler/03_limitations/</link>
      <pubDate>Mon, 01 Jan 0001 00:00:00 +0000</pubDate>
      <guid>http://localhost:1313/posts/03_compiler/03_limitations/</guid>
      <description>&lt;p&gt;Possibly split into&lt;/p&gt;&#xA;&lt;h2 id=&#34;classical-optimisation&#34;&gt;&#xA;  Classical Optimisation&#xA;  &lt;a class=&#34;anchor&#34; href=&#34;#classical-optimisation&#34;&gt;#&lt;/a&gt;&#xA;&lt;/h2&gt;&#xA;&lt;h2 id=&#34;quantum-optimisation&#34;&gt;&#xA;  Quantum Optimisation&#xA;  &lt;a class=&#34;anchor&#34; href=&#34;#quantum-optimisation&#34;&gt;#&lt;/a&gt;&#xA;&lt;/h2&gt;</description>
    </item>
    <item>
      <title>Equality Saturation: A Promising Solution?</title>
      <link>http://localhost:1313/posts/03_compiler/04_eqsat/</link>
      <pubDate>Mon, 01 Jan 0001 00:00:00 +0000</pubDate>
      <guid>http://localhost:1313/posts/03_compiler/04_eqsat/</guid>
      <description>&lt;h2 id=&#34;term-rewriting-with-equality-saturation-is-the-most-promising-technique&#34;&gt;&#xA;  Term rewriting with equality saturation is the most promising technique&#xA;  &lt;a class=&#34;anchor&#34; href=&#34;#term-rewriting-with-equality-saturation-is-the-most-promising-technique&#34;&gt;#&lt;/a&gt;&#xA;&lt;/h2&gt;&#xA;&lt;h2 id=&#34;description-of-eqsat&#34;&gt;&#xA;  Description of eqsat&#xA;  &lt;a class=&#34;anchor&#34; href=&#34;#description-of-eqsat&#34;&gt;#&lt;/a&gt;&#xA;&lt;/h2&gt;&#xA;&lt;h2 id=&#34;no-clone-makes-it-impossible-to-use-in-quantum-problems-with-dags&#34;&gt;&#xA;  No-clone makes it impossible to use in quantum! Problems with DAGs&#xA;  &lt;a class=&#34;anchor&#34; href=&#34;#no-clone-makes-it-impossible-to-use-in-quantum-problems-with-dags&#34;&gt;#&lt;/a&gt;&#xA;&lt;/h2&gt;</description>
    </item>
  </channel>
</rss>
