qiskit 1.1.2__cp38-abi3-macosx_10_9_universal2.whl → 1.2.0rc1__cp38-abi3-macosx_10_9_universal2.whl

qiskit/synthesis/evolution/qdrift.py

@@ -12,11 +12,15 @@
 
 """QDrift Class"""
 
+from __future__ import annotations
+
+import inspect
 import math
-from typing import Union, Optional, Callable
+from collections.abc import Callable
 import numpy as np
 from qiskit.circuit.quantumcircuit import QuantumCircuit
 from qiskit.quantum_info.operators import SparsePauliOp, Pauli
+from qiskit.utils.deprecation import deprecate_arg
 
 from .product_formula import ProductFormula
 from .lie_trotter import LieTrotter
@@ -32,15 +36,33 @@ class QDrift(ProductFormula):
         `arXiv:quant-ph/1811.08017 <https://arxiv.org/abs/1811.08017>`_
     """
 
+    @deprecate_arg(
+        name="atomic_evolution",
+        since="1.2",
+        predicate=lambda callable: callable is not None
+        and len(inspect.signature(callable).parameters) == 2,
+        deprecation_description=(
+            "The 'Callable[[Pauli | SparsePauliOp, float], QuantumCircuit]' signature of the "
+            "'atomic_evolution' argument"
+        ),
+        additional_msg=(
+            "Instead you should update your 'atomic_evolution' function to be of the following "
+            "type: 'Callable[[QuantumCircuit, Pauli | SparsePauliOp, float], None]'."
+        ),
+        pending=True,
+    )
     def __init__(
         self,
         reps: int = 1,
         insert_barriers: bool = False,
         cx_structure: str = "chain",
-        atomic_evolution: Optional[
-            Callable[[Union[Pauli, SparsePauliOp], float], QuantumCircuit]
-        ] = None,
-        seed: Optional[int] = None,
+        atomic_evolution: (
+            Callable[[Pauli | SparsePauliOp, float], QuantumCircuit]
+            | Callable[[QuantumCircuit, Pauli | SparsePauliOp, float], None]
+            | None
+        ) = None,
+        seed: int | None = None,
+        wrap: bool = False,
     ) -> None:
         r"""
         Args:
@@ -48,13 +70,21 @@ class QDrift(ProductFormula):
             insert_barriers: Whether to insert barriers between the atomic evolutions.
             cx_structure: How to arrange the CX gates for the Pauli evolutions, can be
                 ``"chain"``, where next neighbor connections are used, or ``"fountain"``, where all
-                qubits are connected to one.
-            atomic_evolution: A function to construct the circuit for the evolution of single
-                Pauli string. Per default, a single Pauli evolution is decomposed in a CX chain
-                and a single qubit Z rotation.
+                qubits are connected to one. This only takes effect when
+                ``atomic_evolution is None``.
+            atomic_evolution: A function to apply the evolution of a single :class:`.Pauli`, or
+                :class:`.SparsePauliOp` of only commuting terms, to a circuit. The function takes in
+                three arguments: the circuit to append the evolution to, the Pauli operator to
+                evolve, and the evolution time. By default, a single Pauli evolution is decomposed
+                into a chain of ``CX`` gates and a single ``RZ`` gate.
+                Alternatively, the function can also take Pauli operator and evolution time as
+                inputs and returns the circuit that will be appended to the overall circuit being
+                built.
             seed: An optional seed for reproducibility of the random sampling process.
+            wrap: Whether to wrap the atomic evolutions into custom gate objects. This only takes
+                effect when ``atomic_evolution is None``.
         """
-        super().__init__(1, reps, insert_barriers, cx_structure, atomic_evolution)
+        super().__init__(1, reps, insert_barriers, cx_structure, atomic_evolution, wrap)
         self.sampled_ops = None
         self.rng = np.random.default_rng(seed)
 

qiskit/synthesis/evolution/suzuki_trotter.py

@@ -12,12 +12,16 @@
 
 """The Suzuki-Trotter product formula."""
 
-from typing import Callable, Optional, Union
+from __future__ import annotations
+
+import inspect
+from collections.abc import Callable
 
 import numpy as np
 
 from qiskit.circuit.quantumcircuit import QuantumCircuit
 from qiskit.quantum_info.operators import SparsePauliOp, Pauli
+from qiskit.utils.deprecation import deprecate_arg
 
 
 from .product_formula import ProductFormula
@@ -51,15 +55,33 @@ class SuzukiTrotter(ProductFormula):
         `arXiv:math-ph/0506007 <https://arxiv.org/pdf/math-ph/0506007.pdf>`_
     """
 
+    @deprecate_arg(
+        name="atomic_evolution",
+        since="1.2",
+        predicate=lambda callable: callable is not None
+        and len(inspect.signature(callable).parameters) == 2,
+        deprecation_description=(
+            "The 'Callable[[Pauli | SparsePauliOp, float], QuantumCircuit]' signature of the "
+            "'atomic_evolution' argument"
+        ),
+        additional_msg=(
+            "Instead you should update your 'atomic_evolution' function to be of the following "
+            "type: 'Callable[[QuantumCircuit, Pauli | SparsePauliOp, float], None]'."
+        ),
+        pending=True,
+    )
     def __init__(
         self,
         order: int = 2,
         reps: int = 1,
         insert_barriers: bool = False,
         cx_structure: str = "chain",
-        atomic_evolution: Optional[
-            Callable[[Union[Pauli, SparsePauliOp], float], QuantumCircuit]
-        ] = None,
+        atomic_evolution: (
+            Callable[[Pauli | SparsePauliOp, float], QuantumCircuit]
+            | Callable[[QuantumCircuit, Pauli | SparsePauliOp, float], None]
+            | None
+        ) = None,
+        wrap: bool = False,
     ) -> None:
         """
         Args:
@@ -68,10 +90,17 @@ class SuzukiTrotter(ProductFormula):
             insert_barriers: Whether to insert barriers between the atomic evolutions.
             cx_structure: How to arrange the CX gates for the Pauli evolutions, can be ``"chain"``,
                 where next neighbor connections are used, or ``"fountain"``, where all qubits are
-                connected to one.
-            atomic_evolution: A function to construct the circuit for the evolution of single
-                Pauli string. Per default, a single Pauli evolution is decomposed in a CX chain
-                and a single qubit Z rotation.
+                connected to one. This only takes effect when ``atomic_evolution is None``.
+            atomic_evolution: A function to apply the evolution of a single :class:`.Pauli`, or
+                :class:`.SparsePauliOp` of only commuting terms, to a circuit. The function takes in
+                three arguments: the circuit to append the evolution to, the Pauli operator to
+                evolve, and the evolution time. By default, a single Pauli evolution is decomposed
+                into a chain of ``CX`` gates and a single ``RZ`` gate.
+                Alternatively, the function can also take Pauli operator and evolution time as
+                inputs and returns the circuit that will be appended to the overall circuit being
+                built.
+            wrap: Whether to wrap the atomic evolutions into custom gate objects. This only takes
+                effect when ``atomic_evolution is None``.
         Raises:
             ValueError: If order is not even
         """
@@ -81,7 +110,7 @@ class SuzukiTrotter(ProductFormula):
                 "Suzuki product formulae are symmetric and therefore only defined "
                 "for even orders."
             )
-        super().__init__(order, reps, insert_barriers, cx_structure, atomic_evolution)
+        super().__init__(order, reps, insert_barriers, cx_structure, atomic_evolution, wrap)
 
     def synthesize(self, evolution):
         # get operators and time to evolve
@@ -97,32 +126,13 @@ class SuzukiTrotter(ProductFormula):
 
         # construct the evolution circuit
         single_rep = QuantumCircuit(operators[0].num_qubits)
-        first_barrier = False
-
-        for op, coeff in ops_to_evolve:
-            # add barriers
-            if first_barrier:
-                if self.insert_barriers:
-                    single_rep.barrier()
-            else:
-                first_barrier = True
-
-            single_rep.compose(self.atomic_evolution(op, coeff), wrap=True, inplace=True)
-
-        evolution_circuit = QuantumCircuit(operators[0].num_qubits)
-        first_barrier = False
-
-        for _ in range(self.reps):
-            # add barriers
-            if first_barrier:
-                if self.insert_barriers:
-                    single_rep.barrier()
-            else:
-                first_barrier = True
 
-            evolution_circuit.compose(single_rep, inplace=True)
+        for i, (op, coeff) in enumerate(ops_to_evolve):
+            self.atomic_evolution(single_rep, op, coeff)
+            if self.insert_barriers and i != len(ops_to_evolve) - 1:
+                single_rep.barrier()
 
-        return evolution_circuit
+        return single_rep.repeat(self.reps, insert_barriers=self.insert_barriers).decompose()
 
     @staticmethod
     def _recurse(order, time, pauli_list):

qiskit/synthesis/linear/__init__.py

@@ -18,6 +18,7 @@ from .linear_matrix_utils import (
     random_invertible_binary_matrix,
     calc_inverse_matrix,
     check_invertible_binary_matrix,
+    binary_matmul,
 )
 
 # This is re-import is kept for compatibility with Terra 0.23. Eligible for deprecation in 0.25+.

qiskit/synthesis/linear/cnot_synth.py

@@ -17,33 +17,37 @@ for optimal synthesis of linear (CNOT-only) reversible circuits.
 """
 
 from __future__ import annotations
-import copy
+
 import numpy as np
 from qiskit.circuit import QuantumCircuit
-from qiskit.exceptions import QiskitError
+
+from qiskit._accelerate.synthesis.linear import synth_cnot_count_full_pmh as fast_pmh
 
 
 def synth_cnot_count_full_pmh(
-    state: list[list[bool]] | np.ndarray[bool], section_size: int = 2
+    state: list[list[bool]] | np.ndarray[bool], section_size: int | None = None
 ) -> QuantumCircuit:
-    """
+    r"""
     Synthesize linear reversible circuits for all-to-all architecture
     using Patel, Markov and Hayes method.
 
     This function is an implementation of the Patel, Markov and Hayes algorithm from [1]
     for optimal synthesis of linear reversible circuits for all-to-all architecture,
-    as specified by an :math:`n \\times n` matrix.
+    as specified by an :math:`n \times n` matrix.
 
     Args:
-        state: :math:`n \\times n` boolean invertible matrix, describing
-            the state of the input circuit
+        state: :math:`n \times n` boolean invertible matrix, describing
+            the state of the input circuit.
         section_size: The size of each section in the Patel–Markov–Hayes algorithm [1].
+            If ``None`` it is chosen to be :math:`\max(2, \alpha\log_2(n))` with
+            :math:`\alpha = 0.56`, which approximately minimizes the upper bound on the number
+            of row operations given in [1] Eq. (3).
 
     Returns:
-        QuantumCircuit: a CX-only circuit implementing the linear transformation.
+        A CX-only circuit implementing the linear transformation.
 
     Raises:
-        QiskitError: when variable ``state`` isn't of type ``numpy.ndarray``
+        ValueError: When ``section_size`` is larger than the number of columns.
 
     References:
         1. Patel, Ketan N., Igor L. Markov, and John P. Hayes,
@@ -51,93 +55,15 @@ def synth_cnot_count_full_pmh(
            Quantum Information & Computation 8.3 (2008): 282-294.
            `arXiv:quant-ph/0302002 [quant-ph] <https://arxiv.org/abs/quant-ph/0302002>`_
     """
-    if not isinstance(state, (list, np.ndarray)):
-        raise QiskitError(
-            "state should be of type list or numpy.ndarray, "
-            "but was of the type {}".format(type(state))
+    normalized = np.asarray(state).astype(bool)
+    if section_size is not None and normalized.shape[1] < section_size:
+        raise ValueError(
+            f"The section_size ({section_size}) cannot be larger than the number of columns "
+            f"({normalized.shape[1]})."
         )
-    state = np.array(state)
-    # Synthesize lower triangular part
-    [state, circuit_l] = _lwr_cnot_synth(state, section_size)
-    state = np.transpose(state)
-    # Synthesize upper triangular part
-    [state, circuit_u] = _lwr_cnot_synth(state, section_size)
-    circuit_l.reverse()
-    for i in circuit_u:
-        i.reverse()
-    # Convert the list into a circuit of C-NOT gates
-    circ = QuantumCircuit(state.shape[0])
-    for i in circuit_u + circuit_l:
-        circ.cx(i[0], i[1])
-    return circ
-
-
-def _lwr_cnot_synth(state, section_size):
-    """
-    This function is a helper function of the algorithm for optimal synthesis
-    of linear reversible circuits (the Patel–Markov–Hayes algorithm). It works
-    like gaussian elimination, except that it works a lot faster, and requires
-    fewer steps (and therefore fewer CNOTs). It takes the matrix "state" and
-    splits it into sections of size section_size. Then it eliminates all non-zero
-    sub-rows within each section, which are the same as a non-zero sub-row
-    above. Once this has been done, it continues with normal gaussian elimination.
-    The benefit is that with small section sizes (m), most of the sub-rows will
-    be cleared in the first step, resulting in a factor m fewer row row operations
-    during Gaussian elimination.
 
-    The algorithm is described in detail in the following paper
-    "Optimal synthesis of linear reversible circuits."
-    Patel, Ketan N., Igor L. Markov, and John P. Hayes.
-    Quantum Information & Computation 8.3 (2008): 282-294.
-
-    Note:
-    This implementation tweaks the Patel, Markov, and Hayes algorithm by adding
-    a "back reduce" which adds rows below the pivot row with a high degree of
-    overlap back to it. The intuition is to avoid a high-weight pivot row
-    increasing the weight of lower rows.
-
-    Args:
-        state (ndarray): n x n matrix, describing a linear quantum circuit
-        section_size (int): the section size the matrix columns are divided into
-
-    Returns:
-        numpy.matrix: n by n matrix, describing the state of the output circuit
-        list: a k by 2 list of C-NOT operations that need to be applied
-    """
-    circuit = []
-    num_qubits = state.shape[0]
-    cutoff = 1
+    # call Rust implementation with normalized input
+    circuit_data = fast_pmh(normalized, section_size)
 
-    # Iterate over column sections
-    for sec in range(1, int(np.floor(num_qubits / section_size) + 1)):
-        # Remove duplicate sub-rows in section sec
-        patt = {}
-        for row in range((sec - 1) * section_size, num_qubits):
-            sub_row_patt = copy.deepcopy(state[row, (sec - 1) * section_size : sec * section_size])
-            if np.sum(sub_row_patt) == 0:
-                continue
-            if str(sub_row_patt) not in patt:
-                patt[str(sub_row_patt)] = row
-            else:
-                state[row, :] ^= state[patt[str(sub_row_patt)], :]
-                circuit.append([patt[str(sub_row_patt)], row])
-        # Use gaussian elimination for remaining entries in column section
-        for col in range((sec - 1) * section_size, sec * section_size):
-            # Check if 1 on diagonal
-            diag_one = 1
-            if state[col, col] == 0:
-                diag_one = 0
-            # Remove ones in rows below column col
-            for row in range(col + 1, num_qubits):
-                if state[row, col] == 1:
-                    if diag_one == 0:
-                        state[col, :] ^= state[row, :]
-                        circuit.append([row, col])
-                        diag_one = 1
-                    state[row, :] ^= state[col, :]
-                    circuit.append([col, row])
-                # Back reduce the pivot row using the current row
-                if sum(state[col, :] & state[row, :]) > cutoff:
-                    state[col, :] ^= state[row, :]
-                    circuit.append([row, col])
-    return [state, circuit]
+    # construct circuit from the data
+    return QuantumCircuit._from_circuit_data(circuit_data)

qiskit/synthesis/linear/linear_depth_lnn.py

@@ -28,15 +28,15 @@ from qiskit.circuit import QuantumCircuit
 from qiskit.synthesis.linear.linear_matrix_utils import (
     calc_inverse_matrix,
     check_invertible_binary_matrix,
-    _col_op,
-    _row_op,
+    col_op,
+    row_op,
 )
 
 
 def _row_op_update_instructions(cx_instructions, mat, a, b):
     # Add a cx gate to the instructions and update the matrix mat
     cx_instructions.append((a, b))
-    _row_op(mat, a, b)
+    row_op(mat, a, b)
 
 
 def _get_lower_triangular(n, mat, mat_inv):
@@ -62,7 +62,7 @@ def _get_lower_triangular(n, mat, mat_inv):
                     first_j = j
                 else:
                     # cx_instructions_cols (L instructions) are not needed
-                    _col_op(mat, j, first_j)
+                    col_op(mat, j, first_j)
         # Use row operations directed upwards to zero out all "1"s above the remaining "1" in row i
         for k in reversed(range(0, i)):
             if mat[k, first_j]:
@@ -70,8 +70,8 @@ def _get_lower_triangular(n, mat, mat_inv):
 
     # Apply only U instructions to get the permuted L
     for inst in cx_instructions_rows:
-        _row_op(mat_t, inst[0], inst[1])
-        _col_op(mat_inv_t, inst[0], inst[1])
+        row_op(mat_t, inst[0], inst[1])
+        col_op(mat_inv_t, inst[0], inst[1])
     return mat_t, mat_inv_t
 
 
@@ -210,7 +210,7 @@ def _north_west_to_identity(n, mat):
 def _optimize_cx_circ_depth_5n_line(mat):
     # Optimize CX circuit in depth bounded by 5n for LNN connectivity.
     # The algorithm [1] has two steps:
-    # a) transform the originl matrix to a north-west matrix (m2nw),
+    # a) transform the original matrix to a north-west matrix (m2nw),
     # b) transform the north-west matrix to identity (nw2id).
     #
     # A square n-by-n matrix A is called north-west if A[i][j]=0 for all i+j>=n
@@ -222,7 +222,7 @@ def _optimize_cx_circ_depth_5n_line(mat):
 
     # According to [1] the synthesis is done on the inverse matrix
     # so the matrix mat is inverted at this step
-    mat_inv = mat.copy()
+    mat_inv = mat.astype(bool, copy=True)
     mat_cpy = calc_inverse_matrix(mat_inv)
 
     n = len(mat_cpy)

qiskit/synthesis/linear/linear_matrix_utils.py

@@ -12,164 +12,16 @@
 
 """Utility functions for handling binary matrices."""
 
-from typing import Optional, Union
-import numpy as np
-from qiskit.exceptions import QiskitError
-
-
-def check_invertible_binary_matrix(mat: np.ndarray):
-    """Check that a binary matrix is invertible.
-
-    Args:
-        mat: a binary matrix.
-
-    Returns:
-        bool: True if mat in invertible and False otherwise.
-    """
-    if len(mat.shape) != 2 or mat.shape[0] != mat.shape[1]:
-        return False
-
-    rank = _compute_rank(mat)
-    return rank == mat.shape[0]
-
-
-def random_invertible_binary_matrix(
-    num_qubits: int, seed: Optional[Union[np.random.Generator, int]] = None
-):
-    """Generates a random invertible n x n binary matrix.
-
-    Args:
-        num_qubits: the matrix size.
-        seed: a random seed.
-
-    Returns:
-        np.ndarray: A random invertible binary matrix of size num_qubits.
-    """
-    if isinstance(seed, np.random.Generator):
-        rng = seed
-    else:
-        rng = np.random.default_rng(seed)
-
-    rank = 0
-    while rank != num_qubits:
-        mat = rng.integers(2, size=(num_qubits, num_qubits))
-        rank = _compute_rank(mat)
-    return mat
-
-
-def _gauss_elimination(mat, ncols=None, full_elim=False):
-    """Gauss elimination of a matrix mat with m rows and n columns.
-    If full_elim = True, it allows full elimination of mat[:, 0 : ncols]
-    Returns the matrix mat."""
-
-    mat, _ = _gauss_elimination_with_perm(mat, ncols, full_elim)
-    return mat
-
-
-def _gauss_elimination_with_perm(mat, ncols=None, full_elim=False):
-    """Gauss elimination of a matrix mat with m rows and n columns.
-    If full_elim = True, it allows full elimination of mat[:, 0 : ncols]
-    Returns the matrix mat, and the permutation perm that was done on the rows during the process.
-    perm[0 : rank] represents the indices of linearly independent rows in the original matrix."""
-
-    # Treat the matrix A as containing integer values
-    mat = np.array(mat, dtype=int, copy=True)
-
-    m = mat.shape[0]  # no. of rows
-    n = mat.shape[1]  # no. of columns
-    if ncols is not None:
-        n = min(n, ncols)  # no. of active columns
-
-    perm = np.array(range(m))  # permutation on the rows
-
-    r = 0  # current rank
-    k = 0  # current pivot column
-    while (r < m) and (k < n):
-        is_non_zero = False
-        new_r = r
-        for j in range(k, n):
-            for i in range(r, m):
-                if mat[i][j]:
-                    is_non_zero = True
-                    k = j
-                    new_r = i
-                    break
-            if is_non_zero:
-                break
-        if not is_non_zero:
-            return mat, perm  # A is in the canonical form
-
-        if new_r != r:
-            mat[[r, new_r]] = mat[[new_r, r]]
-            perm[r], perm[new_r] = perm[new_r], perm[r]
-
-        if full_elim:
-            for i in range(0, r):
-                if mat[i][k]:
-                    mat[i] = mat[i] ^ mat[r]
-
-        for i in range(r + 1, m):
-            if mat[i][k]:
-                mat[i] = mat[i] ^ mat[r]
-        r += 1
-
-    return mat, perm
-
-
-def calc_inverse_matrix(mat: np.ndarray, verify: bool = False):
-    """Given a square numpy(dtype=int) matrix mat, tries to compute its inverse.
-
-    Args:
-        mat: a boolean square matrix.
-        verify: if True asserts that the multiplication of mat and its inverse is the identity matrix.
-
-    Returns:
-        np.ndarray: the inverse matrix.
-
-    Raises:
-         QiskitError: if the matrix is not square.
-         QiskitError: if the matrix is not invertible.
-    """
-
-    if mat.shape[0] != mat.shape[1]:
-        raise QiskitError("Matrix to invert is a non-square matrix.")
-
-    n = mat.shape[0]
-    # concatenate the matrix and identity
-    mat1 = np.concatenate((mat, np.eye(n, dtype=int)), axis=1)
-    mat1 = _gauss_elimination(mat1, None, full_elim=True)
-
-    r = _compute_rank_after_gauss_elim(mat1[:, 0:n])
-
-    if r < n:
-        raise QiskitError("The matrix is not invertible.")
-
-    matinv = mat1[:, n : 2 * n]
-
-    if verify:
-        mat2 = np.dot(mat, matinv) % 2
-        assert np.array_equal(mat2, np.eye(n))
-
-    return matinv
-
-
-def _compute_rank_after_gauss_elim(mat):
-    """Given a matrix A after Gaussian elimination, computes its rank
-    (i.e. simply the number of nonzero rows)"""
-    return np.sum(mat.any(axis=1))
-
-
-def _compute_rank(mat):
-    """Given a matrix A computes its rank"""
-    mat = _gauss_elimination(mat)
-    return np.sum(mat.any(axis=1))
-
-
-def _row_op(mat, ctrl, trgt):
-    # Perform ROW operation on a matrix mat
-    mat[trgt] = mat[trgt] ^ mat[ctrl]
-
-
-def _col_op(mat, ctrl, trgt):
-    # Perform COL operation on a matrix mat
-    mat[:, ctrl] = mat[:, trgt] ^ mat[:, ctrl]
+# pylint: disable=unused-import
+from qiskit._accelerate.synthesis.linear import (
+    gauss_elimination,
+    gauss_elimination_with_perm,
+    compute_rank_after_gauss_elim,
+    compute_rank,
+    calc_inverse_matrix,
+    binary_matmul,
+    random_invertible_binary_matrix,
+    check_invertible_binary_matrix,
+    row_op,
+    col_op,
+)

qiskit/synthesis/linear_phase/cnot_phase_synth.py

@@ -123,7 +123,7 @@ def synth_cnot_phase_aam(
 
     # Implementation of the pseudo-code (Algorithm 1) in the aforementioned paper
     sta.append([cnots, range_list, epsilon])
-    while sta != []:
+    while sta:
         [cnots, ilist, qubit] = sta.pop()
         if cnots == []:
             continue

qiskit/synthesis/linear_phase/cx_cz_depth_lnn.py

@@ -39,7 +39,7 @@ from qiskit.synthesis.linear.linear_depth_lnn import _optimize_cx_circ_depth_5n_
 def _initialize_phase_schedule(mat_z):
     """
     Given a CZ layer (represented as an n*n CZ matrix Mz)
-    Return a scheudle of phase gates implementing Mz in a SWAP-only netwrok
+    Return a schedule of phase gates implementing Mz in a SWAP-only netwrok
     (c.f. Alg 1, [2])
     """
     n = len(mat_z)
@@ -173,7 +173,7 @@ def _apply_phase_to_nw_circuit(n, phase_schedule, seq, swap_plus):
                 of exactly n layers of boxes, each being either a SWAP or a SWAP+. That is,
                 each northwest diagonalization circuit can be uniquely represented by which
                 of its n(n-1)/2 boxes are SWAP+ and which are SWAP.
-    Return a QuantumCircuit that computes the phase scheudle S inside CX
+    Return a QuantumCircuit that computes the phase schedule S inside CX
     """
     cir = QuantumCircuit(n)
 
@@ -217,7 +217,7 @@ def _apply_phase_to_nw_circuit(n, phase_schedule, seq, swap_plus):
 
 def synth_cx_cz_depth_line_my(mat_x: np.ndarray, mat_z: np.ndarray) -> QuantumCircuit:
     """
-    Joint synthesis of a -CZ-CX- circuit for linear nearest neighbour (LNN) connectivity,
+    Joint synthesis of a -CZ-CX- circuit for linear nearest neighbor (LNN) connectivity,
     with 2-qubit depth at most 5n, based on Maslov and Yang.
     This method computes the CZ circuit inside the CX circuit via phase gate insertions.
 

qiskit/synthesis/linear_phase/cz_depth_lnn.py

@@ -119,7 +119,7 @@ def _create_patterns(n):
 
 
 def synth_cz_depth_line_mr(mat: np.ndarray) -> QuantumCircuit:
-    r"""Synthesis of a CZ circuit for linear nearest neighbour (LNN) connectivity,
+    r"""Synthesis of a CZ circuit for linear nearest neighbor (LNN) connectivity,
     based on Maslov and Roetteler.
 
     Note that this method *reverts* the order of qubits in the circuit,