From b3000cb3a4f10f99d260f487c21792cc1b9a0ab1 Mon Sep 17 00:00:00 2001
From: Matthew Harrigan <mpharrigan@google.com>
Date: Wed, 2 Oct 2024 20:10:37 +0000
Subject: [PATCH] et. al. -> et al. (#1431)

---
 qualtran/Autodoc.ipynb                                      | 4 ++--
 qualtran/bloqs/arithmetic/addition.ipynb                    | 2 +-
 qualtran/bloqs/arithmetic/addition.py                       | 2 +-
 qualtran/bloqs/arithmetic/controlled_add_or_subtract.ipynb  | 2 +-
 qualtran/bloqs/arithmetic/controlled_add_or_subtract.py     | 2 +-
 qualtran/bloqs/basic_gates/swap.ipynb                       | 2 +-
 qualtran/bloqs/basic_gates/swap.py                          | 2 +-
 qualtran/bloqs/basic_gates/t_gate.ipynb                     | 2 +-
 qualtran/bloqs/basic_gates/t_gate.py                        | 2 +-
 .../bloqs/chemistry/hubbard_model/qubitization/__init__.py  | 2 +-
 .../hubbard_model/qubitization/hubbard_model.ipynb          | 2 +-
 qualtran/bloqs/chemistry/ising/walk_operator.py             | 4 ++--
 qualtran/bloqs/chemistry/thc/select_bloq.py                 | 2 +-
 qualtran/bloqs/data_loading/qroam_clean.ipynb               | 2 +-
 qualtran/bloqs/data_loading/qroam_clean.py                  | 4 ++--
 qualtran/bloqs/data_loading/qrom.ipynb                      | 4 ++--
 qualtran/bloqs/data_loading/qrom.py                         | 4 ++--
 qualtran/bloqs/data_loading/select_swap_qrom.ipynb          | 2 +-
 qualtran/bloqs/data_loading/select_swap_qrom.py             | 2 +-
 qualtran/bloqs/factoring/ecc/ec_add_r.py                    | 2 +-
 qualtran/bloqs/factoring/ecc/ecc.ipynb                      | 2 +-
 qualtran/bloqs/mcmt/and_bloq.ipynb                          | 2 +-
 qualtran/bloqs/mcmt/and_bloq.py                             | 2 +-
 qualtran/bloqs/mcmt/ctrl_spec_and.ipynb                     | 2 +-
 qualtran/bloqs/mcmt/ctrl_spec_and.py                        | 2 +-
 qualtran/bloqs/multiplexers/apply_gate_to_lth_target.ipynb  | 2 +-
 qualtran/bloqs/multiplexers/apply_gate_to_lth_target.py     | 2 +-
 qualtran/bloqs/multiplexers/apply_lth_bloq.ipynb            | 2 +-
 qualtran/bloqs/multiplexers/apply_lth_bloq.py               | 2 +-
 qualtran/bloqs/multiplexers/unary_iteration_bloq.py         | 2 +-
 qualtran/bloqs/phase_estimation/kaiser_window_state.ipynb   | 2 +-
 qualtran/bloqs/phase_estimation/kaiser_window_state.py      | 2 +-
 .../bloqs/qubitization/qubitization_walk_operator.ipynb     | 2 +-
 qualtran/bloqs/qubitization/qubitization_walk_operator.py   | 2 +-
 qualtran/bloqs/reflections/reflection_using_prepare.py      | 2 +-
 qualtran/bloqs/reflections/reflections.ipynb                | 2 +-
 qualtran/bloqs/rotations/programmable_ancilla_rotation.py   | 6 +++---
 .../bloqs/rotations/programmable_rotation_gate_array.py     | 2 +-
 qualtran/bloqs/rotations/zpow_via_phase_gradient.py         | 2 +-
 .../sparse_state_preparation_via_rotations.py               | 2 +-
 .../state_preparation_alias_sampling.ipynb                  | 2 +-
 .../state_preparation/state_preparation_alias_sampling.py   | 2 +-
 qualtran/bloqs/swap_network/cswap_approx.py                 | 2 +-
 qualtran/bloqs/swap_network/swap_network.ipynb              | 2 +-
 qualtran/resource_counting/_bloq_counts.py                  | 2 +-
 qualtran/surface_code/beverland_et_al_model.ipynb           | 2 +-
 qualtran/surface_code/physical_cost_model.ipynb             | 2 +-
 qualtran/surface_code/physical_parameters.py                | 4 ++--
 qualtran/surface_code/qec_scheme.py                         | 6 +++---
 qualtran/surface_code/rotation_cost_model.py                | 6 +++---
 50 files changed, 62 insertions(+), 62 deletions(-)

diff --git a/qualtran/Autodoc.ipynb b/qualtran/Autodoc.ipynb
index 3e3a510a3..d98a5a948 100644
--- a/qualtran/Autodoc.ipynb
+++ b/qualtran/Autodoc.ipynb
@@ -69,10 +69,10 @@
     "\n",
     "    References:\n",
     "        [Encoding Electronic Spectra in Quantum Circuits with Linear T Complexity](https://arxiv.org/abs/1805.03662).\n",
-    "        Babbush et. al. (2018). Figure 1.\n",
+    "        Babbush et al. (2018). Figure 1.\n",
     "\n",
     "        [Compilation of Fault-Tolerant Quantum Heuristics for Combinatorial Optimization](https://arxiv.org/abs/2007.07391).\n",
-    "        Babbush et. al. (2020). Figure 3.\n",
+    "        Babbush et al. (2020). Figure 3.\n",
     "    \"\"\"\n",
     "```"
    ]
diff --git a/qualtran/bloqs/arithmetic/addition.ipynb b/qualtran/bloqs/arithmetic/addition.ipynb
index ab22770e1..c9d271e14 100644
--- a/qualtran/bloqs/arithmetic/addition.ipynb
+++ b/qualtran/bloqs/arithmetic/addition.ipynb
@@ -331,7 +331,7 @@
     " - `x`: A bitsize-sized input register (register x above). \n",
     "\n",
     "#### References\n",
-    " - [Improved quantum circuits for elliptic curve discrete logarithms](https://arxiv.org/abs/2001.09580). Haner et. al. 2020. Section 3: Components. \"Integer addition\" and Fig 2a.\n"
+    " - [Improved quantum circuits for elliptic curve discrete logarithms](https://arxiv.org/abs/2001.09580). Haner et al. 2020. Section 3: Components. \"Integer addition\" and Fig 2a.\n"
    ]
   },
   {
diff --git a/qualtran/bloqs/arithmetic/addition.py b/qualtran/bloqs/arithmetic/addition.py
index 17ca331a3..f0b8de6b9 100644
--- a/qualtran/bloqs/arithmetic/addition.py
+++ b/qualtran/bloqs/arithmetic/addition.py
@@ -401,7 +401,7 @@ class AddK(Bloq):
 
     References:
         [Improved quantum circuits for elliptic curve discrete logarithms](https://arxiv.org/abs/2001.09580).
-        Haner et. al. 2020. Section 3: Components. "Integer addition" and Fig 2a.
+        Haner et al. 2020. Section 3: Components. "Integer addition" and Fig 2a.
     """
 
     bitsize: 'SymbolicInt'
diff --git a/qualtran/bloqs/arithmetic/controlled_add_or_subtract.ipynb b/qualtran/bloqs/arithmetic/controlled_add_or_subtract.ipynb
index ad3ef6e93..97da1cd23 100644
--- a/qualtran/bloqs/arithmetic/controlled_add_or_subtract.ipynb
+++ b/qualtran/bloqs/arithmetic/controlled_add_or_subtract.ipynb
@@ -67,7 +67,7 @@
     " - `b`: an integer value. \n",
     "\n",
     "#### References\n",
-    " - [Compilation of Fault-Tolerant Quantum Heuristics for Combinatorial Optimization](https://arxiv.org/abs/2007.07391). Sanders et. al. Section II-A-1, Algorithm 1.\n"
+    " - [Compilation of Fault-Tolerant Quantum Heuristics for Combinatorial Optimization](https://arxiv.org/abs/2007.07391). Sanders et al. Section II-A-1, Algorithm 1.\n"
    ]
   },
   {
diff --git a/qualtran/bloqs/arithmetic/controlled_add_or_subtract.py b/qualtran/bloqs/arithmetic/controlled_add_or_subtract.py
index 3d74bc932..c082e6547 100644
--- a/qualtran/bloqs/arithmetic/controlled_add_or_subtract.py
+++ b/qualtran/bloqs/arithmetic/controlled_add_or_subtract.py
@@ -62,7 +62,7 @@ class ControlledAddOrSubtract(Bloq):
 
     References:
         [Compilation of Fault-Tolerant Quantum Heuristics for Combinatorial Optimization](https://arxiv.org/abs/2007.07391).
-        Sanders et. al. Section II-A-1, Algorithm 1.
+        Sanders et al. Section II-A-1, Algorithm 1.
     """
 
     a_dtype: Union[QInt, QUInt, QMontgomeryUInt] = field()
diff --git a/qualtran/bloqs/basic_gates/swap.ipynb b/qualtran/bloqs/basic_gates/swap.ipynb
index bb9fa0cf2..b2ccb653c 100644
--- a/qualtran/bloqs/basic_gates/swap.ipynb
+++ b/qualtran/bloqs/basic_gates/swap.ipynb
@@ -121,7 +121,7 @@
     " - `y`: the second bit \n",
     "\n",
     "#### References\n",
-    " - [An algorithm for the T-count](https://arxiv.org/abs/1308.4134). Gosset et. al. 2013. Figure 5.2.\n"
+    " - [An algorithm for the T-count](https://arxiv.org/abs/1308.4134). Gosset et al. 2013. Figure 5.2.\n"
    ]
   },
   {
diff --git a/qualtran/bloqs/basic_gates/swap.py b/qualtran/bloqs/basic_gates/swap.py
index 9df8148a3..62b104f26 100644
--- a/qualtran/bloqs/basic_gates/swap.py
+++ b/qualtran/bloqs/basic_gates/swap.py
@@ -143,7 +143,7 @@ class TwoBitCSwap(Bloq):
 
     References:
         [An algorithm for the T-count](https://arxiv.org/abs/1308.4134).
-        Gosset et. al. 2013. Figure 5.2.
+        Gosset et al. 2013. Figure 5.2.
     """
 
     @cached_property
diff --git a/qualtran/bloqs/basic_gates/t_gate.ipynb b/qualtran/bloqs/basic_gates/t_gate.ipynb
index b79dc9e89..cbdf39584 100644
--- a/qualtran/bloqs/basic_gates/t_gate.ipynb
+++ b/qualtran/bloqs/basic_gates/t_gate.ipynb
@@ -61,7 +61,7 @@
     "\n",
     "#### References\n",
     " - [Universal Quantum Computation with ideal Clifford gates and noisy ancillas](https://arxiv.org/abs/quant-ph/0403025). Bravyi and Kitaev. 2004.\n",
-    " - [Fast and efficient exact synthesis of single qubit unitaries generated by Clifford and T gates](https://arxiv.org/abs/1206.5236). Kliuchnikov et. al. 2012.\n",
+    " - [Fast and efficient exact synthesis of single qubit unitaries generated by Clifford and T gates](https://arxiv.org/abs/1206.5236). Kliuchnikov et al. 2012.\n",
     " - [Universal Gate Set, Magic States, and costliness of the T gate](https://quantumcomputing.stackexchange.com/a/33358). Gidney. 2023.\n"
    ]
   },
diff --git a/qualtran/bloqs/basic_gates/t_gate.py b/qualtran/bloqs/basic_gates/t_gate.py
index a21b43f46..ca71cfb80 100644
--- a/qualtran/bloqs/basic_gates/t_gate.py
+++ b/qualtran/bloqs/basic_gates/t_gate.py
@@ -62,7 +62,7 @@ class TGate(Bloq):
         Bravyi and Kitaev. 2004.
 
         [Fast and efficient exact synthesis of single qubit unitaries generated by Clifford and T gates](https://arxiv.org/abs/1206.5236).
-        Kliuchnikov et. al. 2012.
+        Kliuchnikov et al. 2012.
 
         [Universal Gate Set, Magic States, and costliness of the T gate](https://quantumcomputing.stackexchange.com/a/33358).
         Gidney. 2023.
diff --git a/qualtran/bloqs/chemistry/hubbard_model/qubitization/__init__.py b/qualtran/bloqs/chemistry/hubbard_model/qubitization/__init__.py
index c6c019471..6cda5b775 100644
--- a/qualtran/bloqs/chemistry/hubbard_model/qubitization/__init__.py
+++ b/qualtran/bloqs/chemistry/hubbard_model/qubitization/__init__.py
@@ -14,7 +14,7 @@
 r"""Simulating the Hubbard model Hamiltonian using qubitization.
 
 This module follows section V. of Encoding Electronic Spectra in Quantum Circuits with Linear T
-Complexity. Babbush et. al. 2018. [arxiv:1805.03662](https://arxiv.org/abs/1805.03662).
+Complexity. Babbush et al. 2018. [arxiv:1805.03662](https://arxiv.org/abs/1805.03662).
 
 The 2D Hubbard model is a special case of the electronic structure Hamiltonian
 restricted to spins on a planar grid.
diff --git a/qualtran/bloqs/chemistry/hubbard_model/qubitization/hubbard_model.ipynb b/qualtran/bloqs/chemistry/hubbard_model/qubitization/hubbard_model.ipynb
index e751ee01b..4b5d92aaa 100644
--- a/qualtran/bloqs/chemistry/hubbard_model/qubitization/hubbard_model.ipynb
+++ b/qualtran/bloqs/chemistry/hubbard_model/qubitization/hubbard_model.ipynb
@@ -12,7 +12,7 @@
     "Simulating the Hubbard model Hamiltonian using qubitization.\n",
     "\n",
     "This module follows section V. of Encoding Electronic Spectra in Quantum Circuits with Linear T\n",
-    "Complexity. Babbush et. al. 2018. [arxiv:1805.03662](https://arxiv.org/abs/1805.03662).\n",
+    "Complexity. Babbush et al. 2018. [arxiv:1805.03662](https://arxiv.org/abs/1805.03662).\n",
     "\n",
     "The 2D Hubbard model is a special case of the electronic structure Hamiltonian\n",
     "restricted to spins on a planar grid.\n",
diff --git a/qualtran/bloqs/chemistry/ising/walk_operator.py b/qualtran/bloqs/chemistry/ising/walk_operator.py
index 6867a20f1..7c237150f 100644
--- a/qualtran/bloqs/chemistry/ising/walk_operator.py
+++ b/qualtran/bloqs/chemistry/ising/walk_operator.py
@@ -52,7 +52,7 @@ def get_prepare_precision_from_eigenphase_precision(
 
     References:
         [Encoding Electronic Spectra in Quantum Circuits with Linear T Complexity](https://arxiv.org/abs/1805.03662).
-        Babbush et. al. (2018). Eq (A9).
+        Babbush et al. (2018). Eq (A9).
     """
     return ((eps_eigenphase * sum_of_coeffs) / ((1 + eps_eigenphase**2) * num_coeffs)) * (
         1 - (hamiltonian_l2_norm / sum_of_coeffs) ** 2
@@ -126,7 +126,7 @@ def walk_operator_for_pauli_hamiltonian(
 
     References:
         [Encoding Electronic Spectra in Quantum Circuits with Linear T Complexity](https://arxiv.org/abs/1805.03662).
-        Babbush et. al. (2018). Eq (A9).
+        Babbush et al. (2018). Eq (A9).
     """
     q = sorted(ham.qubits)
     ham_dps = [ps.dense(q) for ps in ham]
diff --git a/qualtran/bloqs/chemistry/thc/select_bloq.py b/qualtran/bloqs/chemistry/thc/select_bloq.py
index 929411e4d..5ed430599 100644
--- a/qualtran/bloqs/chemistry/thc/select_bloq.py
+++ b/qualtran/bloqs/chemistry/thc/select_bloq.py
@@ -66,7 +66,7 @@ class THCRotations(Bloq):
         [Even more efficient quantum computations of chemistry through
             tensor hypercontraction](https://arxiv.org/pdf/2011.03494.pdf) Fig. 7.
         [Quantum computing enhanced computational catalysis](https://arxiv.org/abs/2007.14460).
-            Burg, Low et. al. 2021. Eq. 73
+            Burg, Low, et al. 2021. Eq. 73
     """
 
     num_mu: int
diff --git a/qualtran/bloqs/data_loading/qroam_clean.ipynb b/qualtran/bloqs/data_loading/qroam_clean.ipynb
index 2d5652cfc..372bf3407 100644
--- a/qualtran/bloqs/data_loading/qroam_clean.ipynb
+++ b/qualtran/bloqs/data_loading/qroam_clean.ipynb
@@ -184,7 +184,7 @@
     " - `- junk_registers`: $K - 1$ RIGHT registers, each of bitsize $b$ used to load batches of size $K$ \n",
     "\n",
     "#### References\n",
-    " - [Qubitization of Arbitrary Basis Quantum Chemistry Leveraging Sparsity and Low Rank Factorization](https://arxiv.org/abs/1902.02134).     Berry et. al. (2019). Appendix A. and B.\n"
+    " - [Qubitization of Arbitrary Basis Quantum Chemistry Leveraging Sparsity and Low Rank Factorization](https://arxiv.org/abs/1902.02134).     Berry et al. (2019). Appendix A. and B.\n"
    ]
   },
   {
diff --git a/qualtran/bloqs/data_loading/qroam_clean.py b/qualtran/bloqs/data_loading/qroam_clean.py
index d8a29721b..4dedb5be3 100644
--- a/qualtran/bloqs/data_loading/qroam_clean.py
+++ b/qualtran/bloqs/data_loading/qroam_clean.py
@@ -108,7 +108,7 @@ class QROAMCleanAdjoint(QROMBase, GateWithRegisters):  # type: ignore[misc]
 
     References:
         [Qubitization of Arbitrary Basis Quantum Chemistry Leveraging Sparsity and Low Rank Factorization](https://arxiv.org/abs/1902.02134).
-            Berry et. al. (2019). Appendix C.
+            Berry et al. (2019). Appendix C.
     """
 
     log_block_sizes: Tuple[SymbolicInt, ...] = attrs.field(
@@ -342,7 +342,7 @@ class QROAMClean(SelectSwapQROM):
 
     References:
         [Qubitization of Arbitrary Basis Quantum Chemistry Leveraging Sparsity and Low Rank Factorization](https://arxiv.org/abs/1902.02134).
-            Berry et. al. (2019). Appendix A. and B.
+            Berry et al. (2019). Appendix A. and B.
     """
 
     log_block_sizes: Tuple[SymbolicInt, ...] = attrs.field(
diff --git a/qualtran/bloqs/data_loading/qrom.ipynb b/qualtran/bloqs/data_loading/qrom.ipynb
index ffdfc412a..abf3d05e3 100644
--- a/qualtran/bloqs/data_loading/qrom.ipynb
+++ b/qualtran/bloqs/data_loading/qrom.ipynb
@@ -175,8 +175,8 @@
     "load, the QROM also implements the \"variable-spaced\" QROM optimization described in Ref [2].\n",
     "\n",
     "#### References\n",
-    " - [Encoding Electronic Spectra in Quantum Circuits with Linear T Complexity](https://arxiv.org/abs/1805.03662).     Babbush et. al. (2018). Figure 1.\n",
-    " - [Compilation of Fault-Tolerant Quantum Heuristics for Combinatorial Optimization](https://arxiv.org/abs/2007.07391).     Babbush et. al. (2020). Figure 3.\n"
+    " - [Encoding Electronic Spectra in Quantum Circuits with Linear T Complexity](https://arxiv.org/abs/1805.03662). Babbush et al. 2018. Figure 1.\n",
+    " - [Compilation of Fault-Tolerant Quantum Heuristics for Combinatorial Optimization](https://arxiv.org/abs/2007.07391). Babbush et al. 2020. Figure 3.\n"
    ]
   },
   {
diff --git a/qualtran/bloqs/data_loading/qrom.py b/qualtran/bloqs/data_loading/qrom.py
index 363fc560b..51b8bcaca 100644
--- a/qualtran/bloqs/data_loading/qrom.py
+++ b/qualtran/bloqs/data_loading/qrom.py
@@ -75,10 +75,10 @@ class QROM(QROMBase, UnaryIterationGate):  # type: ignore[misc]
 
     References:
         [Encoding Electronic Spectra in Quantum Circuits with Linear T Complexity](https://arxiv.org/abs/1805.03662).
-            Babbush et. al. (2018). Figure 1.
+        Babbush et al. 2018. Figure 1.
 
         [Compilation of Fault-Tolerant Quantum Heuristics for Combinatorial Optimization](https://arxiv.org/abs/2007.07391).
-            Babbush et. al. (2020). Figure 3.
+        Babbush et al. 2020. Figure 3.
     """
 
     @classmethod
diff --git a/qualtran/bloqs/data_loading/select_swap_qrom.ipynb b/qualtran/bloqs/data_loading/select_swap_qrom.ipynb
index 0c7dc4117..0bae09671 100644
--- a/qualtran/bloqs/data_loading/select_swap_qrom.ipynb
+++ b/qualtran/bloqs/data_loading/select_swap_qrom.ipynb
@@ -179,7 +179,7 @@
     "\n",
     "#### References\n",
     " - [Trading T-gates for dirty qubits in state preparation and unitary synthesis](https://arxiv.org/abs/1812.00954). Low, Kliuchnikov, Schaeffer. 2018.\n",
-    " - [Qubitization of Arbitrary Basis Quantum Chemistry Leveraging Sparsity and Low Rank Factorization](https://arxiv.org/abs/1902.02134).     Berry et. al. (2019). Appendix A. and B.\n"
+    " - [Qubitization of Arbitrary Basis Quantum Chemistry Leveraging Sparsity and Low Rank Factorization](https://arxiv.org/abs/1902.02134). Berry et al. 2019. Appendix A. and B.\n"
    ]
   },
   {
diff --git a/qualtran/bloqs/data_loading/select_swap_qrom.py b/qualtran/bloqs/data_loading/select_swap_qrom.py
index 859b48c90..47eabc704 100644
--- a/qualtran/bloqs/data_loading/select_swap_qrom.py
+++ b/qualtran/bloqs/data_loading/select_swap_qrom.py
@@ -135,7 +135,7 @@ class SelectSwapQROM(QROMBase, GateWithRegisters):  # type: ignore[misc]
         Low, Kliuchnikov, Schaeffer. 2018.
 
         [Qubitization of Arbitrary Basis Quantum Chemistry Leveraging Sparsity and Low Rank Factorization](https://arxiv.org/abs/1902.02134).
-            Berry et. al. (2019). Appendix A. and B.
+        Berry et al. 2019. Appendix A. and B.
     """
 
     log_block_sizes: Tuple[SymbolicInt, ...] = attrs.field(
diff --git a/qualtran/bloqs/factoring/ecc/ec_add_r.py b/qualtran/bloqs/factoring/ecc/ec_add_r.py
index 7596e120d..8b2087314 100644
--- a/qualtran/bloqs/factoring/ecc/ec_add_r.py
+++ b/qualtran/bloqs/factoring/ecc/ec_add_r.py
@@ -51,7 +51,7 @@ class ECAddR(Bloq):
         Litinski. 2023. Section 1, eq. (3) and (4).
 
         [Quantum resource estimates for computing elliptic curve discrete logarithms](https://arxiv.org/abs/1706.06752).
-        Roetteler et. al. 2017. Algorithm 1 and Figure 10.
+        Roetteler et al. 2017. Algorithm 1 and Figure 10.
 
         [https://github.com/microsoft/QuantumEllipticCurves/blob/dbf4836afaf7a9fab813cbc0970e65af85a6f93a/MicrosoftQuantumCrypto/EllipticCurves.qs#L456](QuantumQuantumCrypto).
         `DistinctEllipticCurveClassicalPointAddition`.
diff --git a/qualtran/bloqs/factoring/ecc/ecc.ipynb b/qualtran/bloqs/factoring/ecc/ecc.ipynb
index a9196721b..9215d113d 100644
--- a/qualtran/bloqs/factoring/ecc/ecc.ipynb
+++ b/qualtran/bloqs/factoring/ecc/ecc.ipynb
@@ -334,7 +334,7 @@
     "\n",
     "#### References\n",
     " - [How to compute a 256-bit elliptic curve private key with only 50 million Toffoli gates](https://arxiv.org/abs/2306.08585). Litinski. 2023. Section 1, eq. (3) and (4).\n",
-    " - [Quantum resource estimates for computing elliptic curve discrete logarithms](https://arxiv.org/abs/1706.06752). Roetteler et. al. 2017. Algorithm 1 and Figure 10.\n",
+    " - [Quantum resource estimates for computing elliptic curve discrete logarithms](https://arxiv.org/abs/1706.06752). Roetteler et al. 2017. Algorithm 1 and Figure 10.\n",
     " - [https://github.com/microsoft/QuantumEllipticCurves/blob/dbf4836afaf7a9fab813cbc0970e65af85a6f93a/MicrosoftQuantumCrypto/EllipticCurves.qs#L456](QuantumQuantumCrypto). `DistinctEllipticCurveClassicalPointAddition`.\n"
    ]
   },
diff --git a/qualtran/bloqs/mcmt/and_bloq.ipynb b/qualtran/bloqs/mcmt/and_bloq.ipynb
index 8208ef807..54a99b452 100644
--- a/qualtran/bloqs/mcmt/and_bloq.ipynb
+++ b/qualtran/bloqs/mcmt/and_bloq.ipynb
@@ -56,7 +56,7 @@
     " - `target [right]`: The output bit. \n",
     "\n",
     "#### References\n",
-    " - [Encoding Electronic Spectra in Quantum Circuits with Linear T Complexity](https://arxiv.org/abs/1805.03662).     Babbush et. al. 2018. Section III.A. and Fig. 4.\n",
+    " - [Encoding Electronic Spectra in Quantum Circuits with Linear T Complexity](https://arxiv.org/abs/1805.03662).     Babbush et al. 2018. Section III.A. and Fig. 4.\n",
     " - [Verifying Measurement Based Uncomputation](https://algassert.com/post/1903). Gidney, C. 2019.\n"
    ]
   },
diff --git a/qualtran/bloqs/mcmt/and_bloq.py b/qualtran/bloqs/mcmt/and_bloq.py
index 29f8d4188..9ca197238 100644
--- a/qualtran/bloqs/mcmt/and_bloq.py
+++ b/qualtran/bloqs/mcmt/and_bloq.py
@@ -87,7 +87,7 @@ class And(GateWithRegisters):
 
     References:
         [Encoding Electronic Spectra in Quantum Circuits with Linear T Complexity](https://arxiv.org/abs/1805.03662).
-            Babbush et. al. 2018. Section III.A. and Fig. 4.
+            Babbush et al. 2018. Section III.A. and Fig. 4.
 
         [Verifying Measurement Based Uncomputation](https://algassert.com/post/1903). Gidney, C. 2019.
     """
diff --git a/qualtran/bloqs/mcmt/ctrl_spec_and.ipynb b/qualtran/bloqs/mcmt/ctrl_spec_and.ipynb
index c266e0511..e6feec19b 100644
--- a/qualtran/bloqs/mcmt/ctrl_spec_and.ipynb
+++ b/qualtran/bloqs/mcmt/ctrl_spec_and.ipynb
@@ -60,7 +60,7 @@
     " - `target [right]`: The output bit storing the result of the `ctrl_spec`. \n",
     "\n",
     "#### References\n",
-    " - [Unqomp: synthesizing uncomputation in Quantum circuits](https://dl.acm.org/doi/10.1145/3453483.3454040). Paradis et. al. 2021.\n"
+    " - [Unqomp: synthesizing uncomputation in Quantum circuits](https://dl.acm.org/doi/10.1145/3453483.3454040). Paradis et al. 2021.\n"
    ]
   },
   {
diff --git a/qualtran/bloqs/mcmt/ctrl_spec_and.py b/qualtran/bloqs/mcmt/ctrl_spec_and.py
index 7bcb195c8..409bb5307 100644
--- a/qualtran/bloqs/mcmt/ctrl_spec_and.py
+++ b/qualtran/bloqs/mcmt/ctrl_spec_and.py
@@ -71,7 +71,7 @@ class CtrlSpecAnd(Bloq):
 
     References:
         [Unqomp: synthesizing uncomputation in Quantum circuits](https://dl.acm.org/doi/10.1145/3453483.3454040)
-        Paradis et. al. 2021.
+        Paradis et al. 2021.
     """
 
     ctrl_spec: CtrlSpec
diff --git a/qualtran/bloqs/multiplexers/apply_gate_to_lth_target.ipynb b/qualtran/bloqs/multiplexers/apply_gate_to_lth_target.ipynb
index a4785f12d..7b733722e 100644
--- a/qualtran/bloqs/multiplexers/apply_gate_to_lth_target.ipynb
+++ b/qualtran/bloqs/multiplexers/apply_gate_to_lth_target.ipynb
@@ -75,7 +75,7 @@
     " - `control_regs`: Control signature for constructing a controlled version of the gate. \n",
     "\n",
     "#### References\n",
-    " - [Encoding Electronic Spectra in Quantum Circuits with Linear T Complexity](https://arxiv.org/abs/1805.03662). Babbush et. al. (2018). Section III.A. and Figure 7.\n"
+    " - [Encoding Electronic Spectra in Quantum Circuits with Linear T Complexity](https://arxiv.org/abs/1805.03662). Babbush et al. (2018). Section III.A. and Figure 7.\n"
    ]
   },
   {
diff --git a/qualtran/bloqs/multiplexers/apply_gate_to_lth_target.py b/qualtran/bloqs/multiplexers/apply_gate_to_lth_target.py
index 34dbae8b9..77f70157c 100644
--- a/qualtran/bloqs/multiplexers/apply_gate_to_lth_target.py
+++ b/qualtran/bloqs/multiplexers/apply_gate_to_lth_target.py
@@ -47,7 +47,7 @@ class ApplyGateToLthQubit(UnaryIterationGate):
 
     References:
         [Encoding Electronic Spectra in Quantum Circuits with Linear T Complexity](https://arxiv.org/abs/1805.03662).
-        Babbush et. al. (2018). Section III.A. and Figure 7.
+        Babbush et al. (2018). Section III.A. and Figure 7.
     """
 
     selection_regs: Tuple[Register, ...] = attrs.field(
diff --git a/qualtran/bloqs/multiplexers/apply_lth_bloq.ipynb b/qualtran/bloqs/multiplexers/apply_lth_bloq.ipynb
index 35a038bea..3e6cdbf17 100644
--- a/qualtran/bloqs/multiplexers/apply_lth_bloq.ipynb
+++ b/qualtran/bloqs/multiplexers/apply_lth_bloq.ipynb
@@ -56,7 +56,7 @@
     " - `[user_spec]`: The output registers of the bloqs in `ops`. \n",
     "\n",
     "#### References\n",
-    " - [Encoding Electronic Spectra in Quantum Circuits with Linear T Complexity]( https://arxiv.org/abs/1805.03662). Babbush et. al. (2018). Section III.A. and Figure 7.\n"
+    " - [Encoding Electronic Spectra in Quantum Circuits with Linear T Complexity]( https://arxiv.org/abs/1805.03662). Babbush et al. (2018). Section III.A. and Figure 7.\n"
    ]
   },
   {
diff --git a/qualtran/bloqs/multiplexers/apply_lth_bloq.py b/qualtran/bloqs/multiplexers/apply_lth_bloq.py
index 003080af1..8cb4888a5 100644
--- a/qualtran/bloqs/multiplexers/apply_lth_bloq.py
+++ b/qualtran/bloqs/multiplexers/apply_lth_bloq.py
@@ -52,7 +52,7 @@ class ApplyLthBloq(UnaryIterationGate, SpecializedSingleQubitControlledExtension
 
     References:
         [Encoding Electronic Spectra in Quantum Circuits with Linear T Complexity](
-        https://arxiv.org/abs/1805.03662). Babbush et. al. (2018). Section III.A. and Figure 7.
+        https://arxiv.org/abs/1805.03662). Babbush et al. (2018). Section III.A. and Figure 7.
     """
 
     # type ignore needed here for Bloq as NDArray parameter
diff --git a/qualtran/bloqs/multiplexers/unary_iteration_bloq.py b/qualtran/bloqs/multiplexers/unary_iteration_bloq.py
index f5b5308b6..1c75868a0 100644
--- a/qualtran/bloqs/multiplexers/unary_iteration_bloq.py
+++ b/qualtran/bloqs/multiplexers/unary_iteration_bloq.py
@@ -404,7 +404,7 @@ class UnaryIterationGate(GateWithRegisters):
 
     References:
         [Encoding Electronic Spectra in Quantum Circuits with Linear T Complexity](https://arxiv.org/abs/1805.03662).
-        Babbush et. al. (2018). Section III.A.
+        Babbush et al. (2018). Section III.A.
     """
 
     @cached_property
diff --git a/qualtran/bloqs/phase_estimation/kaiser_window_state.ipynb b/qualtran/bloqs/phase_estimation/kaiser_window_state.ipynb
index 029c9f8f3..c108729f0 100644
--- a/qualtran/bloqs/phase_estimation/kaiser_window_state.ipynb
+++ b/qualtran/bloqs/phase_estimation/kaiser_window_state.ipynb
@@ -55,7 +55,7 @@
     " - `alpha`: Shape parameter, determines trade-off between main-lobe width and side lobe level. \n",
     "\n",
     "#### References\n",
-    " - [Analyzing Prospects for Quantum Advantage in Topological Data Analysis](https://arxiv.org/abs/2209.13581). Berry et. al. (2022). Appendix D\n"
+    " - [Analyzing Prospects for Quantum Advantage in Topological Data Analysis](https://arxiv.org/abs/2209.13581). Berry et al. (2022). Appendix D\n"
    ]
   },
   {
diff --git a/qualtran/bloqs/phase_estimation/kaiser_window_state.py b/qualtran/bloqs/phase_estimation/kaiser_window_state.py
index b82a2493f..38e851f81 100644
--- a/qualtran/bloqs/phase_estimation/kaiser_window_state.py
+++ b/qualtran/bloqs/phase_estimation/kaiser_window_state.py
@@ -61,7 +61,7 @@ class KaiserWindowState(QPEWindowStateBase):
     References:
         [Analyzing Prospects for Quantum Advantage in Topological Data
         Analysis](https://arxiv.org/abs/2209.13581).
-        Berry et. al. (2022). Appendix D
+        Berry et al. (2022). Appendix D
     """
 
     bitsize: SymbolicInt
diff --git a/qualtran/bloqs/qubitization/qubitization_walk_operator.ipynb b/qualtran/bloqs/qubitization/qubitization_walk_operator.ipynb
index afeb920f3..31ff0e00e 100644
--- a/qualtran/bloqs/qubitization/qubitization_walk_operator.ipynb
+++ b/qualtran/bloqs/qubitization/qubitization_walk_operator.ipynb
@@ -147,7 +147,7 @@
     " - `control_val`: If 0/1, a controlled version of the walk operator is constructed. Defaults to None, in which case the resulting walk operator is not controlled. \n",
     "\n",
     "#### References\n",
-    " - [Encoding Electronic Spectra in Quantum Circuits with Linear T Complexity](https://arxiv.org/abs/1805.03662). Babbush et. al. (2018). Figure 1.\n"
+    " - [Encoding Electronic Spectra in Quantum Circuits with Linear T Complexity](https://arxiv.org/abs/1805.03662). Babbush et al. (2018). Figure 1.\n"
    ]
   },
   {
diff --git a/qualtran/bloqs/qubitization/qubitization_walk_operator.py b/qualtran/bloqs/qubitization/qubitization_walk_operator.py
index 2d49b9408..0748a6748 100644
--- a/qualtran/bloqs/qubitization/qubitization_walk_operator.py
+++ b/qualtran/bloqs/qubitization/qubitization_walk_operator.py
@@ -84,7 +84,7 @@ class QubitizationWalkOperator(GateWithRegisters, SpecializedSingleQubitControll
 
     References:
         [Encoding Electronic Spectra in Quantum Circuits with Linear T Complexity](https://arxiv.org/abs/1805.03662).
-        Babbush et. al. (2018). Figure 1.
+        Babbush et al. (2018). Figure 1.
     """
 
     block_encoding: Union[SelectBlockEncoding, LCUBlockEncoding]
diff --git a/qualtran/bloqs/reflections/reflection_using_prepare.py b/qualtran/bloqs/reflections/reflection_using_prepare.py
index ac2ec1337..885f9317f 100644
--- a/qualtran/bloqs/reflections/reflection_using_prepare.py
+++ b/qualtran/bloqs/reflections/reflection_using_prepare.py
@@ -76,7 +76,7 @@ class ReflectionUsingPrepare(GateWithRegisters, SpecializedSingleQubitControlled
 
     References:
         [Encoding Electronic Spectra in Quantum Circuits with Linear T Complexity](https://arxiv.org/abs/1805.03662).
-            Babbush et. al. (2018). Figure 1.
+        Babbush et al. 2018. Figure 1.
     """
 
     prepare_gate: Union['PrepareOracle', 'BlackBoxPrepare']
diff --git a/qualtran/bloqs/reflections/reflections.ipynb b/qualtran/bloqs/reflections/reflections.ipynb
index 552e9d7a8..e4d3316f9 100644
--- a/qualtran/bloqs/reflections/reflections.ipynb
+++ b/qualtran/bloqs/reflections/reflections.ipynb
@@ -66,7 +66,7 @@
     " - `eps`: precision for implementation of rotation. Only relevant if global_phase is arbitrary angle and gate is not controlled. \n",
     "\n",
     "#### References\n",
-    " - [Encoding Electronic Spectra in Quantum Circuits with Linear T Complexity](https://arxiv.org/abs/1805.03662).     Babbush et. al. (2018). Figure 1.\n"
+    " - [Encoding Electronic Spectra in Quantum Circuits with Linear T Complexity](https://arxiv.org/abs/1805.03662). Babbush et al. 2018. Figure 1.\n"
    ]
   },
   {
diff --git a/qualtran/bloqs/rotations/programmable_ancilla_rotation.py b/qualtran/bloqs/rotations/programmable_ancilla_rotation.py
index a1bd38569..e50445fd1 100644
--- a/qualtran/bloqs/rotations/programmable_ancilla_rotation.py
+++ b/qualtran/bloqs/rotations/programmable_ancilla_rotation.py
@@ -99,7 +99,7 @@ class ZPowUsingProgrammedAncilla(Bloq):
 
     References:
         [Simulating chemistry efficiently on fault-tolerant quantum computers](https://arxiv.org/abs/1204.0567)
-        Jones et. al. 2012. Fig 4.
+        Jones et al. 2012. Fig 4.
     """
 
     exponent: SymbolicFloat
@@ -165,7 +165,7 @@ def _zpow_using_programmed_ancilla_symb() -> ZPowUsingProgrammedAncilla:
 
     References:
         [Simulating chemistry efficiently on fault-tolerant quantum computers](https://arxiv.org/abs/1204.0567)
-        Jones et. al. 2012. Fig 4.
+        Jones et al. 2012. Fig 4.
     """
     phi, eps = sympy.symbols(r"\phi \epsilon")
     zpow_using_programmed_ancilla_symb = ZPowUsingProgrammedAncilla(
@@ -180,7 +180,7 @@ def _zpow_using_programmed_ancilla_symb_rounds() -> ZPowUsingProgrammedAncilla:
 
     References:
         [Simulating chemistry efficiently on fault-tolerant quantum computers](https://arxiv.org/abs/1204.0567)
-        Jones et. al. 2012. Fig 4.
+        Jones et al. 2012. Fig 4.
     """
     phi, n = sympy.symbols(r"\phi n")
     zpow_using_programmed_ancilla_symb_rounds = ZPowUsingProgrammedAncilla(
diff --git a/qualtran/bloqs/rotations/programmable_rotation_gate_array.py b/qualtran/bloqs/rotations/programmable_rotation_gate_array.py
index 8b59c6bc6..c7c896793 100644
--- a/qualtran/bloqs/rotations/programmable_rotation_gate_array.py
+++ b/qualtran/bloqs/rotations/programmable_rotation_gate_array.py
@@ -63,7 +63,7 @@ class ProgrammableRotationGateArrayBase(GateWithRegisters):
 
     References:
         [Quantum computing enhanced computational catalysis](https://arxiv.org/abs/2007.14460).
-        Burg, Low et. al. 2021. Page 45; Section VII.B.1
+        Burg, Low, et al. 2021. Page 45; Section VII.B.1
     """
 
     def __init__(self, *angles: Sequence[int], kappa: int, rotation_gate: cirq.Gate):
diff --git a/qualtran/bloqs/rotations/zpow_via_phase_gradient.py b/qualtran/bloqs/rotations/zpow_via_phase_gradient.py
index 162de173a..c1b5ff1d2 100644
--- a/qualtran/bloqs/rotations/zpow_via_phase_gradient.py
+++ b/qualtran/bloqs/rotations/zpow_via_phase_gradient.py
@@ -62,7 +62,7 @@ class ZPowConstViaPhaseGradient(Bloq):
 
     References:
         [Improved quantum circuits for elliptic curve discrete logarithms](https://arxiv.org/abs/2001.09580).
-        Haner et. al. 2020. Section 3: Components. "Integer addition" and Fig 2a.
+        Haner et al. 2020. Section 3: Components. "Integer addition" and Fig 2a.
     """
 
     exponent: SymbolicFloat
diff --git a/qualtran/bloqs/state_preparation/sparse_state_preparation_via_rotations.py b/qualtran/bloqs/state_preparation/sparse_state_preparation_via_rotations.py
index 3ef266977..e5d631263 100644
--- a/qualtran/bloqs/state_preparation/sparse_state_preparation_via_rotations.py
+++ b/qualtran/bloqs/state_preparation/sparse_state_preparation_via_rotations.py
@@ -53,7 +53,7 @@ class SparseStatePreparationViaRotations(Bloq):
 
     References:
         [A simple quantum algorithm to efficiently prepare sparse states](https://arxiv.org/abs/2310.19309)
-        Ramacciotti et. al. Section 4 "Permutation Grover-Rudolph".
+        Ramacciotti et al. Section 4 "Permutation Grover-Rudolph".
     """
 
     sparse_indices: Union[tuple[int, ...], HasLength] = field(converter=_to_tuple_or_has_length)
diff --git a/qualtran/bloqs/state_preparation/state_preparation_alias_sampling.ipynb b/qualtran/bloqs/state_preparation/state_preparation_alias_sampling.ipynb
index 3b06aa946..fd94fe55f 100644
--- a/qualtran/bloqs/state_preparation/state_preparation_alias_sampling.ipynb
+++ b/qualtran/bloqs/state_preparation/state_preparation_alias_sampling.ipynb
@@ -88,7 +88,7 @@
     " - `sum_of_unnormalized_probabilities`: The total of the input unnormalized probabilities, i.e., $\\lambda$. This is used as the `PrepareOracle.l1_norm_of_coeffs` property. \n",
     "\n",
     "#### References\n",
-    " - [Encoding Electronic Spectra in Quantum Circuits with Linear T Complexity](https://arxiv.org/abs/1805.03662). Babbush et. al. (2018). Section III.D. and Figure 11.\n"
+    " - [Encoding Electronic Spectra in Quantum Circuits with Linear T Complexity](https://arxiv.org/abs/1805.03662). Babbush et al. (2018). Section III.D. and Figure 11.\n"
    ]
   },
   {
diff --git a/qualtran/bloqs/state_preparation/state_preparation_alias_sampling.py b/qualtran/bloqs/state_preparation/state_preparation_alias_sampling.py
index 9741eeec3..258a33c87 100644
--- a/qualtran/bloqs/state_preparation/state_preparation_alias_sampling.py
+++ b/qualtran/bloqs/state_preparation/state_preparation_alias_sampling.py
@@ -110,7 +110,7 @@ class StatePreparationAliasSampling(PrepareOracle):
 
     References:
         [Encoding Electronic Spectra in Quantum Circuits with Linear T Complexity](https://arxiv.org/abs/1805.03662).
-        Babbush et. al. (2018). Section III.D. and Figure 11.
+        Babbush et al. (2018). Section III.D. and Figure 11.
     """
 
     selection_registers: Tuple[Register, ...] = attrs.field(
diff --git a/qualtran/bloqs/swap_network/cswap_approx.py b/qualtran/bloqs/swap_network/cswap_approx.py
index 5c123202d..7058ff684 100644
--- a/qualtran/bloqs/swap_network/cswap_approx.py
+++ b/qualtran/bloqs/swap_network/cswap_approx.py
@@ -57,7 +57,7 @@ class CSwapApprox(GateWithRegisters):
 
     References:
         [Trading T-gates for dirty qubits in state preparation and unitary synthesis](https://arxiv.org/abs/1812.00954).
-        Low et. al. 2018. See Appendix B.2.c.
+        Low et al. 2018. See Appendix B.2.c.
     """
 
     bitsize: SymbolicInt
diff --git a/qualtran/bloqs/swap_network/swap_network.ipynb b/qualtran/bloqs/swap_network/swap_network.ipynb
index 32a164e47..49c22e5c4 100644
--- a/qualtran/bloqs/swap_network/swap_network.ipynb
+++ b/qualtran/bloqs/swap_network/swap_network.ipynb
@@ -55,7 +55,7 @@
     " - `y`: the second register \n",
     "\n",
     "#### References\n",
-    " - [Trading T-gates for dirty qubits in state preparation and unitary synthesis](https://arxiv.org/abs/1812.00954). Low et. al. 2018. See Appendix B.2.c.\n"
+    " - [Trading T-gates for dirty qubits in state preparation and unitary synthesis](https://arxiv.org/abs/1812.00954). Low et al. 2018. See Appendix B.2.c.\n"
    ]
   },
   {
diff --git a/qualtran/resource_counting/_bloq_counts.py b/qualtran/resource_counting/_bloq_counts.py
index 3cc0a64d5..24a9bc672 100644
--- a/qualtran/resource_counting/_bloq_counts.py
+++ b/qualtran/resource_counting/_bloq_counts.py
@@ -252,7 +252,7 @@ def to_legacy_t_complexity(
         )
 
     def total_beverland_count(self) -> Dict[str, SymbolicInt]:
-        r"""Counts used by Beverland. et. al. using notation from the reference.
+        r"""Counts used by Beverland et al. using notation from the reference.
 
          - $M_\mathrm{meas}$ is the number of measurements.
          - $M_R$ is the number of rotations.
diff --git a/qualtran/surface_code/beverland_et_al_model.ipynb b/qualtran/surface_code/beverland_et_al_model.ipynb
index a3c6f95f5..1dca78647 100644
--- a/qualtran/surface_code/beverland_et_al_model.ipynb
+++ b/qualtran/surface_code/beverland_et_al_model.ipynb
@@ -5,7 +5,7 @@
    "cell_type": "markdown",
    "metadata": {},
    "source": [
-    "# Beverland et. al. Model\n",
+    "# Beverland et al. Model\n",
     "In this notebook, we reproduce the physical resource estimates in \"Assessing requirements to scale to practical quantum advantage\" by [Beverland et al](https://arxiv.org/abs/2211.07629), Appendix F.\n",
     "\n",
     "The paper describes the formulas used for estimating cost in the various appendices. The final estimation procedure is put together in Appendix E and we reproduce the values found in Appendix F."
diff --git a/qualtran/surface_code/physical_cost_model.ipynb b/qualtran/surface_code/physical_cost_model.ipynb
index 2dbfcbe5d..5cb5070d0 100644
--- a/qualtran/surface_code/physical_cost_model.ipynb
+++ b/qualtran/surface_code/physical_cost_model.ipynb
@@ -244,7 +244,7 @@
    "outputs": [],
    "source": [
     "print(\"Gidney Fowler    \", QECScheme.make_gidney_fowler())\n",
-    "print(\"Beverland et. al.\", QECScheme.make_beverland_et_al())"
+    "print(\"Beverland et al. \", QECScheme.make_beverland_et_al())"
    ]
   },
   {
diff --git a/qualtran/surface_code/physical_parameters.py b/qualtran/surface_code/physical_parameters.py
index f61ab7955..08d00e221 100644
--- a/qualtran/surface_code/physical_parameters.py
+++ b/qualtran/surface_code/physical_parameters.py
@@ -32,7 +32,7 @@ class PhysicalParameters:
     def make_beverland_et_al(
         cls, qubit_modality: str = 'superconducting', optimistic_err_rate: bool = False
     ):
-        """The physical parameters considered in the Beverland et. al. reference.
+        """The physical parameters considered in the Beverland et al. reference.
 
         Args:
             qubit_modality: One of "superconducting", "ion", or "majorana". This sets the
@@ -43,7 +43,7 @@ def make_beverland_et_al(
 
         References:
             [Assessing requirements to scale to practical quantum advantage](https://arxiv.org/abs/2211.07629).
-            Beverland et. al. (2022).
+            Beverland et al. (2022).
         """
         if optimistic_err_rate:
             phys_err_rate = 1e-4
diff --git a/qualtran/surface_code/qec_scheme.py b/qualtran/surface_code/qec_scheme.py
index 721485814..00e2bd5ac 100644
--- a/qualtran/surface_code/qec_scheme.py
+++ b/qualtran/surface_code/qec_scheme.py
@@ -62,7 +62,7 @@ def logical_error_rate(self, code_distance: int, physical_error: float) -> float
             See section XV for introduction of this formula, with citation to below.
 
             Surface code quantum error correction incorporating accurate error propagation.
-            Fowler et. al. (2010). https://arxiv.org/abs/1004.0255.
+            Fowler et al. (2010). https://arxiv.org/abs/1004.0255.
             Note: this doesn't actually contain the formula from the above reference.
         """
         return self.error_rate_scaler * math.pow(
@@ -99,11 +99,11 @@ def make_gidney_fowler(cls):
 
     @classmethod
     def make_beverland_et_al(cls):
-        """The qec scheme parameters considered in Beverland et. al. reference.
+        """The qec scheme parameters considered in Beverland et al. reference.
 
         References:
             [https://arxiv.org/abs/2211.07629](Assessing requirements to scale to practical quantum advantage).
-            Beverland et. al. (2022).
+            Beverland et al. (2022).
         """
         return cls(error_rate_scaler=0.03, error_rate_threshold=0.01)
 
diff --git a/qualtran/surface_code/rotation_cost_model.py b/qualtran/surface_code/rotation_cost_model.py
index 0944fe4bc..b747ce18a 100644
--- a/qualtran/surface_code/rotation_cost_model.py
+++ b/qualtran/surface_code/rotation_cost_model.py
@@ -48,10 +48,10 @@ class RotationLogarithmicModel(RotationCostModel):
 
     References:
         [https://arxiv.org/abs/2211.07629](Assessing requirements to scale to practical quantum advantage).
-        Beverland et. al. (2022).
+        Beverland et al. (2022).
 
         [https://arxiv.org/abs/2203.10064](Shorter quantum circuits via single-qubit gate approximation).
-        Kliuchnikov. et. al. (2022). Used for the approximation protocol.
+        Kliuchnikov et al. (2022). Used for the approximation protocol.
     """
 
     slope: float
@@ -82,7 +82,7 @@ class ConstantWithOverheadRotationCost(RotationCostModel):
 
     References:
         [https://doi.org/10.1103/PRXQuantum.1.020312](Compilation of Fault-Tolerant Quantum Heuristics for Combinatorial Optimization).
-        Sanders et. al. (2020).
+        Sanders et al. (2020).
     """
 
     bitsize: int