Tutorial housekeeping: Grovers (#1531)

Qiskit · Jun 12, 2024 · 2a2ffc7 · 2a2ffc7
1 parent dd72765
commit 2a2ffc7
Show file tree

Hide file tree

Showing 4 changed files with 8 additions and 6 deletions.
diff --git a/tutorials/build-repetition-codes/build-repetition-codes.ipynb b/tutorials/build-repetition-codes/build-repetition-codes.ipynb
@@ -12,7 +12,7 @@
    "source": [
     "# Build repetition codes\n",
     "\n",
-    "*QPU time estimate: 2 seconds on ibm_algiers. (NOTE: This is an estimate only. Your runtime may vary.)*\n",
+    "*Usage estimate: 2 seconds on ibm_algiers. (NOTE: This is an estimate only. Your runtime may vary.)*\n",
     "\n",
     "## Background\n",
     "\n",

diff --git a/tutorials/chsh-inequality/chsh-inequality.ipynb b/tutorials/chsh-inequality/chsh-inequality.ipynb
@@ -13,7 +13,7 @@
    "id": "6b41d6b3",
    "metadata": {},
    "source": [
-    "*QPU time estimate: 4 minutes, 40 seconds  on ibm_kyiv. (NOTE: This is an estimate only. Your runtime may vary.)*"
+    "*Usage estimate: 4 minutes, 40 seconds  on ibm_kyiv. (NOTE: This is an estimate only. Your runtime may vary.)*"
    ]
   },
   {

diff --git a/tutorials/grovers-algorithm/grovers.ipynb b/tutorials/grovers-algorithm/grovers.ipynb
@@ -8,6 +8,8 @@
    "source": [
     "## Background\n",
     "\n",
+    "*Usage estimate: 4 seconds  on ibm_nairobi. (NOTE: This is an estimate only. Your runtime may vary.)*\n",
+    "\n",
     "Amplitude amplification is a general purpose quantum algorithm, or subroutine, that can be used to obtain a quadratic speedup over a handful of classical algorithms. [Grover’s algorithm](https://arxiv.org/abs/quant-ph/9605043) was the first to demonstrate this speedup on unstructured search problems. Formulating a Grover's search problem requires an oracle function that marks one or more computational basis states as the states we are interested in finding, and an amplification circuit that increases the amplitude of marked states, consequently suppressing the remaining states.\n",
     "\n",
     "Here, we demonstrate how to construct Grover oracles and use the `GroverOperator` from the Qiskit circuit library to easily set up a Grover's search instance. The runtime `Sampler` primitive allows seamless execution of Grover circuits."
@@ -272,7 +274,7 @@
    "id": "97eb3019",
    "metadata": {},
    "source": [
-    "## Step 2: Optimize problem for quantum execution."
+    "## Step 2: Optimize problem for quantum execution"
    ]
   },
   {
@@ -311,7 +313,7 @@
    "id": "c5edec73",
    "metadata": {},
    "source": [
-    "## Step 3: Execute using Qiskit Primitives.\n",
+    "## Step 3: Execute using Qiskit Primitives\n",
     "\n",
     "Amplitude amplification is a sampling problem that is suitable for execution with the [`Sampler`](https://docs.quantum-computing.ibm.com/api/qiskit-ibm-runtime/qiskit_ibm_runtime.SamplerV2) runtime primitive.\n",
     "\n",
@@ -338,7 +340,7 @@
    "id": "87484abf",
    "metadata": {},
    "source": [
-    "## Step 4: Post-process, return result in classical format."
+    "## Step 4: Post-process, return result in classical format"
    ]
   },
   {

diff --git a/tutorials/repeat-until-success/repeat-until-success.ipynb b/tutorials/repeat-until-success/repeat-until-success.ipynb
@@ -12,7 +12,7 @@
     "\n",
     "## Background\n",
     "\n",
-    "*QPU time estimate: 4 seconds  on ibm_canberra. (NOTE: This is an estimate only. Your runtime may vary.)*\n",
+    "*Usage estimate: 4 seconds  on ibm_canberra. (NOTE: This is an estimate only. Your runtime may vary.)*\n",
     "\n",
     "This tutorial demonstrates how certain IBM Quantum&trade; systems (those that support dynamic circuits) use mid-circuit measurements to produce a circuit that repeatedly attempts its setup until a syndrome measurement reveals that it has been successful.\n",
     "\n",