fix spelling issues found by spellcheck (Qiskit#872)

docs/api/migration-guides/qiskit-1.0-features.mdx

@@ -261,7 +261,7 @@ These differences are dictated by the base class, but are shown in the following
 implementations found in `qiskit.primitives`:
 
 <Admonition type="note">
-For the following examples, assume the following imports and primitive intializations:
+For the following examples, assume the following imports and primitive initializations:
 
 ```python
 from qiskit.primitives import (

docs/api/migration-guides/qiskit-1.0-installation.mdx

@@ -201,7 +201,7 @@ To upgrade an environment in situ, follow these steps:
   ```
 
   At this point, the environment's `site-packages` should not contain a `qiskit` directory. You don't need to verify this on every CI run, but if you are debugging a script locally, follow these steps to verify: 
-  1. Run the follwing command from within the `python` of the virtual environment:
+  1. Run the following command from within the `python` of the virtual environment:
 
     ```python
     import site

docs/api/migration-guides/qiskit-algorithms-module.mdx

@@ -65,7 +65,7 @@ There have been three types of refactoring:
  - [Phase Estimators](#phase-estimators)
 
 3. Algorithms that were deprecated and are now removed entirely from [`qiskit.algorithms`](../qiskit/0.46/algorithms). These are algorithms that do not serve
-   as building blocks for applications and are only valueable for education, as described in the following tutorials: 
+   as building blocks for applications and are only valuable for education, as described in the following tutorials: 
 
  - [Linear Solvers (HHL)](https://github.com/Qiskit/textbook/blob/main/notebooks/ch-applications/hhl_tutorial.ipynb) ,
  - [Factorizers (Shor)](https://github.com/Qiskit/textbook/blob/main/notebooks/ch-algorithms/shor.ipynb)

docs/api/migration-guides/qiskit-quantum-instance.mdx

@@ -74,7 +74,7 @@ yourself two questions:
 
 1. What is the minimal unit of information used by your algorithm?
     * If it uses an expectation value, you need an `Estimator`.
-    * If it uses a probability distribution (from sampleing the devicd), you need a `Sampler`
+    * If it uses a probability distribution (from sampling the device), you need a `Sampler`
 
 2. How do you want to run your circuits?
 

docs/transpile/representing_quantum_computers.mdx

@@ -6,7 +6,7 @@ description: Learn about coupling maps, basis gates and system errors for transp
 
 # Represent quantum computers
 
-To construct an equivalent circuit that can run on a specific system, the transpiler needs certain details about the system.  Typically, this information is found in the `backend` or `target = backend.target` class, so you don't need to pass anything further to the transpiler. However, if more infomation is provided, the transpiler can use it to try to produce the best circuit to run on that hardware.  
+To construct an equivalent circuit that can run on a specific system, the transpiler needs certain details about the system.  Typically, this information is found in the `backend` or `target = backend.target` class, so you don't need to pass anything further to the transpiler. However, if more information is provided, the transpiler can use it to try to produce the best circuit to run on that hardware.  
 
 <Admonition type="note">
 Because many of the underlying transpilation algorithms are stochastic, there is no guarantee that a better circuit will be found. 
@@ -52,7 +52,7 @@ Providing the `backend` properties, including the gates' error rates, allows the
 
 ## Coupling map
 
-The coupling map is a graph that shows which qubits are connected and hence have two-qubit gates between them. Sometimes this graph is directional, meaning that the two-qubit gates can only go in one direction. However, the transpiler can always flip a gate's direction by adding additional single-qubit gates. An abstract quantum circuit can always be represented on this graph, even if its connectivity is limited, by introducting SWAP gates to move the quantum information around. 
+The coupling map is a graph that shows which qubits are connected and hence have two-qubit gates between them. Sometimes this graph is directional, meaning that the two-qubit gates can only go in one direction. However, the transpiler can always flip a gate's direction by adding additional single-qubit gates. An abstract quantum circuit can always be represented on this graph, even if its connectivity is limited, by introducing SWAP gates to move the quantum information around. 
 
 The qubits from our abstract circuits are called _virtual qubits_ and those on the coupling map are _physical qubits_. The transpiler provides a mapping between virtual and physical qubits. One of the first steps in transpilation, the _routing_ stage, performs this mapping.
 

docs/transpile/set-optimization.mdx

@@ -38,7 +38,7 @@ Because finding the best layout is an NP-hard problem, it is the most time-consu
       <Td>
         Light optimization (default):
         -   Layout/Routing: Layout is first attempted with `TrivialLayout`. If additional SWAPs are required, a layout with a minimum number of SWAPs is found by using `SabreSWAP`, then it uses `VF2LayoutPostLayout` to try to select the best qubits in the graph.
-        -   InverseCancellelation
+        -   `InverseCancellation`
         -   1Q gate optimization
       </Td>
     </Tr>
@@ -48,7 +48,7 @@ Because finding the best layout is an NP-hard problem, it is the most time-consu
         Medium optimization:
           - Layout/Routing: Optimization level 1 (without trivial) + heuristic optimized with greater
         search depth and trials of optimization function.  Because `TrivialLayout` is not used, there is no attempt to use the same physical and virtual qubit numbers. 
-        -   Commutative cancelation
+        -   `CommutativeCancellation`
       </Td>
     </Tr>
     <Tr>