Small fix for a recent Demo (#1285)

CC @justinpickering , as discussed

---------

Co-authored-by: qottmann <[email protected]>

Author: ikurecic

demonstrations/tutorial_fixed_depth_hamiltonian_simulation_via_cartan_decomposition.metadata.json

@@ -6,7 +6,7 @@
         }
     ],
     "dateOfPublication": "2024-12-19T00:00:00+00:00",
-    "dateOfLastModification": "2024-12-19T00:00:00+00:00",
+    "dateOfLastModification": "2024-12-20T00:00:00+00:00",
     "categories": [
         "Quantum Computing",
         "Algorithms"

demonstrations/tutorial_fixed_depth_hamiltonian_simulation_via_cartan_decomposition.py

@@ -113,7 +113,6 @@
 # It essentially counts whether the number of non-identity Pauli operators in the Pauli word is even or odd.
 
 def even_odd_involution(op):
-    """Generalization of EvenOdd to sums of Paulis"""
     [pw] = op.pauli_rep
     return len(pw) % 2
 
@@ -433,7 +432,7 @@ def trace_distance(A, B):
 # Time evolutions
 # ---------------
 # 
-# We compute multiple time evolutions for different times and compare Suzuki—Trotter products with the KAK decomposition circuit.
+# We compute multiple time evolutions for different times and compare Suzuki–Trotter products with the KAK decomposition circuit.
 #
 
 ts = jnp.linspace(1., 5., 10)
@@ -468,7 +467,7 @@ def compute_res(Us):
 
 
 ##############################################################################
-# We see the expected behavior of Suzuki—Trotter product formulas getting worse with an increase in time
+# We see the expected behavior of Suzuki–Trotter product formulas getting worse with an increase in time
 # while the KAK error is constant zero.
 #
 # The KAK decomposition is particularly well-suited for smaller systems as the circuit depth is equal to the