<?xml version="1.0" encoding="utf-8" standalone="yes"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom">
  <channel>
    <title>Openqasm on oqft.com</title>
    <link>https://oqft.com/tags/openqasm/</link>
    <description>Recent content in Openqasm on oqft.com</description>
    <generator>Hugo</generator>
    <language>en-us</language>
    <lastBuildDate>Fri, 13 Nov 2026 00:00:00 +0000</lastBuildDate>
    <atom:link href="https://oqft.com/tags/openqasm/index.xml" rel="self" type="application/rss+xml" />
    <item>
      <title>Loading OQFT Circuits Into Qiskit, the Same CX Count After Transpiling but Less Than a Third of the Depth</title>
      <link>https://oqft.com/loading-oqft-circuits-into-qiskit-the-same-cx-count-after-transpiling-but-less-than-a-third-of-the-depth/</link>
      <pubDate>Fri, 13 Nov 2026 00:00:00 +0000</pubDate>
      <guid>https://oqft.com/loading-oqft-circuits-into-qiskit-the-same-cx-count-after-transpiling-but-less-than-a-third-of-the-depth/</guid>
      <description>&lt;p&gt;OQFT writes OpenQASM 3 with three gates from the standard library, &lt;code&gt;h&lt;/code&gt;, &lt;code&gt;cp&lt;/code&gt; and &lt;code&gt;swap&lt;/code&gt;. Anything that reads OpenQASM 3 can take it. Qiskit is the toolkit most people will try first, so this example loads OQFT&amp;rsquo;s output there, checks it, and runs it through Qiskit&amp;rsquo;s transpiler.&lt;/p&gt;&#xA;&lt;p&gt;You need Python with &lt;code&gt;qiskit&lt;/code&gt; and &lt;code&gt;qiskit_qasm3_import&lt;/code&gt;, and &lt;code&gt;oqft&lt;/code&gt; on your PATH.&lt;/p&gt;&#xA;&lt;div class=&#34;highlight&#34;&gt;&lt;pre tabindex=&#34;0&#34; style=&#34;color:#f8f8f2;background-color:#272822;-moz-tab-size:4;-o-tab-size:4;tab-size:4;&#34;&gt;&lt;code class=&#34;language-sh&#34; data-lang=&#34;sh&#34;&gt;&lt;span style=&#34;display:flex;&#34;&gt;&lt;span&gt;pip install qiskit qiskit_qasm3_import&#xA;&lt;/span&gt;&lt;/span&gt;&lt;/code&gt;&lt;/pre&gt;&lt;/div&gt;&lt;p&gt;&lt;img src=&#34;https://oqft.com/images/oqft-qiskit.png&#34; alt=&#34;Output of the Qiskit example: the 6-qubit oqft QFT equals Qiskit&amp;rsquo;s QFT matrix; the 256-qubit OQFT loads with 9,400 cp, 496 h and 128 swap gates at depth 158; after transpiling, OQFT has 19,184 CX at depth 624 and Qiskit&amp;rsquo;s textbook QFT 19,224 CX at depth 2,044.&#34;&gt;&lt;/p&gt;</description>
    </item>
    <item>
      <title>OQFT Cuts QFT Depth From 4096 to 198 on a 2048-Qubit Register</title>
      <link>https://oqft.com/oqft-cuts-qft-depth-from-4096-to-198-on-a-2048-qubit-register/</link>
      <pubDate>Fri, 13 Nov 2026 00:00:00 +0000</pubDate>
      <guid>https://oqft.com/oqft-cuts-qft-depth-from-4096-to-198-on-a-2048-qubit-register/</guid>
      <description>&lt;p&gt;The quantum Fourier transform sits in the middle of Shor&amp;rsquo;s algorithm. Build it the textbook way on 2,048 qubits, the size you&amp;rsquo;d need for a 2048-bit RSA key, and you get about 2.1 million gates stacked 4,096 layers deep. Most of those gates are tiny rotations that barely change anything. The rest still have to wait their turn.&lt;/p&gt;&#xA;&lt;p&gt;OQFT 0.3 builds the other version. The optimistic QFT on the same 2,048 qubits takes 198 layers and about 104,000 gates, and it needs no qubits beyond the register itself. It&amp;rsquo;s right on almost every input. On a small, known slice of inputs it&amp;rsquo;s badly wrong, and that&amp;rsquo;s the deal.&lt;/p&gt;</description>
    </item>
  </channel>
</rss>
