Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Tutorial housekeeping: Grovers #1531

Merged
merged 3 commits into from
Jun 12, 2024
Merged
Show file tree
Hide file tree
Changes from all commits
Commits
File filter

Filter by extension

Filter by extension

Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
Original file line number Diff line number Diff line change
Expand Up @@ -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",
Expand Down
2 changes: 1 addition & 1 deletion tutorials/chsh-inequality/chsh-inequality.ipynb
Original file line number Diff line number Diff line change
Expand Up @@ -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.)*"
]
},
{
Expand Down
8 changes: 5 additions & 3 deletions tutorials/grovers-algorithm/grovers.ipynb
Original file line number Diff line number Diff line change
Expand Up @@ -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."
Expand Down Expand Up @@ -272,7 +274,7 @@
"id": "97eb3019",
"metadata": {},
"source": [
"## Step 2: Optimize problem for quantum execution."
"## Step 2: Optimize problem for quantum execution"
]
},
{
Expand Down Expand Up @@ -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",
Expand All @@ -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"
]
},
{
Expand Down
2 changes: 1 addition & 1 deletion tutorials/repeat-until-success/repeat-until-success.ipynb
Original file line number Diff line number Diff line change
Expand Up @@ -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™ 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",
Expand Down
Loading