Fix miscellaneous typos in various files

docs/_index.yaml

@@ -55,7 +55,7 @@ landing_page:
         qubits = [cirq.GridQubit(i,j) for i in range(5) for j in range(5)]
 
         # Define a circuit to run
-        # (Example is from the 2019 "Quantum Supremacy" experiement)
+        # (Example is from the 2019 "Quantum Supremacy" experiment)
         circuit = (cirq.experiments.
             random_rotations_between_grid_interaction_layers_circuit(
             qubits=qubits, depth=16))

docs/choose_hw.md

@@ -65,8 +65,8 @@ noisy simulation, using a phase damping channel (p=0.01). The charts use a log
 scale. These benchmarks were all performed using qsim's native GPU and CPU
 backends and do not involve sampling bitstrings (i.e. no measure gates).
 
-![qsim runtime comparison on multipe processors: noiseless](images/qsim_runtime_comparison_noiseless.png)
-![qsim runtime comparison on multipe processors: noisy](images/qsim_runtime_comparison_noisy.png)
+![qsim runtime comparison on multiple processors: noiseless](images/qsim_runtime_comparison_noiseless.png)
+![qsim runtime comparison on multiple processors: noisy](images/qsim_runtime_comparison_noisy.png)
 
 ### 4. If using GPUs, select a backend
 

docs/tutorials/gcp_cpu.md

@@ -120,7 +120,7 @@ and run your code.
       When your connection is ready, Colab displays a green checkmark beside the
       Connected (Local) drop-down menu.
 
-      <img src="../images/colab_connected.png" alt="Google Colab Local Runtime connection windo" style="width: 62%" class="screenshot">
+      <img src="../images/colab_connected.png" alt="Google Colab Local Runtime connection window" style="width: 62%" class="screenshot">
 
       The code cells in your notebook now execute on your VM instead of your local
       computer.

docs/tutorials/qsimcirq_gcp.md

@@ -63,7 +63,7 @@ To create the VM use the steps in sequence below:
       [make a different choice](https://cloud.google.com/compute/docs/regions-zones#available).
 *   Choose the machine family / series: N2
     * Quantum simulation requires powerful processors—the N2, N1, or C2 will work.
-    * But if you have your own prefences, other
+    * But if you have your own preferences, other
       [machine types](https://cloud.google.com/blog/products/compute/choose-the-right-google-compute-engine-machine-type-for-you)
       are available.
 

jupyter/README.md

@@ -1,5 +1,5 @@
 # Docker container for Jupyter with _Cirq_ and _qsim_
 
-You can build this container with the standard build commmand.
+You can build this container with the standard build command.
 
 More details on how to use this container can be found [here](../docs/tutorials/qsimcirq_gcp.md).

lib/channels_cirq.h

@@ -453,7 +453,7 @@ inline BitFlipChannel<fp_type> bit_flip(double p) {
   return BitFlipChannel<fp_type>(p);
 }
 
-}  // namesapce Cirq
+}  // namespace Cirq
 
 }  // namespace qsim
 

lib/fuser_mqubit.h

@@ -40,7 +40,7 @@ class MultiQubitGateFuser final : public Fuser<IO> {
  private:
   using Base = Fuser<IO>;
 
-  // Auxillary classes and structs.
+  // Auxiliary classes and structs.
 
   // Manages doubly-linked lists.
   template <typename T>
@@ -102,7 +102,7 @@ class MultiQubitGateFuser final : public Fuser<IO> {
   };
 
   // Possible values for visited in GateF.
-  // Note that MakeGateSequence assignes values from kSecond to the number of
+  // Note that MakeGateSequence assigns values from kSecond to the number of
   // gates in the sequence plus one, see below.
   enum Visited {
     kZero = 0,              // Start value for matrix gates.
@@ -310,7 +310,7 @@ class MultiQubitGateFuser final : public Fuser<IO> {
 
     LinkManager<Operation, PGate> link_manager(max_qubit1 * num_ops);
 
-    // Auxillary data structures.
+    // Auxiliary data structures.
     // Sequence of intermediate fused gates.
     std::vector<GateF> gates_seq;
     // Gate "lattice".
@@ -365,7 +365,7 @@ class MultiQubitGateFuser final : public Fuser<IO> {
           return fused_ops;
         }
 
-        // Fill in auxillary data structures.
+        // Fill in auxiliary data structures.
 
         if (OpGetAlternative<Measurement>(op)) {
           // Measurement gate.
@@ -1247,3 +1247,4 @@ class MultiQubitGateFuser final : public Fuser<IO> {
 }  // namespace qsim
 
 #endif  // FUSER_MQUBIT_H_
+

lib/gates_cirq.h

@@ -1631,7 +1631,7 @@ inline schmidt_decomp_type<fp_type> GetSchmidtDecomp(
   }
 }
 
-}  // namesapce Cirq
+}  // namespace Cirq
 
 }  // namespace qsim
 

lib/hybrid.h

@@ -164,7 +164,7 @@ struct HybridSimulator final {
     for (const auto& op : ops) {
       if (!OpGetAlternative<Gate>(op)) {
         IO::errorf("measurement, controlled or other non-matrix gates "
-                   "are not suported by qsimh.\n");
+                   "are not supported by qsimh.\n");
         return false;
       }
 
@@ -218,7 +218,7 @@ struct HybridSimulator final {
         }
         break;
       default:
-        IO::errorf("multi-qubit gates are not suported by qsimh.\n");
+        IO::errorf("multi-qubit gates are not supported by qsimh.\n");
         return false;
       }
     }

lib/multiprocess_custatevecex.h

@@ -134,7 +134,7 @@ struct MultiProcessCuStateVecEx {
     }
 
     if (num_acc_global_qubits < num_global_qubits_) {
-      IO::errorf("erorr: too few network layers at %s %d.\n",
+      IO::errorf("error: too few network layers at %s %d.\n",
                  __FILE__, __LINE__);
       exit(1);
     }

lib/operation_base.h

@@ -172,7 +172,7 @@ const T* OpGetAlternative(const Operation& op) {
 /**
  * Recursively retrieves the time step from a (nested) variant.
  * This function traverses the provided `op` (concrete type, pointer,
- * or variant) to access the `time` memeber in the underlying `BaseOperation`.
+ * or variant) to access the `time` member in the underlying `BaseOperation`.
  * This function handles recursive `std::variant` structures and can
  * transparently dereference pointers (e.g., `std::variant<A, const B*>`
  * or `std::variant<A, B*>`) to find the target value.
@@ -208,7 +208,7 @@ inline unsigned OpTime(const Operation& op) {
 /**
  * Recursively retrieves the qubit indices from a (nested) variant.
  * This function traverses the provided `op` (concrete type, pointer,
- * or variant) to access the `qubits` memeber in the underlying `BaseOperation`.
+ * or variant) to access the `qubits` member in the underlying `BaseOperation`.
  * This function handles recursive `std::variant` structures and can
  * transparently dereference pointers (e.g., `std::variant<A, const B*>`
  * or `std::variant<A, B*>`) to find the target value.

lib/qtrajectory.h

@@ -68,7 +68,7 @@ class QuantumTrajectorySimulator {
      * of circuits with weak noise and without measurements by reusing
      * the primary trajectory results. There is an additional condition for
      * RunBatch. In this case, the deferred operators after the main loop are
-     * still applied for the first occurence of the primary trajectory.
+     * still applied for the first occurrence of the primary trajectory.
      * The primary Kraus operators should have the highest sampling
      * probabilities to achieve the highest speedup.
      *
@@ -361,7 +361,7 @@ class QuantumTrajectorySimulator {
         if (r < cp || i == channel.kops.size() - 1) {
           // Sample ith Kraus operator if r < cp
           // Sample the highest probability Kraus operator if r is greater
-          // than the sum of all probablities due to round-off errors.
+          // than the sum of all probabilities due to round-off errors.
           uint64_t k = r < cp ? i : max_prob_index;
 
           DeferOps(channel.kops[k].ops, deferred_ops);

lib/simulator.h

@@ -26,7 +26,7 @@ namespace qsim {
  */
 class SimulatorBase {
  protected:
-  // The follwoing template parameters are used for functions below.
+  // The following template parameters are used for functions below.
   // H - the number of high (target) qubits.
   // L - the number of low (target) qubits.
   // R - SIMD register width in floats.

lib/statespace_cuda.h

@@ -36,7 +36,7 @@ namespace qsim {
 /**
  * Object containing context and routines for CUDA state-vector manipulations.
  * State is a vectorized sequence of 32 real components followed by 32
- * imaginary components. 32 floating numbers can be proccessed in parallel by
+ * imaginary components. 32 floating numbers can be processed in parallel by
  * a single warp. It is not recommended to use `GetAmpl` and `SetAmpl`.
  */
 template <typename FP = float>

tests/unitaryspace_avx512_test.cc

@@ -37,7 +37,7 @@ TEST(UnitarySpaceAVX512Test, GetEntry) {
   TestSetEntry<UnitarySpaceAVX512<For>>();
 }
 
-}  // namspace
+}  // namespace
 }  // namespace unitary
 }  // namespace qsim
 

tests/unitaryspace_avx_test.cc

@@ -36,7 +36,7 @@ TEST(UnitarySpaceAVXTest, GetEntry) {
   TestSetEntry<UnitarySpaceAVX<For>>();
 }
 
-}  // namspace
+}  // namespace
 }  // namespace unitary
 }  // namespace qsim
 

tests/unitaryspace_basic_test.cc

@@ -36,7 +36,7 @@ TEST(UnitarySpaceBasicTest, GetEntry) {
   TestSetEntry<UnitarySpaceBasic<For, float>>();
 }
 
-}  // namspace
+}  // namespace
 }  // namespace unitary
 }  // namespace qsim
 

tests/unitaryspace_sse_test.cc

@@ -36,7 +36,7 @@ TEST(UnitarySpaceSSETest, GetEntry) {
   TestSetEntry<UnitarySpaceSSE<For>>();
 }
 
-}  // namspace
+}  // namespace
 }  // namespace unitary
 }  // namespace qsim