diff --git a/docs/tutorials/shors-algorithm.ipynb b/docs/tutorials/shors-algorithm.ipynb
index 6cbc424bf6a..ffddf3f9b4a 100644
--- a/docs/tutorials/shors-algorithm.ipynb
+++ b/docs/tutorials/shors-algorithm.ipynb
@@ -21,6 +21,18 @@
     "\n",
     "*Usage estimate: Three seconds on an Eagle r3 processor (NOTE: This is an estimate only. Your runtime might vary.)*\n",
     "\n",
+    "## Learning outcomes\n",
+    "After going through this tutorial, users should understand:\n",
+    "- The mathematical background of Shor's algorithm for integer factorization\n",
+    "- How to run an example instance of this algorithm on hardware\n",
+    "\n",
+    "## Prerequisites\n",
+    "We suggest that users are familiar with the following topics before going through this tutorial:\n",
+    "- [Fundamentals of quantum algorithms](https://quantum.cloud.ibm.com/learning/en/courses/fundamentals-of-quantum-algorithms).\n",
+    "- [Phase estimation and factoring](https://quantum.cloud.ibm.com/learning/en/courses/fundamentals-of-quantum-algorithms/phase-estimation-and-factoring/introduction). We cover some of this material in this tutorial.\n",
+    "\n",
+    "## Background\n",
+    "\n",
     "[Shor's algorithm,](https://epubs.siam.org/doi/abs/10.1137/S0036144598347011) developed by Peter Shor in 1994, is a groundbreaking quantum algorithm for factoring integers in polynomial time. Its significance lies in its ability to factor large integers exponentially faster than any known classical algorithm, threatening the security of widely used cryptographic systems like RSA, which rely on the difficulty of factoring large numbers. By efficiently solving this problem on a sufficiently powerful quantum computer, Shor's algorithm could revolutionize fields such as cryptography, cybersecurity, and computational mathematics, underscoring the transformative power of quantum computation.\n",
     "\n",
     "\n",