fix comments after cr

Author: GazitLior1

algorithms/foundational/simon/simon.qmod

@@ -1,6 +1,6 @@
-// Simon algorithm with a minimal oracle example
+// Simon Algorithm with a Minimal Oracle Example
 
-// This program prepare an input superposition and applies a Simon function.
+// This example prepares an input superposition and applies a Simon function.
 // We focus only on the quantum wrapper and a very simple oracle,
 // without classical postprocessing or full secret recovery.
 

algorithms/number_theory_and_cryptography/discrete_log/discrete_log.qmod

@@ -1,9 +1,9 @@
-// Discrete logarithmic problem using Shor's Algorithm
+// Discrete Logarithmic Problem Using Shor's Algorithm
 
-// This example implements the quantum part of a discrete logarithm solver
-// We start by preparing a uniform superposition over `alpha` and `beta`
-// then evaluating the oracle and applying inverse QFT to extract phase information
-// where the exponent is encoded in the power of `pw`
+// This example implements the quantum part of a discrete logarithm solver.
+// We start by preparing a uniform superposition over `alpha` and `beta`,
+// then evaluating the oracle and applying inverse QFT to extract phase information,
+// where the exponent is encoded in the power of `pw`.
 
 qfunc modular_exponentiation(N: int, a: int, x: qbit[], pw: qbit[]) {
   repeat (index: pw.len) {
@@ -20,12 +20,6 @@ qfunc discrete_log_oracle(g_generator: int, x_element: int, N_modulus: int, alph
   modular_exponentiation(N_modulus, g_generator, func_res, beta);
 }
 
-// problem parameters
-generator: int = 7;
-target: int = 3;
-modulus: int = 13;
-order: int = 12;
-reg_len: int = ceiling(log(order, 2)) + 1;
 
 // Compute `discrete_log_oracle` on the `func_res` variable. `func_res` is of size log(N)
 qfunc discrete_log(generator: int, target: int, modulus: int, order: int, output alpha: qnum, output beta: qnum, output func_res: qnum) {
@@ -42,6 +36,13 @@ qfunc discrete_log(generator: int, target: int, modulus: int, order: int, output
   }
 }
 
+// problem parameters
+generator: int = 7;
+target: int = 3;
+modulus: int = 13;
+order: int = 12;
+reg_len: int = ceiling(log(order, 2)) + 1;
+
 qfunc main(output alpha: qnum, output beta: qnum, output func_res: qnum) {
   discrete_log(generator, target, modulus, order, alpha, beta, func_res);
 }

algorithms/number_theory_and_cryptography/hidden_shift/hidden_shift.qmod

@@ -1,6 +1,6 @@
 // Hidden shift (bent Boolean functions)
 
-// This problem describes how to find the hidden shift s, given two functions:
+// This example describes how to find the hidden shift s, given two functions:
 // a bent function f(x) and its shifted version g(x) = f(x xor s).
 // The functions are represented as quantum oracles that apply a phase flip.
 // A bent function is a special kind of Boolean function with maximum distance from all linear functions.

algorithms/number_theory_and_cryptography/shor/shor.qmod

@@ -1,9 +1,9 @@
 // Shor's Factoring Algorithm
 
 // Performs `Shor's factorization algorithm on a given integer N.
-// The core part of Shor's algorithm, is the period finding of the function f(x) = a^x mod N
+// The core part of Shor's algorithm, is the period finding of the function f(x) = a^x mod N.
 // This can be done using Quantum phase estimation (QPE) algorithm.
-// We work with the `qpe_flexible` function, that allows to pass a unitary with a specified powered operation
+// We work with the `qpe_flexible` function, that allows to pass a unitary with a specified powered operation.
 
 qfunc period_finding(n: int, a: int, x: qnum, phase_var: qnum) {
   x ^= 1;

algorithms/quantum_primitives/swap_test/swap_test.qmod

@@ -1,9 +1,9 @@
 // Swap Test (quantum primitive)
 
 // This example prepares two (fixed) quantum states |psi1> and |psi2>, then runs `swap_test`.
-// the measurement result (test) gives:
+// The measurement result (test) gives:
 // P(test = |0>) = 1/2 * (1 + |<psi1|psi2>|^2)
-// Meaning that higher probability of |0> is a higher overlap between the states.
+// Higher probability of |0> is a higher overlap between the states.
 
 error_bound: real = 0.0;
 psi1_amplitudes: real[] = [0.41, -0.17, 0.30, 0.04, 0.55, -0.34, -0.33, 0.54];