qiskit 2.0.3__cp39-abi3-manylinux2014_aarch64.manylinux_2_17_aarch64.whl

qiskit/synthesis/unitary/aqc/fast_gradient/layer.py

@@ -0,0 +1,370 @@
+# This code is part of Qiskit.
+#
+# (C) Copyright IBM 2022.
+#
+# This code is licensed under the Apache License, Version 2.0. You may
+# obtain a copy of this license in the LICENSE.txt file in the root directory
+# of this source tree or at http://www.apache.org/licenses/LICENSE-2.0.
+#
+# Any modifications or derivative works of this code must retain this
+# copyright notice, and modified files need to carry a notice indicating
+# that they have been altered from the originals.
+
+"""
+Layer classes for the fast gradient implementation.
+"""
+from __future__ import annotations
+from abc import abstractmethod, ABC
+from typing import Optional
+import numpy as np
+from .fast_grad_utils import (
+    bit_permutation_1q,
+    reverse_bits,
+    inverse_permutation,
+    bit_permutation_2q,
+    make_rz,
+    make_ry,
+)
+
+
+class LayerBase(ABC):
+    """
+    Base class for any layer implementation. Each layer here is represented
+    by a 2x2 or 4x4 gate matrix ``G`` (applied to 1 or 2 qubits respectively)
+    interleaved with the identity ones:
+    ``Layer = I kron I kron ... kron G kron ... kron I kron I``
+    """
+
+    @abstractmethod
+    def set_from_matrix(self, mat: np.ndarray):
+        """
+        Updates this layer from an external gate matrix.
+
+        Args:
+            mat: external gate matrix that initializes this layer's one.
+        """
+        raise NotImplementedError()
+
+    @abstractmethod
+    def get_attr(self) -> tuple[np.ndarray, np.ndarray, np.ndarray]:
+        """
+        Returns gate matrix, direct and inverse permutations.
+
+        Returns:
+            (1) gate matrix; (2) direct permutation; (3) inverse permutations.
+        """
+        raise NotImplementedError()
+
+
+class Layer1Q(LayerBase):
+    """
+    Layer represents a simple circuit where 1-qubit gate matrix (of size 2x2)
+    interleaves with the identity ones.
+    """
+
+    def __init__(self, num_qubits: int, k: int, g2x2: Optional[np.ndarray] = None):
+        """
+        Args:
+            num_qubits: number of qubits.
+            k: index of the bit where gate is applied.
+            g2x2: 2x2 matrix that makes up this layer along with identity ones,
+                  or None (should be set up later).
+        """
+        super().__init__()
+
+        # 2x2 gate matrix (1-qubit gate).
+        self._gmat = np.full((2, 2), fill_value=0, dtype=np.complex128)
+        if isinstance(g2x2, np.ndarray):
+            np.copyto(self._gmat, g2x2)
+
+        bit_flip = True
+        dim = 2**num_qubits
+        row_perm = reverse_bits(
+            bit_permutation_1q(n=num_qubits, k=k), nbits=num_qubits, enable=bit_flip
+        )
+        col_perm = reverse_bits(np.arange(dim, dtype=np.int64), nbits=num_qubits, enable=bit_flip)
+        self._perm = np.full((dim,), fill_value=0, dtype=np.int64)
+        self._perm[row_perm] = col_perm
+        self._inv_perm = inverse_permutation(self._perm)
+
+    def set_from_matrix(self, mat: np.ndarray):
+        """See base class description."""
+        np.copyto(self._gmat, mat)
+
+    def get_attr(self) -> tuple[np.ndarray, np.ndarray, np.ndarray]:
+        """See base class description."""
+        return self._gmat, self._perm, self._inv_perm
+
+
+class Layer2Q(LayerBase):
+    """
+    Layer represents a simple circuit where 2-qubit gate matrix (of size 4x4)
+    interleaves with the identity ones.
+    """
+
+    def __init__(self, num_qubits: int, j: int, k: int, g4x4: Optional[np.ndarray] = None):
+        """
+        Args:
+            num_qubits: number of qubits.
+            j: index of the first (control) bit.
+            k: index of the second (target) bit.
+            g4x4: 4x4 matrix that makes up this layer along with identity ones,
+                  or None (should be set up later).
+        """
+        super().__init__()
+
+        # 4x4 gate matrix (2-qubit gate).
+        self._gmat = np.full((4, 4), fill_value=0, dtype=np.complex128)
+        if isinstance(g4x4, np.ndarray):
+            np.copyto(self._gmat, g4x4)
+
+        bit_flip = True
+        dim = 2**num_qubits
+        row_perm = reverse_bits(
+            bit_permutation_2q(n=num_qubits, j=j, k=k), nbits=num_qubits, enable=bit_flip
+        )
+        col_perm = reverse_bits(np.arange(dim, dtype=np.int64), nbits=num_qubits, enable=bit_flip)
+        self._perm = np.full((dim,), fill_value=0, dtype=np.int64)
+        self._perm[row_perm] = col_perm
+        self._inv_perm = inverse_permutation(self._perm)
+
+    def set_from_matrix(self, mat: np.ndarray):
+        """See base class description."""
+        np.copyto(self._gmat, mat)
+
+    def get_attr(self) -> tuple[np.ndarray, np.ndarray, np.ndarray]:
+        """See base class description."""
+        return self._gmat, self._perm, self._inv_perm
+
+
+def init_layer1q_matrices(thetas: np.ndarray, dst: np.ndarray) -> np.ndarray:
+    """
+    Initializes 4x4 matrices of 2-qubit gates defined in the paper.
+
+    Args:
+        thetas: depth x 4 matrix of gate parameters for every layer, where
+                "depth" is the number of layers.
+        dst: destination array of size depth x 4 x 4 that will receive gate
+             matrices of each layer.
+
+    Returns:
+        Returns the "dst" array.
+    """
+    n = thetas.shape[0]
+    tmp = np.full((4, 2, 2), fill_value=0, dtype=np.complex128)
+    for k in range(n):
+        th = thetas[k]
+        a = make_rz(th[0], out=tmp[0])
+        b = make_ry(th[1], out=tmp[1])
+        c = make_rz(th[2], out=tmp[2])
+        np.dot(np.dot(a, b, out=tmp[3]), c, out=dst[k])
+    return dst
+
+
+def init_layer1q_deriv_matrices(thetas: np.ndarray, dst: np.ndarray) -> np.ndarray:
+    """
+    Initializes 4x4 derivative matrices of 2-qubit gates defined in the paper.
+
+    Args:
+        thetas: depth x 4 matrix of gate parameters for every layer, where
+                "depth" is the number of layers.
+        dst: destination array of size depth x 4 x 4 x 4 that will receive gate
+             derivative matrices of each layer; there are 4 parameters per gate,
+             hence, 4 derivative matrices per layer.
+
+    Returns:
+        Returns the "dst" array.
+    """
+    n = thetas.shape[0]
+    y = np.asarray([[0, -0.5], [0.5, 0]], dtype=np.complex128)
+    z = np.asarray([[-0.5j, 0], [0, 0.5j]], dtype=np.complex128)
+    tmp = np.full((5, 2, 2), fill_value=0, dtype=np.complex128)
+    for k in range(n):
+        th = thetas[k]
+        a = make_rz(th[0], out=tmp[0])
+        b = make_ry(th[1], out=tmp[1])
+        c = make_rz(th[2], out=tmp[2])
+
+        za = np.dot(z, a, out=tmp[3])
+        np.dot(np.dot(za, b, out=tmp[4]), c, out=dst[k, 0])
+        yb = np.dot(y, b, out=tmp[3])
+        np.dot(a, np.dot(yb, c, out=tmp[4]), out=dst[k, 1])
+        zc = np.dot(z, c, out=tmp[3])
+        np.dot(a, np.dot(b, zc, out=tmp[4]), out=dst[k, 2])
+    return dst
+
+
+def init_layer2q_matrices(thetas: np.ndarray, dst: np.ndarray) -> np.ndarray:
+    """
+    Initializes 4x4 matrices of 2-qubit gates defined in the paper.
+
+    Args:
+        thetas: depth x 4 matrix of gate parameters for every layer, where
+                "depth" is the number of layers.
+        dst: destination array of size depth x 4 x 4 that will receive gate
+             matrices of each layer.
+
+    Returns:
+        Returns the "dst" array.
+    """
+    depth = thetas.shape[0]
+    for k in range(depth):
+        th = thetas[k]
+        cs0 = np.cos(0.5 * th[0]).item()
+        sn0 = np.sin(0.5 * th[0]).item()
+        ep1 = np.exp(0.5j * th[1]).item()
+        en1 = np.exp(-0.5j * th[1]).item()
+        cs2 = np.cos(0.5 * th[2]).item()
+        sn2 = np.sin(0.5 * th[2]).item()
+        cs3 = np.cos(0.5 * th[3]).item()
+        sn3 = np.sin(0.5 * th[3]).item()
+        ep1cs0 = ep1 * cs0
+        ep1sn0 = ep1 * sn0
+        en1cs0 = en1 * cs0
+        en1sn0 = en1 * sn0
+        sn2cs3 = sn2 * cs3
+        sn2sn3 = sn2 * sn3
+        cs2cs3 = cs2 * cs3
+        sn3cs2j = 1j * sn3 * cs2
+        sn2sn3j = 1j * sn2sn3
+
+        flat_dst = dst[k].ravel()
+        flat_dst[:] = [
+            -(sn2sn3j - cs2cs3) * en1cs0,
+            -(sn2cs3 + sn3cs2j) * en1cs0,
+            (sn2cs3 + sn3cs2j) * en1sn0,
+            (sn2sn3j - cs2cs3) * en1sn0,
+            (sn2cs3 - sn3cs2j) * en1cs0,
+            (sn2sn3j + cs2cs3) * en1cs0,
+            -(sn2sn3j + cs2cs3) * en1sn0,
+            (-sn2cs3 + sn3cs2j) * en1sn0,
+            (-sn2sn3j + cs2cs3) * ep1sn0,
+            -(sn2cs3 + sn3cs2j) * ep1sn0,
+            -(sn2cs3 + sn3cs2j) * ep1cs0,
+            (-sn2sn3j + cs2cs3) * ep1cs0,
+            (sn2cs3 - sn3cs2j) * ep1sn0,
+            (sn2sn3j + cs2cs3) * ep1sn0,
+            (sn2sn3j + cs2cs3) * ep1cs0,
+            (sn2cs3 - sn3cs2j) * ep1cs0,
+        ]
+    return dst
+
+
+def init_layer2q_deriv_matrices(thetas: np.ndarray, dst: np.ndarray) -> np.ndarray:
+    """
+    Initializes 4 x 4 derivative matrices of 2-qubit gates defined in the paper.
+
+    Args:
+        thetas: depth x 4 matrix of gate parameters for every layer, where
+                "depth" is the number of layers.
+        dst: destination array of size depth x 4 x 4 x 4 that will receive gate
+             derivative matrices of each layer; there are 4 parameters per gate,
+             hence, 4 derivative matrices per layer.
+
+    Returns:
+        Returns the "dst" array.
+    """
+    depth = thetas.shape[0]
+    for k in range(depth):
+        th = thetas[k]
+        cs0 = np.cos(0.5 * th[0]).item()
+        sn0 = np.sin(0.5 * th[0]).item()
+        ep1 = np.exp(0.5j * th[1]).item() * 0.5
+        en1 = np.exp(-0.5j * th[1]).item() * 0.5
+        cs2 = np.cos(0.5 * th[2]).item()
+        sn2 = np.sin(0.5 * th[2]).item()
+        cs3 = np.cos(0.5 * th[3]).item()
+        sn3 = np.sin(0.5 * th[3]).item()
+        ep1cs0 = ep1 * cs0
+        ep1sn0 = ep1 * sn0
+        en1cs0 = en1 * cs0
+        en1sn0 = en1 * sn0
+        sn2cs3 = sn2 * cs3
+        sn2sn3 = sn2 * sn3
+        sn3cs2 = sn3 * cs2
+        cs2cs3 = cs2 * cs3
+        sn2cs3j = 1j * sn2cs3
+        sn2sn3j = 1j * sn2sn3
+        sn3cs2j = 1j * sn3cs2
+        cs2cs3j = 1j * cs2cs3
+
+        flat_dst = dst[k, 0].ravel()
+        flat_dst[:] = [
+            (sn2sn3j - cs2cs3) * en1sn0,
+            (sn2cs3 + sn3cs2j) * en1sn0,
+            (sn2cs3 + sn3cs2j) * en1cs0,
+            (sn2sn3j - cs2cs3) * en1cs0,
+            (-sn2cs3 + sn3cs2j) * en1sn0,
+            -(sn2sn3j + cs2cs3) * en1sn0,
+            -(sn2sn3j + cs2cs3) * en1cs0,
+            (-sn2cs3 + sn3cs2j) * en1cs0,
+            (-sn2sn3j + cs2cs3) * ep1cs0,
+            -(sn2cs3 + sn3cs2j) * ep1cs0,
+            (sn2cs3 + sn3cs2j) * ep1sn0,
+            (sn2sn3j - cs2cs3) * ep1sn0,
+            (sn2cs3 - sn3cs2j) * ep1cs0,
+            (sn2sn3j + cs2cs3) * ep1cs0,
+            -(sn2sn3j + cs2cs3) * ep1sn0,
+            (-sn2cs3 + sn3cs2j) * ep1sn0,
+        ]
+
+        flat_dst = dst[k, 1].ravel()
+        flat_dst[:] = [
+            -(sn2sn3 + cs2cs3j) * en1cs0,
+            (sn2cs3j - sn3cs2) * en1cs0,
+            -(sn2cs3j - sn3cs2) * en1sn0,
+            (sn2sn3 + cs2cs3j) * en1sn0,
+            -(sn2cs3j + sn3cs2) * en1cs0,
+            (sn2sn3 - cs2cs3j) * en1cs0,
+            (-sn2sn3 + cs2cs3j) * en1sn0,
+            (sn2cs3j + sn3cs2) * en1sn0,
+            (sn2sn3 + cs2cs3j) * ep1sn0,
+            (-sn2cs3j + sn3cs2) * ep1sn0,
+            (-sn2cs3j + sn3cs2) * ep1cs0,
+            (sn2sn3 + cs2cs3j) * ep1cs0,
+            (sn2cs3j + sn3cs2) * ep1sn0,
+            (-sn2sn3 + cs2cs3j) * ep1sn0,
+            (-sn2sn3 + cs2cs3j) * ep1cs0,
+            (sn2cs3j + sn3cs2) * ep1cs0,
+        ]
+
+        flat_dst = dst[k, 2].ravel()
+        flat_dst[:] = [
+            -(sn2cs3 + sn3cs2j) * en1cs0,
+            (sn2sn3j - cs2cs3) * en1cs0,
+            -(sn2sn3j - cs2cs3) * en1sn0,
+            (sn2cs3 + sn3cs2j) * en1sn0,
+            (sn2sn3j + cs2cs3) * en1cs0,
+            (-sn2cs3 + sn3cs2j) * en1cs0,
+            (sn2cs3 - sn3cs2j) * en1sn0,
+            -(sn2sn3j + cs2cs3) * en1sn0,
+            -(sn2cs3 + sn3cs2j) * ep1sn0,
+            (sn2sn3j - cs2cs3) * ep1sn0,
+            (sn2sn3j - cs2cs3) * ep1cs0,
+            -(sn2cs3 + sn3cs2j) * ep1cs0,
+            (sn2sn3j + cs2cs3) * ep1sn0,
+            (-sn2cs3 + sn3cs2j) * ep1sn0,
+            (-sn2cs3 + sn3cs2j) * ep1cs0,
+            (sn2sn3j + cs2cs3) * ep1cs0,
+        ]
+
+        flat_dst = dst[k, 3].ravel()
+        flat_dst[:] = [
+            -(sn2cs3j + sn3cs2) * en1cs0,
+            (sn2sn3 - cs2cs3j) * en1cs0,
+            (-sn2sn3 + cs2cs3j) * en1sn0,
+            (sn2cs3j + sn3cs2) * en1sn0,
+            -(sn2sn3 + cs2cs3j) * en1cs0,
+            (sn2cs3j - sn3cs2) * en1cs0,
+            -(sn2cs3j - sn3cs2) * en1sn0,
+            (sn2sn3 + cs2cs3j) * en1sn0,
+            -(sn2cs3j + sn3cs2) * ep1sn0,
+            (sn2sn3 - cs2cs3j) * ep1sn0,
+            (sn2sn3 - cs2cs3j) * ep1cs0,
+            -(sn2cs3j + sn3cs2) * ep1cs0,
+            -(sn2sn3 + cs2cs3j) * ep1sn0,
+            (sn2cs3j - sn3cs2) * ep1sn0,
+            (sn2cs3j - sn3cs2) * ep1cs0,
+            -(sn2sn3 + cs2cs3j) * ep1cs0,
+        ]
+    return dst

qiskit/synthesis/unitary/aqc/fast_gradient/pmatrix.py

@@ -0,0 +1,312 @@
+# This code is part of Qiskit.
+#
+# (C) Copyright IBM 2022.
+#
+# This code is licensed under the Apache License, Version 2.0. You may
+# obtain a copy of this license in the LICENSE.txt file in the root directory
+# of this source tree or at http://www.apache.org/licenses/LICENSE-2.0.
+#
+# Any modifications or derivative works of this code must retain this
+# copyright notice, and modified files need to carry a notice indicating
+# that they have been altered from the originals.
+
+"""
+Matrix designed for fast multiplication by permutation and block-diagonal ones.
+"""
+
+import numpy as np
+from .layer import Layer1Q, Layer2Q
+
+
+class PMatrix:
+    """
+    Wrapper around a matrix that enables fast multiplication by permutation
+    matrices and block-diagonal ones.
+    """
+
+    def __init__(self, num_qubits: int):
+        """
+        Initializes the internal structures of this object but does not set
+        the matrix yet.
+
+        Args:
+            num_qubits: number of qubits.
+        """
+        dim = 2**num_qubits
+        self._mat = np.empty(0)
+        self._dim = dim
+        self._temp_g2x2 = np.zeros((2, 2), dtype=np.complex128)
+        self._temp_g4x4 = np.zeros((4, 4), dtype=np.complex128)
+        self._temp_2x2 = self._temp_g2x2.copy()
+        self._temp_4x4 = self._temp_g4x4.copy()
+        self._identity_perm = np.arange(dim, dtype=np.int64)
+        self._left_perm = self._identity_perm.copy()
+        self._right_perm = self._identity_perm.copy()
+        self._temp_perm = self._identity_perm.copy()
+        self._temp_slice_dim_x_2 = np.zeros((dim, 2), dtype=np.complex128)
+        self._temp_slice_dim_x_4 = np.zeros((dim, 4), dtype=np.complex128)
+        self._idx_mat = self._init_index_matrix(dim)
+        self._temp_block_diag = np.zeros(self._idx_mat.shape, dtype=np.complex128)
+
+    def set_matrix(self, mat: np.ndarray):
+        """
+        Copies specified matrix to internal storage. Once the matrix
+        is set, the object is ready for use.
+
+        **Note**, the matrix will be copied, mind the size issues.
+
+        Args:
+            mat: matrix we want to multiply on the left and on the right by
+                 layer matrices.
+        """
+        if self._mat.size == 0:
+            self._mat = mat.copy()
+        else:
+            np.copyto(self._mat, mat)
+
+    @staticmethod
+    def _init_index_matrix(dim: int) -> np.ndarray:
+        """
+        Fast multiplication can be implemented by picking up a subset of
+        entries in a sparse matrix.
+
+        Args:
+            dim: problem dimensionality.
+
+        Returns:
+            2d-array of indices for the fast multiplication.
+        """
+        all_idx = np.arange(dim * dim, dtype=np.int64).reshape(dim, dim)
+        idx = np.full((dim // 4, 4 * 4), fill_value=0, dtype=np.int64)
+        b = np.full((4, 4), fill_value=0, dtype=np.int64)
+        for i in range(0, dim, 4):
+            b[:, :] = all_idx[i : i + 4, i : i + 4]
+            idx[i // 4, :] = b.T.ravel()
+        return idx
+
+    def mul_right_q1(self, layer: Layer1Q, temp_mat: np.ndarray, dagger: bool):
+        """
+        Multiplies ``NxN`` matrix, wrapped by this object, by a 1-qubit layer
+        matrix of the right, where ``N`` is the actual size of matrices involved,
+        ``N = 2^{num. of qubits}``.
+
+        Args:
+            layer: 1-qubit layer, i.e. the layer with just one non-trivial
+                   1-qubit gate and other gates are just identity operators.
+            temp_mat: a temporary NxN matrix used as a workspace.
+            dagger: if true, the right-hand side matrix will be taken as
+                    conjugate transposed.
+        """
+
+        gmat, perm, inv_perm = layer.get_attr()
+        mat = self._mat
+        dim = perm.size
+
+        # temp_mat <-- mat[:, right_perm[perm]] = mat[:, right_perm][:, perm]:
+        np.take(mat, np.take(self._right_perm, perm, out=self._temp_perm), axis=1, out=temp_mat)
+
+        # mat <-- mat[:, right_perm][:, perm] @ kron(I(N/4), gmat)^dagger, where
+        # conjugate-transposition might be or might be not applied:
+        gmat_right = np.conj(gmat, out=self._temp_g2x2).T if dagger else gmat
+        for i in range(0, dim, 2):
+            mat[:, i : i + 2] = np.dot(
+                temp_mat[:, i : i + 2], gmat_right, out=self._temp_slice_dim_x_2
+            )
+
+        # Update right permutation:
+        self._right_perm[:] = inv_perm
+
+    def mul_right_q2(self, layer: Layer2Q, temp_mat: np.ndarray, dagger: bool = True):
+        """
+        Multiplies ``NxN`` matrix, wrapped by this object, by a 2-qubit layer
+        matrix on the right, where ``N`` is the actual size of matrices involved,
+        ``N = 2^{num. of qubits}``.
+
+        Args:
+            layer: 2-qubit layer, i.e. the layer with just one non-trivial
+                   2-qubit gate and other gates are just identity operators.
+            temp_mat: a temporary NxN matrix used as a workspace.
+            dagger: if true, the right-hand side matrix will be taken as
+                    conjugate transposed.
+        """
+
+        gmat, perm, inv_perm = layer.get_attr()
+        mat = self._mat
+        dim = perm.size
+
+        # temp_mat <-- mat[:, right_perm[perm]] = mat[:, right_perm][:, perm]:
+        np.take(mat, np.take(self._right_perm, perm, out=self._temp_perm), axis=1, out=temp_mat)
+
+        # mat <-- mat[:, right_perm][:, perm] @ kron(I(N/4), gmat)^dagger, where
+        # conjugate-transposition might be or might be not applied:
+        gmat_right = np.conj(gmat, out=self._temp_g4x4).T if dagger else gmat
+        for i in range(0, dim, 4):
+            mat[:, i : i + 4] = np.dot(
+                temp_mat[:, i : i + 4], gmat_right, out=self._temp_slice_dim_x_4
+            )
+
+        # Update right permutation:
+        self._right_perm[:] = inv_perm
+
+    def mul_left_q1(self, layer: Layer1Q, temp_mat: np.ndarray):
+        """
+        Multiplies ``NxN`` matrix, wrapped by this object, by a 1-qubit layer
+        matrix of the left, where ``dim`` is the actual size of matrices involved,
+        ``dim = 2^{num. of qubits}``.
+
+        Args:
+            layer: 1-qubit layer, i.e. the layer with just one non-trivial
+                   1-qubit gate and other gates are just identity operators.
+            temp_mat: a temporary NxN matrix used as a workspace.
+        """
+        mat = self._mat
+        gmat, perm, inv_perm = layer.get_attr()
+        dim = perm.size
+
+        # temp_mat <-- mat[left_perm[perm]] = mat[left_perm][perm]:
+        np.take(mat, np.take(self._left_perm, perm, out=self._temp_perm), axis=0, out=temp_mat)
+
+        # mat <-- kron(I(dim/4), gmat) @ mat[left_perm][perm]:
+        if dim > 512:
+            # Faster for large matrices.
+            for i in range(0, dim, 2):
+                np.dot(gmat, temp_mat[i : i + 2, :], out=mat[i : i + 2, :])
+        else:
+            # Faster for small matrices.
+            half = dim // 2
+            np.copyto(
+                mat.reshape((2, half, dim)), np.swapaxes(temp_mat.reshape((half, 2, dim)), 0, 1)
+            )
+            np.dot(gmat, mat.reshape(2, -1), out=temp_mat.reshape(2, -1))
+            np.copyto(
+                mat.reshape((half, 2, dim)), np.swapaxes(temp_mat.reshape((2, half, dim)), 0, 1)
+            )
+
+        # Update left permutation:
+        self._left_perm[:] = inv_perm
+
+    def mul_left_q2(self, layer: Layer2Q, temp_mat: np.ndarray):
+        """
+        Multiplies ``NxN`` matrix, wrapped by this object, by a 2-qubit layer
+        matrix on the left, where ``dim`` is the actual size of matrices involved,
+        ``dim = 2^{num. of qubits}``.
+
+        Args:
+            layer: 2-qubit layer, i.e. the layer with just one non-trivial
+                   2-qubit gate and other gates are just identity operators.
+            temp_mat: a temporary NxN matrix used as a workspace.
+        """
+        mat = self._mat
+        gmat, perm, inv_perm = layer.get_attr()
+        dim = perm.size
+
+        # temp_mat <-- mat[left_perm[perm]] = mat[left_perm][perm]:
+        np.take(mat, np.take(self._left_perm, perm, out=self._temp_perm), axis=0, out=temp_mat)
+
+        # mat <-- kron(I(dim/4), gmat) @ mat[left_perm][perm]:
+        if dim > 512:
+            # Faster for large matrices.
+            for i in range(0, dim, 4):
+                np.dot(gmat, temp_mat[i : i + 4, :], out=mat[i : i + 4, :])
+        else:
+            # Faster for small matrices.
+            half = dim // 4
+            np.copyto(
+                mat.reshape((4, half, dim)), np.swapaxes(temp_mat.reshape((half, 4, dim)), 0, 1)
+            )
+            np.dot(gmat, mat.reshape(4, -1), out=temp_mat.reshape(4, -1))
+            np.copyto(
+                mat.reshape((half, 4, dim)), np.swapaxes(temp_mat.reshape((4, half, dim)), 0, 1)
+            )
+
+        # Update left permutation:
+        self._left_perm[:] = inv_perm
+
+    def product_q1(self, layer: Layer1Q, tmp1: np.ndarray, tmp2: np.ndarray) -> np.complex128:
+        """
+        Computes and returns: ``Trace(mat @ C) = Trace(mat @ P^T @ gmat @ P) =
+        Trace((P @ mat @ P^T) @ gmat) = Trace(C @ (P @ mat @ P^T)) =
+        vec(gmat^T)^T @ vec(P @ mat @ P^T)``, where mat is ``NxN`` matrix wrapped
+        by this object, ``C`` is matrix representation of the layer ``L``, and gmat
+        is 2x2 matrix of underlying 1-qubit gate.
+
+        **Note**: matrix of this class must be finalized beforehand.
+
+        Args:
+            layer: 1-qubit layer.
+            tmp1: temporary, external matrix used as a workspace.
+            tmp2: temporary, external matrix used as a workspace.
+
+        Returns:
+            trace of the matrix product.
+        """
+        mat = self._mat
+        gmat, perm, _ = layer.get_attr()
+
+        # tmp2 = P @ mat @ P^T:
+        np.take(np.take(mat, perm, axis=0, out=tmp1), perm, axis=1, out=tmp2)
+
+        # matrix dot product = Tr(transposed(kron(I(dim/4), gmat)), (P @ mat @ P^T)):
+        gmat_t, tmp3 = self._temp_g2x2, self._temp_2x2
+        np.copyto(gmat_t, gmat.T)
+        _sum = 0.0
+        for i in range(0, mat.shape[0], 2):
+            tmp3[:, :] = tmp2[i : i + 2, i : i + 2]
+            _sum += np.dot(gmat_t.ravel(), tmp3.ravel())
+
+        return np.complex128(_sum)
+
+    def product_q2(self, layer: Layer2Q, tmp1: np.ndarray, tmp2: np.ndarray) -> np.complex128:
+        """
+        Computes and returns: ``Trace(mat @ C) = Trace(mat @ P^T @ gmat @ P) =
+        Trace((P @ mat @ P^T) @ gmat) = Trace(C @ (P @ mat @ P^T)) =
+        vec(gmat^T)^T @ vec(P @ mat @ P^T)``, where mat is ``NxN`` matrix wrapped
+        by this object, ``C`` is matrix representation of the layer ``L``, and gmat
+        is 4x4 matrix of underlying 2-qubit gate.
+
+        **Note**: matrix of this class must be finalized beforehand.
+
+        Args:
+            layer: 2-qubit layer.
+            tmp1: temporary, external matrix used as a workspace.
+            tmp2: temporary, external matrix used as a workspace.
+
+        Returns:
+            trace of the matrix product.
+        """
+        mat = self._mat
+        gmat, perm, _ = layer.get_attr()
+
+        # Compute the matrix dot product:
+        # Tr(transposed(kron(I(dim/4), gmat)), (P @ mat @ P^T)):
+
+        # The fastest version so far, but requires two NxN temp. matrices.
+        # tmp2 = P @ mat @ P^T:
+        np.take(np.take(mat, perm, axis=0, out=tmp1), perm, axis=1, out=tmp2)
+
+        bldia = self._temp_block_diag
+        np.take(tmp2.ravel(), self._idx_mat.ravel(), axis=0, out=bldia.ravel())
+        bldia *= gmat.reshape(-1, gmat.size)
+        return np.complex128(np.sum(bldia))
+
+    def finalize(self, temp_mat: np.ndarray) -> np.ndarray:
+        """
+        Applies the left (row) and right (column) permutations to the matrix.
+        at the end of computation process.
+
+        Args:
+            temp_mat: temporary, external matrix.
+
+        Returns:
+            finalized matrix with all transformations applied.
+        """
+        mat = self._mat
+
+        # mat <-- mat[left_perm][:, right_perm] = P_left @ mat @ transposed(P_right)
+        np.take(mat, self._left_perm, axis=0, out=temp_mat)
+        np.take(temp_mat, self._right_perm, axis=1, out=mat)
+
+        # Set both permutations to identity once they have been applied.
+        self._left_perm[:] = self._identity_perm
+        self._right_perm[:] = self._identity_perm
+        return self._mat