Fix minor typos (#716)

<!--- This file has been generated from an external template. Please do
not modify it directly. -->
<!--- Changes should be contributed to
https://github.com/munich-quantum-toolkit/templates. -->

## Summary
Fix minor typos
- tehcniques -> techniques
- if give -> if given
- guarantueed -> guaranteed

Author: q-inho

python/mqt/qmap/clifford_synthesis.pyi

@@ -28,7 +28,7 @@ class Verbosity(Enum):
     verbose = ...
 
 class SynthesisConfiguration:
-    """Class representing the configuration for the Clifford synthesis tehcniques."""
+    """Class representing the configuration for the Clifford synthesis techniques."""
 
     dump_intermediate_results: bool
     gate_limit_factor: float

python/mqt/qmap/na/state_preparation.pyi

@@ -105,7 +105,7 @@ class NAStatePreparationSolver:
         stage, atoms can be stored from AOD into SLM traps and loaded from SLM traps
         into AOD. At the end of each stage, the atoms are shuttled to their next
         position. The number of stages is specified by `num_stages`. The number of
-        transfers is fixed by `num_transfers` if give. If this parameter is not
+        transfers is fixed by `num_transfers` if given. If this parameter is not
         specified, then the solver will determine the optimal number of transfers. The
         parameter `mind_ops_order` specifies whether the order of the operations in the
         circuit should be preserved. The parameter `shield_idle_qubits` specifies
@@ -116,7 +116,7 @@ class NAStatePreparationSolver:
             :func:`get_ops_for_solver`.
 
 
-            The returned solver's result can either directly exported to the JSON format
+            The returned solver's result can either be directly exported to the JSON format
             by calling the method :func:`json` on the result object or the result object
             can be passed to the function :func:`generate_code` to generate code
             consisting of neutral atom operations.

python/mqt/qmap/plugins/qiskit/sc/compile.py

@@ -86,7 +86,7 @@ def compile(  # noqa: A001
         iterative_bidirectional_routing_passes: Number of iterative bidirectional routing passes to perform or None to disable. Defaults to None.
         layering: The layering strategy to use. Defaults to :attr:`~Layering.individual_gates`.
         automatic_layer_splits_node_limit: The number of expanded nodes after which to split a layer or None to disable automatic layer splitting. Defaults to 5000.
-        early_termination: The early termination strategy to use, i.e. terminating the search after a goal node has been found, but before it is guarantueed to be optimal. Defaults to :attr:`~EarlyTermination.none`.
+        early_termination: The early termination strategy to use, i.e. terminating the search after a goal node has been found, but before it is guaranteed to be optimal. Defaults to :attr:`~EarlyTermination.none`.
         early_termination_limit: The number of nodes (counted according to the early termination strategy) after which to terminate the search early. Defaults to 0.
         lookahead_heuristic: The heuristic function to use as a lookahead penalty during search or None to disable lookahead. Defaults to :attr:`~LookaheadHeuristic.gate_count_max_distance`.
         lookaheads: The number of lookaheads to be used or None if no lookahead should be used. Defaults to 15.