<?xml version="1.0" encoding="utf-8" standalone="yes"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom">
  <channel>
    <title>Case Studies on oqft.com</title>
    <link>https://oqft.com/tags/case-studies/</link>
    <description>Recent content in Case Studies 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/case-studies/index.xml" rel="self" type="application/rss+xml" />
    <item>
      <title>Choosing an Error Target for a 2048-Qubit OQFT, Each Tenfold Tightening Costs 24 to 32 Layers</title>
      <link>https://oqft.com/choosing-an-error-target-for-a-2048-qubit-oqft-each-tenfold-tightening-costs-24-to-32-layers/</link>
      <pubDate>Fri, 13 Nov 2026 00:00:00 +0000</pubDate>
      <guid>https://oqft.com/choosing-an-error-target-for-a-2048-qubit-oqft-each-tenfold-tightening-costs-24-to-32-layers/</guid>
      <description>&lt;p&gt;OQFT asks for one number besides the register size: the error target, &lt;code&gt;--eps&lt;/code&gt;. It&amp;rsquo;s the average squared error you&amp;rsquo;re willing to accept over all inputs. Pick it too loose and Shor&amp;rsquo;s algorithm misses more often. Pick it too tight and you pay in depth. This case study puts numbers on that trade for a 2,048-qubit register, the size a 2048-bit RSA key calls for.&lt;/p&gt;&#xA;&lt;p&gt;We ran &lt;code&gt;oqft stats -n 2048&lt;/code&gt; at four targets, from 0.1 down to 0.0001, and recorded the block width OQFT chose for each.&lt;/p&gt;</description>
    </item>
    <item>
      <title>How Block Width Sets the Error of an Optimistic QFT, Measured on 16 Qubits</title>
      <link>https://oqft.com/how-block-width-sets-the-error-of-an-optimistic-qft-measured-on-16-qubits/</link>
      <pubDate>Fri, 13 Nov 2026 00:00:00 +0000</pubDate>
      <guid>https://oqft.com/how-block-width-sets-the-error-of-an-optimistic-qft-measured-on-16-qubits/</guid>
      <description>&lt;p&gt;The block width is the one knob inside an optimistic QFT. Narrow blocks make a shallow circuit that fails often. Wide blocks fail rarely but cost more depth. OQFT normally picks the width for you from the error target, but on a register small enough to simulate you can force it with &lt;code&gt;--block-width&lt;/code&gt; and watch what happens.&lt;/p&gt;&#xA;&lt;p&gt;We took a 16-qubit register, forced every width from 2 to 8, and ran 300 random inputs through the simulator for each, with the same seed every time so the run can be repeated. For each input &lt;code&gt;oqft check&lt;/code&gt; measured the squared error against the exact QFT, and flagged any above 0.1.&lt;/p&gt;</description>
    </item>
    <item>
      <title>OQFT Depth Crossover, the Optimistic QFT Beats the Textbook Circuit From 68 Qubits On</title>
      <link>https://oqft.com/oqft-depth-crossover-the-optimistic-qft-beats-the-textbook-circuit-from-68-qubits-on/</link>
      <pubDate>Fri, 13 Nov 2026 00:00:00 +0000</pubDate>
      <guid>https://oqft.com/oqft-depth-crossover-the-optimistic-qft-beats-the-textbook-circuit-from-68-qubits-on/</guid>
      <description>&lt;p&gt;The optimistic QFT is built for big registers. Everyone working with it knows that. The less obvious question is where &amp;ldquo;big&amp;rdquo; starts, because below some size the textbook circuit is simply shallower, and a compiler that swaps in OQFT everywhere would make small circuits worse.&lt;/p&gt;&#xA;&lt;p&gt;So we ran &lt;code&gt;oqft stats&lt;/code&gt; at an error target of 0.01 for every register size from 32 to 80 qubits, plus a few larger ones, and wrote down depth and gate count for both circuits. Depth counts every gate as one layer, with gates on separate qubits sharing a layer.&lt;/p&gt;</description>
    </item>
  </channel>
</rss>
