<?xml version="1.0" encoding="utf-8" standalone="yes"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom">
  <channel>
    <title>Testing on oqft.com</title>
    <link>https://oqft.com/tags/testing/</link>
    <description>Recent content in Testing 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/testing/index.xml" rel="self" type="application/rss+xml" />
    <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>How OQFT Was Tested, Matrices, Random Inputs and the Wraparound Edge</title>
      <link>https://oqft.com/how-oqft-was-tested-matrices-random-inputs-and-the-wraparound-edge/</link>
      <pubDate>Fri, 13 Nov 2026 00:00:00 +0000</pubDate>
      <guid>https://oqft.com/how-oqft-was-tested-matrices-random-inputs-and-the-wraparound-edge/</guid>
      <description>&lt;p&gt;A circuit generator can produce something that looks fine, loads fine, and computes the wrong thing. The only way to know is to run the circuit and compare. OQFT does that at three levels, and every number below comes from the recorded runs in the repository.&lt;/p&gt;&#xA;&lt;h2 id=&#34;whole-matrices-up-to-10-qubits&#34;&gt;Whole Matrices, Up to 10 Qubits&lt;/h2&gt;&#xA;&lt;p&gt;For registers up to 10 qubits, the tests build the full matrix of each circuit, all 1,024 by 1,024 entries at the top end, and compare every entry with the exact Fourier transform written out by formula. The textbook QFT matches at every size from 1 to 10. The approximate QFT is checked the same way, to confirm its error stays inside a bound that tightens as it keeps more rotations.&lt;/p&gt;</description>
    </item>
  </channel>
</rss>
