cr fix

Author: GazitLior1

algorithms/number_theory_and_cryptography/hidden_shift/hidden_shift.qmod

@@ -1,14 +1,13 @@
-// Hidden shift (bent Boolean functions) — simple demo instance
+// Hidden shift (bent Boolean functions)
 
 // This problem 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
+// 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.
 
 num_variables: int = 4;
 
 // define both functions:
-// f(x) = (x0 & x1) xor (x2 & x3)
 qperm bent_function(const vars: qbit[num_variables], res: qbit) {
   res ^= (vars[0] & vars[1]) ^ (vars[2] & vars[3]);
 }

algorithms/quantum_primitives/swap_test/swap_test.qmod

@@ -1,7 +1,7 @@
 // Swap Test (quantum primitive)
 
 // This example prepares two (fixed) quantum states |psi1> and |psi2>, then runs `swap_test`.
-// the measurement result (test) will 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.