Update old Codebook links and mentions on pennylane.ai (#1138)

As described in Shortcut.

Note that this update does not include the following:
* tutorial_apply_qsvt (node not yet available)
* tutorial_fermionic_operators (node not yet available)
* tutorial_teleportation (node not yet available)

I have also fixed some language issues that I saw along the way.

demonstrations/tutorial_grovers_algorithm.metadata.json

@@ -6,7 +6,7 @@
         }
     ],
     "dateOfPublication": "2023-07-03T00:00:00+00:00",
-    "dateOfLastModification": "2024-01-01T00:00:00+00:00",
+    "dateOfLastModification": "2024-06-24T00:00:00+00:00",
     "categories": [
         "Getting Started", 
         "Algorithms", 

demonstrations/tutorial_grovers_algorithm.py

@@ -5,7 +5,7 @@
 ==================
 
 .. meta::
-    :property="og:description": Learn how to find an entry in a list using Grover's Algorithm 
+    :property="og:description": Learn how to find an entry in a list using Grover's algorithm 
     :property="og:image": https://pennylane.ai/qml/_static/demonstration_assets//thumbnail_tutorial_grovers_algorithm.png
 
 .. related::
@@ -15,7 +15,7 @@
 *Author: Ludmila Botelho. — Posted: 3 July 2023.*
 
 
-Grover's Algorithm is an `oracle <https://codebook.xanadu.ai/A.2>`__-based quantum
+`Grover's algorithm </codebook/#05-grovers-algorithm>`__ is an `oracle </codebook/04-basic-quantum-algorithms/02-the-magic-8-ball/>`__-based quantum
 algorithm, proposed by Lov Grover [#Grover1996]_. In the original description, the author approaches the
 following problem: suppose that we are searching for a specific phone number in a randomly-ordered
 catalogue containing :math:`N` entries. To find such a number with a probability of
@@ -31,12 +31,12 @@
 answer, whereas any classical algorithm would require :math:`O(N)` queries.
 
 In this tutorial, we are going to implement a search for an n-bit string item using a quantum
-circuit based on Grover's Algorithm.
+circuit based on Grover's algorithm.
 
 The algorithm can be broken down into the following steps:
 
 1. Prepare the initial state
-2. Implement the Oracle
+2. Implement the oracle
 3. Apply the Grover diffusion operator
 4. Repeat steps 2 and 3  approximately :math:`\frac{\pi}{4}\sqrt{N}` times
 5. Measure
@@ -240,8 +240,8 @@ def circuit():
 # Finally, the combination of :math:`U_{\omega}` with :math:`U_D` rotates the state
 # :math:`\vert s \rangle` by an angle of
 # :math:`\theta =2 \arcsin{\tfrac {1}{\sqrt {N}}}`. For more geometric insights
-# about the Oracle and the diffusion operator, please refer to this `codebook
-# section <https://codebook.xanadu.ai/G.2>`__.
+# about the oracle and the diffusion operator, please refer to this `PennyLane Codebook
+# section </codebook/04-basic-quantum-algorithms/02-the-magic-8-ball/>`__.
 #
 #
 # .. figure:: ../_static/demonstration_assets/grovers_algorithm/rotation.gif
@@ -307,7 +307,7 @@ def circuit():
 #
 # which is easily implemented using :class:`~.pennylane.GroverOperator`.
 #
-# Finally, we have all the tools to build the circuit for Grover's Algorithm, as we can see in the
+# Finally, we have all the tools to build the circuit for Grover's algorithm, as we can see in the
 # code below. For simplicity, we are going to search for the states
 # :math:`\vert 0\rangle ^{\otimes n}` and :math:`\vert 1\rangle ^{\otimes n}`, where
 # :math:`n = \log_2 N` is the number of qubits.
@@ -366,10 +366,10 @@ def circuit():
 #
 # Grover's algorithm in principle can be used to speed up more sophisticated computation, for
 # instance, when used as a subroutine for problems that require extensive search
-# and is the basis of a whole family of algorithms, such as the `Amplitude
-# amplification <https://codebook.xanadu.ai/G.1>`__ technique. 
+# and is the basis of a whole family of algorithms, such as the amplitude
+# amplification technique. 
 # 
-# If you would like to learn more about Grover's Algorithm, check out `this video <https://youtu.be/KeJqcnpPluc>`__! 
+# If you would like to learn more about Grover's algorithm, check out `this video <https://www.youtube.com/watch?v=EfUfwVnicP8>`__! 
 #
 #
 

demonstrations/tutorial_mcm_introduction.metadata.json

@@ -6,7 +6,7 @@
         }
     ],
     "dateOfPublication": "2024-05-10T00:00:00+00:00",
-    "dateOfLastModification": "2024-05-10T00:00:00+00:00",
+    "dateOfLastModification": "2024-06-21T00:00:00+00:00",
     "categories": [
         "Getting Started",
         "Quantum Computing"

demonstrations/tutorial_mcm_introduction.py

@@ -35,7 +35,7 @@
 # Given how fundamental those question are, there is a plethora of learning
 # resources on this topic, from textbooks [#mike_n_ike]_ and (video) lectures
 # [#feynman]_, [#zwiebach]_ to interactive studying material like
-# `the Xanadu Quantum Codebook <https://codebook.xanadu.ai/I.9>`__
+# `the PennyLane Codebook </codebook/>`__
 # or Ref. [#van_der_Sar]_.
 # Furthermore, discussing measurements quickly
 # leads to questions about the interpretation of quantum mechanics and philosophical,

demonstrations/tutorial_phase_kickback.metadata.json

@@ -6,7 +6,7 @@
         }
     ],
     "dateOfPublication": "2023-08-01T00:00:00+00:00",
-    "dateOfLastModification": "2024-01-01T00:00:00+00:00",
+    "dateOfLastModification": "2024-06-21T00:00:00+00:00",
     "categories": [
         "Getting Started",
         "Algorithms",

demonstrations/tutorial_phase_kickback.py

@@ -35,7 +35,7 @@
 #    :align: center
 #    :width: 50%
 #
-# If you want to know more about the details, do not hesitate to consult the node `[P.1] <https://codebook.xanadu.ai/P.1>`_ of the Xanadu Quantum Codebook.
+# If you want to know more about the details, do not hesitate to consult the node `[P.1] </codebook/09-quantum-phase-estimation/01-catch-the-phase/>`_ of the PennyLane Codebook.
 
 ######################################################################
 # Setting up PennyLane

demonstrations/tutorial_qft_arithmetics.metadata.json

@@ -6,7 +6,7 @@
         }
     ],
     "dateOfPublication": "2022-11-07T00:00:00+00:00",
-    "dateOfLastModification": "2024-01-01T00:00:00+00:00",
+    "dateOfLastModification": "2024-06-21T00:00:00+00:00",
     "categories": [
         "Getting Started", "Algorithms", "Quantum Computing"
     ],

demonstrations/tutorial_qft_arithmetics.py

@@ -24,7 +24,7 @@
 
 In this demo we will not focus on understanding how the QFT is built,
 as we can find a great explanation in the
-`Xanadu Quantum Codebook <https://codebook.xanadu.ai/F.1>`__. Instead, we will develop the
+`PennyLane Codebook </codebook/08-quantum-fourier-transform/01-changing-perspectives/>`__. Instead, we will develop the
 intuition for how it works and how we can best take advantage of it.
 
 Motivation