From c67564b2345a5e99e9b39e57feeccd461ba0c8cf Mon Sep 17 00:00:00 2001
From: Vincent van Wingerden <25651976+vivanwin@users.noreply.github.com>
Date: Thu, 2 May 2024 14:38:57 +0200
Subject: [PATCH] Update part5_grover.ipynb

---
 tutorials/getting_started/part5_grover.ipynb | 10 +++++-----
 1 file changed, 5 insertions(+), 5 deletions(-)

diff --git a/tutorials/getting_started/part5_grover.ipynb b/tutorials/getting_started/part5_grover.ipynb
index 75506634..e80b8bea 100644
--- a/tutorials/getting_started/part5_grover.ipynb
+++ b/tutorials/getting_started/part5_grover.ipynb
@@ -300,7 +300,7 @@
     "\n",
     "Create it in multiple steps:\n",
     "\n",
-    "1. Create a new `qfunc` called `my_grover_search(a: QInt, b: QInt)`\n",
+    "1. Create a new `qfunc` called `my_grover_search(a: QNum, b: QNum)`\n",
     "2. Add the `my_oracle()` and `my_diffuser()` to the new function\n",
     "3. In the main function, add a `repeat()` that will call the newly created function 2 times\n",
     "4. validate everything works by executing the algorithm again in the IDE\n"
@@ -314,8 +314,8 @@
    "source": [
     "@qfunc\n",
     "def main(\n",
-    "    # a: Output[QInt],\n",
-    "    # b: Output[QInt]\n",
+    "    # a: Output[QNum],\n",
+    "    # b: Output[QNum]\n",
     "):\n",
     "    # Your code here\n",
     "    pass\n",
@@ -397,8 +397,8 @@
     "Apply an operation to each qubit in an array\n",
     "- ```\n",
     "   repeat(\n",
-    "    count= QParam[int],\n",
-    "    iteration= QCallable[QParam[int]],\n",
+    "    count= CInt,\n",
+    "    iteration= QCallable[CInt],\n",
     "   )\n",
     "   ```"
    ]