<?xml version="1.0" encoding="utf-8" standalone="yes"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom">
  <channel>
    <title>Releases on oqft.com</title>
    <link>https://oqft.com/tags/releases/</link>
    <description>Recent content in Releases 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/releases/index.xml" rel="self" type="application/rss+xml" />
    <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>
