diff --git a/demonstrations/tutorial_clifford_circuit_simulations.metadata.json b/demonstrations/tutorial_clifford_circuit_simulations.metadata.json
index f46c5c790d..f82ceca145 100644
--- a/demonstrations/tutorial_clifford_circuit_simulations.metadata.json
+++ b/demonstrations/tutorial_clifford_circuit_simulations.metadata.json
@@ -6,7 +6,7 @@
         }
     ],
     "dateOfPublication": "2024-04-12T00:00:00+00:00",
-    "dateOfLastModification": "2024-11-14T00:00:00+00:00",
+    "dateOfLastModification": "2025-05-02T00:00:00+00:00",
     "categories": [
         "Devices and Performance"
     ],
diff --git a/demonstrations/tutorial_clifford_circuit_simulations.py b/demonstrations/tutorial_clifford_circuit_simulations.py
index acc2402425..0f7edfb438 100644
--- a/demonstrations/tutorial_clifford_circuit_simulations.py
+++ b/demonstrations/tutorial_clifford_circuit_simulations.py
@@ -22,7 +22,7 @@
 ``{AND, NOT, OR}`` that can be used to perform any boolean function. A similar analogue
 in quantum computation is to have a set of quantum gates that can approximate any unitary
 transformation up to the desired accuracy. One such universal quantum gate set is the
-:math:`\textrm{Clifford + T}` set, ``{H, S, CNOT, T}``, where the gates ``H``, ``S`,` and
+:math:`\textrm{Clifford + T}` set, ``{H, S, CNOT, T}``, where the gates ``H``, ``S``, and
 ``CNOT`` are the generators of the *Clifford group*. The elements of this group are
 called *Clifford gates*, which transform *Pauli* words to *Pauli* words under
 `conjugation <https://mathworld.wolfram.com/Conjugation.html>`__. This means an