Deploy QCGPU/qcgpu-rust to github.com/QCGPU/qcgpu-rust.git:gh-pages

book/algorithms/deutsch-jozsa.html

@@ -157,7 +157,7 @@
 <p>The Deutsch-Jozsa problem is to find whether \(f\) is <em>constant</em> or <em>balanced</em>, in as few function evaluations as possible.</p>
 <p>Using classical computing, in the worst case, this requires \(2^{n-1}+1\) function evaluations.
 Using quantum computing, this can be done with just one function evaluation.</p>
-<p>The function \(f\), to be used in a quantum computer, must be specified specified by an oracle circuit \(U_{f}\) such that \(U_{f} \lvert x \rangle = (-1)^{f(x)}\lvert x \rangle\).</p>
+<p>The function \(f\), to be used in a quantum computer, must be specified by an oracle circuit \(U_{f}\) such that \(U_{f} \lvert x \rangle = (-1)^{f(x)}\lvert x \rangle\).</p>
 <a class="header" href="algorithms/deutsch-jozsa.html#the-algorithm" id="the-algorithm"><h2>The Algorithm</h2></a>
 <ol>
 <li>Initialize \(n\) qubits in the state \(\lvert 0, \dots, 0\rangle\).</li>

book/print.html

@@ -444,7 +444,7 @@ fn main() {
 <p>The Deutsch-Jozsa problem is to find whether \(f\) is <em>constant</em> or <em>balanced</em>, in as few function evaluations as possible.</p>
 <p>Using classical computing, in the worst case, this requires \(2^{n-1}+1\) function evaluations.
 Using quantum computing, this can be done with just one function evaluation.</p>
-<p>The function \(f\), to be used in a quantum computer, must be specified specified by an oracle circuit \(U_{f}\) such that \(U_{f} \lvert x \rangle = (-1)^{f(x)}\lvert x \rangle\).</p>
+<p>The function \(f\), to be used in a quantum computer, must be specified by an oracle circuit \(U_{f}\) such that \(U_{f} \lvert x \rangle = (-1)^{f(x)}\lvert x \rangle\).</p>
 <a class="header" href="print.html#the-algorithm-1" id="the-algorithm-1"><h2>The Algorithm</h2></a>
 <ol>
 <li>Initialize \(n\) qubits in the state \(\lvert 0, \dots, 0\rangle\).</li>