update week 10

Author: mhjensen

doc/pub/week10/html/week10-bs.html

@@ -116,10 +116,10 @@
                2,
                None,
                'fast-fourier-transform-fft'),
-              ('The discrete Fourier transform (DFT)',
+              ('More summary: The discrete Fourier transform (DFT)',
                2,
                None,
-               'the-discrete-fourier-transform-dft'),
+               'more-summary-the-discrete-fourier-transform-dft'),
               ('Output vector', 2, None, 'output-vector'),
               ('Simple example', 2, None, 'simple-example'),
               ('Discrete Fourier Transformations',
@@ -275,7 +275,7 @@
      <!-- navigation toc: --> <li><a href="#inverse-transform" style="font-size: 80%;"><b>Inverse transform</b></a></li>
      <!-- navigation toc: --> <li><a href="#summary-discrete-fourier-transforms" style="font-size: 80%;"><b>Summary: Discrete Fourier transforms</b></a></li>
      <!-- navigation toc: --> <li><a href="#fast-fourier-transform-fft" style="font-size: 80%;"><b>Fast Fourier transform (FFT)</b></a></li>
-     <!-- navigation toc: --> <li><a href="#the-discrete-fourier-transform-dft" style="font-size: 80%;"><b>The discrete Fourier transform (DFT)</b></a></li>
+     <!-- navigation toc: --> <li><a href="#more-summary-the-discrete-fourier-transform-dft" style="font-size: 80%;"><b>More summary: The discrete Fourier transform (DFT)</b></a></li>
      <!-- navigation toc: --> <li><a href="#output-vector" style="font-size: 80%;"><b>Output vector</b></a></li>
      <!-- navigation toc: --> <li><a href="#simple-example" style="font-size: 80%;"><b>Simple example</b></a></li>
      <!-- navigation toc: --> <li><a href="#discrete-fourier-transformations" style="font-size: 80%;"><b>Discrete Fourier Transformations</b></a></li>
@@ -389,16 +389,20 @@ <h2 id="plans-for-the-week-of-march-24-28-2025" class="anchor">Plans for the wee
 <h2 id="possible-paths-for-project-2" class="anchor">Possible paths for project 2 </h2>
 
 <ul>
-<li> Implement QFTs  and study the phase estimation algorithm and eventually Shor's algorithm for factorization of numbers.</li>
-<li> Study other algorithms
+<li> Implement QFTs  and study the quantum phase estimation (QPE) algorithm and
+<ol type="a"></li>
+ <li> Compare QFTs with Fast Fourier transforms</li>
+ <li> Add a comparison of  QPE for finding eigenvalues with the VQE method from project 1 or</li>
+ <li> Study  Shor's algorithm for factorization of numbers</li>
+</ol>
+<li> Study other algorithms (you may need QFTs and QPE)
 <ol type="a"></li>
  <li> Deutsch-Jozsa algorithm: Determine if a function is constant or balance using the fewest number of queries.</li>
- <li> Shor's algorithm : Factorize integers efficiently</li>
  <li> Other algorithms</li>
 </ol>
-<li> Study the solution of quantum mechanical eigenvalue problems with systems from atomic/molecular physics and quantum chemistry</li>
-<li> Quantum machine learning projects</li>
-<li> Other paths</li>
+<li> Study the solution of quantum mechanical eigenvalue problems with systems from atomic/molecular physics and quantum chemistry using adaptive QPE</li>
+<li> Quantum machine learning projects like quantum Boltzmann machine or quantum neural networks</li>
+<li> Other ideas</li>
 </ul>
 <p>For project 2, in order to be time efficient, you can use software like Qiskit, Pennylane, qBraid and/or other</p>
 
@@ -1029,10 +1033,12 @@ <h2 id="fast-fourier-transform-fft" class="anchor">Fast Fourier transform (FFT)
 To read more about Fast Fourier transforms and similar topics, see for example <a href="https://link.springer.com/book/10.1007/978-1-4020-6629-0" target="_self">Fast Fourier Transform - Algorithms and Applications</a>. See also <a href="https://github.com/CompPhysics/QuantumComputingMachineLearning/blob/gh-pages/doc/Textbooks/fastfourier.pdf" target="_self"><tt>https://github.com/CompPhysics/QuantumComputingMachineLearning/blob/gh-pages/doc/Textbooks/fastfourier.pdf</tt></a>
 </p>
 
-<p>Our emphasis is on the link between discrete Fourier transforms and quantum Fourier transforms. We will not discuss FFT in this course.</p>
+<p>Our emphasis is on the link between discrete Fourier transforms and quantum Fourier transforms.
+For fast Fourier transforms, we may (if there is interest) have a dedicated sessions on).
+</p>
 
 <!-- !split -->
-<h2 id="the-discrete-fourier-transform-dft" class="anchor">The discrete Fourier transform (DFT) </h2>
+<h2 id="more-summary-the-discrete-fourier-transform-dft" class="anchor">More summary: The discrete Fourier transform (DFT) </h2>
 
 <p>The discrete Fourier transform takes as input a complex vector</p>
 $$

doc/pub/week10/html/week10-reveal.html

@@ -214,17 +214,22 @@ <h2 id="plans-for-the-week-of-march-24-28-2025">Plans for the week of March 24-2
 <h2 id="possible-paths-for-project-2">Possible paths for project 2 </h2>
 
 <ul>
-<p><li> Implement QFTs  and study the phase estimation algorithm and eventually Shor's algorithm for factorization of numbers.</li>
-<p><li> Study other algorithms
+<p><li> Implement QFTs  and study the quantum phase estimation (QPE) algorithm and
+<ol type="a"></li>
+ <p><li> Compare QFTs with Fast Fourier transforms</li>
+ <p><li> Add a comparison of  QPE for finding eigenvalues with the VQE method from project 1 or</li>
+ <p><li> Study  Shor's algorithm for factorization of numbers</li>
+</ol>
+<p>
+<p><li> Study other algorithms (you may need QFTs and QPE)
 <ol type="a"></li>
  <p><li> Deutsch-Jozsa algorithm: Determine if a function is constant or balance using the fewest number of queries.</li>
- <p><li> Shor's algorithm : Factorize integers efficiently</li>
  <p><li> Other algorithms</li>
 </ol>
 <p>
-<p><li> Study the solution of quantum mechanical eigenvalue problems with systems from atomic/molecular physics and quantum chemistry</li>
-<p><li> Quantum machine learning projects</li>
-<p><li> Other paths</li>
+<p><li> Study the solution of quantum mechanical eigenvalue problems with systems from atomic/molecular physics and quantum chemistry using adaptive QPE</li>
+<p><li> Quantum machine learning projects like quantum Boltzmann machine or quantum neural networks</li>
+<p><li> Other ideas</li>
 </ul>
 <p>
 <p>For project 2, in order to be time efficient, you can use software like Qiskit, Pennylane, qBraid and/or other</p>
@@ -970,11 +975,13 @@ <h2 id="fast-fourier-transform-fft">Fast Fourier transform (FFT) </h2>
 To read more about Fast Fourier transforms and similar topics, see for example <a href="https://link.springer.com/book/10.1007/978-1-4020-6629-0" target="_blank">Fast Fourier Transform - Algorithms and Applications</a>. See also <a href="https://github.com/CompPhysics/QuantumComputingMachineLearning/blob/gh-pages/doc/Textbooks/fastfourier.pdf" target="_blank"><tt>https://github.com/CompPhysics/QuantumComputingMachineLearning/blob/gh-pages/doc/Textbooks/fastfourier.pdf</tt></a>
 </p>
 
-<p>Our emphasis is on the link between discrete Fourier transforms and quantum Fourier transforms. We will not discuss FFT in this course.</p>
+<p>Our emphasis is on the link between discrete Fourier transforms and quantum Fourier transforms.
+For fast Fourier transforms, we may (if there is interest) have a dedicated sessions on).
+</p>
 </section>
 
 <section>
-<h2 id="the-discrete-fourier-transform-dft">The discrete Fourier transform (DFT) </h2>
+<h2 id="more-summary-the-discrete-fourier-transform-dft">More summary: The discrete Fourier transform (DFT) </h2>
 
 <p>The discrete Fourier transform takes as input a complex vector</p>
 <p>&nbsp;<br>

doc/pub/week10/html/week10-solarized.html

@@ -143,10 +143,10 @@
                2,
                None,
                'fast-fourier-transform-fft'),
-              ('The discrete Fourier transform (DFT)',
+              ('More summary: The discrete Fourier transform (DFT)',
                2,
                None,
-               'the-discrete-fourier-transform-dft'),
+               'more-summary-the-discrete-fourier-transform-dft'),
               ('Output vector', 2, None, 'output-vector'),
               ('Simple example', 2, None, 'simple-example'),
               ('Discrete Fourier Transformations',
@@ -295,16 +295,20 @@ <h2 id="plans-for-the-week-of-march-24-28-2025">Plans for the week of March 24-2
 <h2 id="possible-paths-for-project-2">Possible paths for project 2 </h2>
 
 <ul>
-<li> Implement QFTs  and study the phase estimation algorithm and eventually Shor's algorithm for factorization of numbers.</li>
-<li> Study other algorithms
+<li> Implement QFTs  and study the quantum phase estimation (QPE) algorithm and
+<ol type="a"></li>
+ <li> Compare QFTs with Fast Fourier transforms</li>
+ <li> Add a comparison of  QPE for finding eigenvalues with the VQE method from project 1 or</li>
+ <li> Study  Shor's algorithm for factorization of numbers</li>
+</ol>
+<li> Study other algorithms (you may need QFTs and QPE)
 <ol type="a"></li>
  <li> Deutsch-Jozsa algorithm: Determine if a function is constant or balance using the fewest number of queries.</li>
- <li> Shor's algorithm : Factorize integers efficiently</li>
  <li> Other algorithms</li>
 </ol>
-<li> Study the solution of quantum mechanical eigenvalue problems with systems from atomic/molecular physics and quantum chemistry</li>
-<li> Quantum machine learning projects</li>
-<li> Other paths</li>
+<li> Study the solution of quantum mechanical eigenvalue problems with systems from atomic/molecular physics and quantum chemistry using adaptive QPE</li>
+<li> Quantum machine learning projects like quantum Boltzmann machine or quantum neural networks</li>
+<li> Other ideas</li>
 </ul>
 <p>For project 2, in order to be time efficient, you can use software like Qiskit, Pennylane, qBraid and/or other</p>
 
@@ -935,10 +939,12 @@ <h2 id="fast-fourier-transform-fft">Fast Fourier transform (FFT) </h2>
 To read more about Fast Fourier transforms and similar topics, see for example <a href="https://link.springer.com/book/10.1007/978-1-4020-6629-0" target="_blank">Fast Fourier Transform - Algorithms and Applications</a>. See also <a href="https://github.com/CompPhysics/QuantumComputingMachineLearning/blob/gh-pages/doc/Textbooks/fastfourier.pdf" target="_blank"><tt>https://github.com/CompPhysics/QuantumComputingMachineLearning/blob/gh-pages/doc/Textbooks/fastfourier.pdf</tt></a>
 </p>
 
-<p>Our emphasis is on the link between discrete Fourier transforms and quantum Fourier transforms. We will not discuss FFT in this course.</p>
+<p>Our emphasis is on the link between discrete Fourier transforms and quantum Fourier transforms.
+For fast Fourier transforms, we may (if there is interest) have a dedicated sessions on).
+</p>
 
 <!-- !split --><br><br><br><br><br><br><br><br><br><br>
-<h2 id="the-discrete-fourier-transform-dft">The discrete Fourier transform (DFT) </h2>
+<h2 id="more-summary-the-discrete-fourier-transform-dft">More summary: The discrete Fourier transform (DFT) </h2>
 
 <p>The discrete Fourier transform takes as input a complex vector</p>
 $$

doc/pub/week10/html/week10.html

@@ -220,10 +220,10 @@
                2,
                None,
                'fast-fourier-transform-fft'),
-              ('The discrete Fourier transform (DFT)',
+              ('More summary: The discrete Fourier transform (DFT)',
                2,
                None,
-               'the-discrete-fourier-transform-dft'),
+               'more-summary-the-discrete-fourier-transform-dft'),
               ('Output vector', 2, None, 'output-vector'),
               ('Simple example', 2, None, 'simple-example'),
               ('Discrete Fourier Transformations',
@@ -372,16 +372,20 @@ <h2 id="plans-for-the-week-of-march-24-28-2025">Plans for the week of March 24-2
 <h2 id="possible-paths-for-project-2">Possible paths for project 2 </h2>
 
 <ul>
-<li> Implement QFTs  and study the phase estimation algorithm and eventually Shor's algorithm for factorization of numbers.</li>
-<li> Study other algorithms
+<li> Implement QFTs  and study the quantum phase estimation (QPE) algorithm and
+<ol type="a"></li>
+ <li> Compare QFTs with Fast Fourier transforms</li>
+ <li> Add a comparison of  QPE for finding eigenvalues with the VQE method from project 1 or</li>
+ <li> Study  Shor's algorithm for factorization of numbers</li>
+</ol>
+<li> Study other algorithms (you may need QFTs and QPE)
 <ol type="a"></li>
  <li> Deutsch-Jozsa algorithm: Determine if a function is constant or balance using the fewest number of queries.</li>
- <li> Shor's algorithm : Factorize integers efficiently</li>
  <li> Other algorithms</li>
 </ol>
-<li> Study the solution of quantum mechanical eigenvalue problems with systems from atomic/molecular physics and quantum chemistry</li>
-<li> Quantum machine learning projects</li>
-<li> Other paths</li>
+<li> Study the solution of quantum mechanical eigenvalue problems with systems from atomic/molecular physics and quantum chemistry using adaptive QPE</li>
+<li> Quantum machine learning projects like quantum Boltzmann machine or quantum neural networks</li>
+<li> Other ideas</li>
 </ul>
 <p>For project 2, in order to be time efficient, you can use software like Qiskit, Pennylane, qBraid and/or other</p>
 
@@ -1012,10 +1016,12 @@ <h2 id="fast-fourier-transform-fft">Fast Fourier transform (FFT) </h2>
 To read more about Fast Fourier transforms and similar topics, see for example <a href="https://link.springer.com/book/10.1007/978-1-4020-6629-0" target="_blank">Fast Fourier Transform - Algorithms and Applications</a>. See also <a href="https://github.com/CompPhysics/QuantumComputingMachineLearning/blob/gh-pages/doc/Textbooks/fastfourier.pdf" target="_blank"><tt>https://github.com/CompPhysics/QuantumComputingMachineLearning/blob/gh-pages/doc/Textbooks/fastfourier.pdf</tt></a>
 </p>
 
-<p>Our emphasis is on the link between discrete Fourier transforms and quantum Fourier transforms. We will not discuss FFT in this course.</p>
+<p>Our emphasis is on the link between discrete Fourier transforms and quantum Fourier transforms.
+For fast Fourier transforms, we may (if there is interest) have a dedicated sessions on).
+</p>
 
 <!-- !split --><br><br><br><br><br><br><br><br><br><br>
-<h2 id="the-discrete-fourier-transform-dft">The discrete Fourier transform (DFT) </h2>
+<h2 id="more-summary-the-discrete-fourier-transform-dft">More summary: The discrete Fourier transform (DFT) </h2>
 
 <p>The discrete Fourier transform takes as input a complex vector</p>
 $$