Fixed math rendering in Simon's problem

notebooks/v2/algorithms/01.query-algorithms/quantum-query-algorithms.ipynb

@@ -1291,8 +1291,7 @@
     "\n",
     "> **Simon's problem** \\\n",
     "> Input: a function $f:\\Sigma^n \\rightarrow \\Sigma^m$ \\\n",
-    "> Promise: there exists a string $s\\in\\Sigma^n$ such that $[f(x) = f(y)] \\Leftrightarrow \n",
-    "[(x = y) \\vee (x \\oplus s = y)]$ for all $x,y\\in\\Sigma^n$ \\\n",
+    "> Promise: there exists a string $s\\in\\Sigma^n$ such that $[f(x) = f(y)] \\Leftrightarrow [(x = y) \\vee (x \\oplus s = y)]$ for all $x,y\\in\\Sigma^n$ \\\n",
     "> Output: the string $s$\n",
     "\n",
     "We'll unpack the promise to better understand what says momentarily, but before doing this let's be clear that most functions don't satisfy this promise; it requires that $f$ has a very special structure.\n",