et. al. -> et al. (#1431)

quantumlib · Oct 2, 2024 · b3000cb · b3000cb
1 parent d258389
commit b3000cb
Show file tree

Hide file tree

Showing 50 changed files with 62 additions and 62 deletions.
diff --git 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
@@ -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
@@ -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
@@ -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
@@ -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
@@ -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
@@ -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
@@ -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
@@ -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
@@ -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
@@ -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
@@ -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
@@ -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
@@ -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
@@ -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
@@ -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
@@ -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
@@ -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
@@ -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
@@ -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
@@ -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
@@ -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
@@ -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
@@ -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
@@ -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
@@ -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
@@ -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
@@ -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
@@ -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
@@ -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
@@ -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
@@ -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
@@ -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
@@ -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
@@ -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
@@ -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
@@ -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
@@ -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
@@ -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