qiskit 2.0.3__cp39-abi3-manylinux2014_aarch64.manylinux_2_17_aarch64.whl

qiskit/synthesis/two_qubit/two_qubit_decompose.py

@@ -0,0 +1,583 @@
+# This code is part of Qiskit.
+#
+# (C) Copyright IBM 2017, 2024.
+#
+# 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.
+
+# pylint: disable=invalid-name
+
+"""
+Expand 2-qubit Unitary operators into an equivalent
+decomposition over SU(2)+fixed 2q basis gate, using the KAK method.
+
+May be exact or approximate expansion. In either case uses the minimal
+number of basis applications.
+
+Method is described in Appendix B of Cross, A. W., Bishop, L. S., Sheldon, S., Nation, P. D. &
+Gambetta, J. M. Validating quantum computers using randomized model circuits.
+arXiv:1811.12926 [quant-ph] (2018).
+"""
+from __future__ import annotations
+import io
+import base64
+import warnings
+from typing import Optional, Type, TYPE_CHECKING
+
+import logging
+
+import numpy as np
+
+from qiskit.circuit import QuantumRegister, QuantumCircuit, Gate, CircuitInstruction
+from qiskit.circuit.library.standard_gates import (
+    CXGate,
+    U3Gate,
+    U2Gate,
+    U1Gate,
+    UGate,
+    PhaseGate,
+    RXGate,
+    RYGate,
+    RZGate,
+    SXGate,
+    XGate,
+    RGate,
+)
+from qiskit.exceptions import QiskitError
+from qiskit.quantum_info.operators import Operator
+from qiskit.synthesis.one_qubit.one_qubit_decompose import (
+    DEFAULT_ATOL,
+)
+from qiskit.utils.deprecation import deprecate_func
+from qiskit._accelerate import two_qubit_decompose
+
+if TYPE_CHECKING:
+    from qiskit.dagcircuit.dagcircuit import DAGCircuit, DAGOpNode
+
+logger = logging.getLogger(__name__)
+
+
+GATE_NAME_MAP = {
+    "cx": CXGate,
+    "rx": RXGate,
+    "sx": SXGate,
+    "x": XGate,
+    "rz": RZGate,
+    "u": UGate,
+    "p": PhaseGate,
+    "u1": U1Gate,
+    "u2": U2Gate,
+    "u3": U3Gate,
+    "ry": RYGate,
+    "r": RGate,
+}
+
+
+def decompose_two_qubit_product_gate(special_unitary_matrix: np.ndarray):
+    r"""Decompose :math:`U = U_l \otimes U_r` where :math:`U \in SU(4)`,
+    and :math:`U_l,~U_r \in SU(2)`.
+
+    Args:
+        special_unitary_matrix: special unitary matrix to decompose
+    Raises:
+        QiskitError: if decomposition isn't possible.
+    """
+    special_unitary_matrix = np.asarray(special_unitary_matrix, dtype=complex)
+    (L, R, phase) = two_qubit_decompose.decompose_two_qubit_product_gate(special_unitary_matrix)
+
+    temp = np.kron(L, R)
+    deviation = abs(abs(temp.conj().T.dot(special_unitary_matrix).trace()) - 4)
+
+    if deviation > 1.0e-13:
+        raise QiskitError(
+            "decompose_two_qubit_product_gate: decomposition failed: "
+            f"deviation too large: {deviation}"
+        )
+
+    return (L, R, phase)
+
+
+class TwoQubitWeylDecomposition:
+    r"""Two-qubit Weyl decomposition.
+
+    Decompose two-qubit unitary
+
+    .. math::
+
+        U = ({K_1}^l \otimes {K_1}^r) e^{(i a XX + i b YY + i c ZZ)} ({K_2}^l \otimes {K_2}^r)
+
+    where
+
+    .. math::
+
+        U \in U(4),~
+        {K_1}^l, {K_1}^r, {K_2}^l, {K_2}^r \in SU(2)
+
+    and we stay in the "Weyl Chamber"
+
+    .. math::
+
+        \pi /4 \geq a \geq b \geq |c|
+
+    This class avoids some problems of numerical instability near high-symmetry loci within the Weyl
+    chamber. If there is a high-symmetry gate "nearby" (in terms of the requested average gate fidelity),
+    then it return a canonicalized decomposition of that high-symmetry gate.
+
+    References:
+        1. Cross, A. W., Bishop, L. S., Sheldon, S., Nation, P. D. & Gambetta, J. M.,
+           *Validating quantum computers using randomized model circuits*,
+           `arXiv:1811.12926 [quant-ph] <https://arxiv.org/abs/1811.12926>`_
+        2. B. Kraus, J. I. Cirac, *Optimal Creation of Entanglement Using a Two-Qubit Gate*,
+           `arXiv:0011050 [quant-ph] <https://arxiv.org/abs/quant-ph/0011050>`_
+        3. B. Drury, P. J. Love, *Constructive Quantum Shannon Decomposition from Cartan
+           Involutions*, `arXiv:0806.4015 [quant-ph] <https://arxiv.org/abs/0806.4015>`_
+
+    """
+
+    # The parameters of the decomposition:
+    a: float
+    b: float
+    c: float
+    global_phase: float
+    K1l: np.ndarray
+    K2l: np.ndarray
+    K1r: np.ndarray
+    K2r: np.ndarray
+
+    unitary_matrix: np.ndarray  # The unitary that was input
+    requested_fidelity: Optional[float]  # None means no automatic specialization
+    calculated_fidelity: float  # Fidelity after specialization
+
+    _specializations = two_qubit_decompose.Specialization
+
+    def __init__(
+        self,
+        unitary_matrix: np.ndarray,
+        fidelity: float | None = 1.0 - 1.0e-9,
+        *,
+        _specialization: two_qubit_decompose.Specialization | None = None,
+    ):
+        unitary_matrix = np.asarray(unitary_matrix, dtype=complex)
+        self._inner_decomposition = two_qubit_decompose.TwoQubitWeylDecomposition(
+            unitary_matrix, fidelity=fidelity, _specialization=_specialization
+        )
+        self.a = self._inner_decomposition.a
+        self.b = self._inner_decomposition.b
+        self.c = self._inner_decomposition.c
+        self.global_phase = self._inner_decomposition.global_phase
+        self.K1l = self._inner_decomposition.K1l
+        self.K1r = self._inner_decomposition.K1r
+        self.K2l = self._inner_decomposition.K2l
+        self.K2r = self._inner_decomposition.K2r
+        self.unitary_matrix = unitary_matrix
+        self.requested_fidelity = fidelity
+        self.calculated_fidelity = self._inner_decomposition.calculated_fidelity
+        if logger.isEnabledFor(logging.DEBUG):
+            actual_fidelity = self.actual_fidelity()
+            logger.debug(
+                "Requested fidelity: %s calculated fidelity: %s actual fidelity %s",
+                self.requested_fidelity,
+                self.calculated_fidelity,
+                actual_fidelity,
+            )
+            if abs(self.calculated_fidelity - actual_fidelity) > 1.0e-12:
+                logger.warning(
+                    "Requested fidelity different from actual by %s",
+                    self.calculated_fidelity - actual_fidelity,
+                )
+
+    @deprecate_func(since="1.1.0", removal_timeline="in the 2.0.0 release")
+    def specialize(self):
+        """Make changes to the decomposition to comply with any specializations.
+
+        This method will always raise a ``NotImplementedError`` because
+        there are no specializations to comply with in the current implementation.
+        """
+        raise NotImplementedError
+
+    def circuit(
+        self, *, euler_basis: str | None = None, simplify: bool = False, atol: float = DEFAULT_ATOL
+    ) -> QuantumCircuit:
+        """Returns Weyl decomposition in circuit form."""
+        circuit_data = self._inner_decomposition.circuit(
+            euler_basis=euler_basis, simplify=simplify, atol=atol
+        )
+        return QuantumCircuit._from_circuit_data(circuit_data, add_regs=True)
+
+    def actual_fidelity(self, **kwargs) -> float:
+        """Calculates the actual fidelity of the decomposed circuit to the input unitary."""
+        circ = self.circuit(**kwargs)
+        trace = np.trace(Operator(circ).data.T.conj() @ self.unitary_matrix)
+        return two_qubit_decompose.trace_to_fid(trace)
+
+    def __repr__(self):
+        """Represent with enough precision to allow copy-paste debugging of all corner cases"""
+        prefix = f"{type(self).__qualname__}.from_bytes("
+        with io.BytesIO() as f:
+            np.save(f, self.unitary_matrix, allow_pickle=False)
+            b64 = base64.encodebytes(f.getvalue()).splitlines()
+        b64ascii = [repr(x) for x in b64]
+        b64ascii[-1] += ","
+        pretty = [f"# {x.rstrip()}" for x in str(self).splitlines()]
+        indent = "\n" + " " * 4
+        specialization_variant = str(self._inner_decomposition.specialization).split(".")[1]
+        specialization_repr = f"{type(self).__qualname__}._specializations.{specialization_variant}"
+        lines = (
+            [prefix]
+            + pretty
+            + b64ascii
+            + [
+                f"requested_fidelity={self.requested_fidelity},",
+                f"_specialization={specialization_repr},",
+                f"calculated_fidelity={self.calculated_fidelity},",
+                f"actual_fidelity={self.actual_fidelity()},",
+                f"abc={(self.a, self.b, self.c)})",
+            ]
+        )
+        return indent.join(lines)
+
+    @classmethod
+    def from_bytes(
+        cls,
+        bytes_in: bytes,
+        *,
+        requested_fidelity: float,
+        _specialization: two_qubit_decompose.Specialization | None = None,
+        **kwargs,
+    ) -> "TwoQubitWeylDecomposition":
+        """Decode bytes into :class:`.TwoQubitWeylDecomposition`."""
+        # Used by __repr__
+        del kwargs  # Unused (just for display)
+        b64 = base64.decodebytes(bytes_in)
+        with io.BytesIO(b64) as f:
+            arr = np.load(f, allow_pickle=False)
+        return cls(arr, fidelity=requested_fidelity, _specialization=_specialization)
+
+    def __str__(self):
+        specialization = str(self._inner_decomposition.specialization).split(".")[1]
+        pre = f"{self.__class__.__name__} [specialization={specialization}] (\n\t"
+        circ_indent = "\n\t".join(self.circuit(simplify=True).draw("text").lines(-1))
+        return f"{pre}{circ_indent}\n)"
+
+
+class TwoQubitControlledUDecomposer:
+    r"""Decompose two-qubit unitary in terms of a desired
+    :math:`U \sim U_d(\alpha, 0, 0) \sim \text{Ctrl-U}`
+    gate that is locally equivalent to an :class:`.RXXGate`."""
+
+    def __init__(self, rxx_equivalent_gate: Type[Gate], euler_basis: str = "ZXZ"):
+        r"""Initialize the KAK decomposition.
+
+        Args:
+            rxx_equivalent_gate: Gate that is locally equivalent to an :class:`.RXXGate`:
+                :math:`U \sim U_d(\alpha, 0, 0) \sim \text{Ctrl-U}` gate.
+                Valid options are [:class:`.RZZGate`, :class:`.RXXGate`, :class:`.RYYGate`,
+                :class:`.RZXGate`, :class:`.CPhaseGate`, :class:`.CRXGate`, :class:`.CRYGate`,
+                :class:`.CRZGate`].
+            euler_basis: Basis string to be provided to :class:`.OneQubitEulerDecomposer`
+                for 1Q synthesis.
+                Valid options are [``'ZXZ'``, ``'ZYZ'``, ``'XYX'``, ``'XZX'``, ``'U'``, ``'U3'``,
+                ``'U321'``, ``'U1X'``, ``'PSX'``, ``'ZSX'``, ``'ZSXX'``, ``'RR'``].
+
+        Raises:
+            QiskitError: If the gate is not locally equivalent to an :class:`.RXXGate`.
+        """
+        if rxx_equivalent_gate._standard_gate is not None:
+            self._inner_decomposer = two_qubit_decompose.TwoQubitControlledUDecomposer(
+                rxx_equivalent_gate._standard_gate, euler_basis
+            )
+            self.gate_name = rxx_equivalent_gate._standard_gate.name
+        else:
+            self._inner_decomposer = two_qubit_decompose.TwoQubitControlledUDecomposer(
+                rxx_equivalent_gate, euler_basis
+            )
+        self.rxx_equivalent_gate = rxx_equivalent_gate
+        self.scale = self._inner_decomposer.scale
+        self.euler_basis = euler_basis
+
+    def __call__(
+        self, unitary: Operator | np.ndarray, approximate=False, use_dag=False, *, atol=DEFAULT_ATOL
+    ) -> QuantumCircuit:
+        """Returns the Weyl decomposition in circuit form.
+
+        Args:
+            unitary (Operator or ndarray): :math:`4 \times 4` unitary to synthesize.
+
+        Returns:
+            QuantumCircuit: Synthesized quantum circuit.
+
+        Note: atol is passed to OneQubitEulerDecomposer.
+        """
+        circ_data = self._inner_decomposer(np.asarray(unitary, dtype=complex), atol)
+        return QuantumCircuit._from_circuit_data(circ_data, add_regs=True)
+
+
+class TwoQubitBasisDecomposer:
+    """A class for decomposing 2-qubit unitaries into minimal number of uses of a 2-qubit
+    basis gate.
+
+    Args:
+        gate: Two-qubit gate to be used in the KAK decomposition.
+        basis_fidelity: Fidelity to be assumed for applications of KAK Gate. Defaults to ``1.0``.
+        euler_basis: Basis string to be provided to :class:`.OneQubitEulerDecomposer` for 1Q synthesis.
+            Valid options are [``'ZYZ'``, ``'ZXZ'``, ``'XYX'``, ``'U'``, ``'U3'``, ``'U1X'``,
+            ``'PSX'``, ``'ZSX'``, ``'RR'``].
+        pulse_optimize: If ``True``, try to do decomposition which minimizes
+            local unitaries in between entangling gates. This will raise an exception if an
+            optimal decomposition is not implemented. Currently, only [{CX, SX, RZ}] is known.
+            If ``False``, don't attempt optimization. If ``None``, attempt optimization but don't raise
+            if unknown.
+
+
+    .. automethod:: __call__
+    """
+
+    def __init__(
+        self,
+        gate: Gate,
+        basis_fidelity: float = 1.0,
+        euler_basis: str = "U",
+        pulse_optimize: bool | None = None,
+    ):
+        self.gate = gate
+        self.basis_fidelity = basis_fidelity
+        self.pulse_optimize = pulse_optimize
+        # Use cx as gate name for pulse optimal decomposition detection
+        # otherwise use USER_GATE as a unique key to support custom gates
+        # including parameterized gates like UnitaryGate.
+        if isinstance(gate, CXGate):
+            gate_name = "cx"
+        else:
+            gate_name = "USER_GATE"
+        self.gate_name = gate_name
+
+        self._inner_decomposer = two_qubit_decompose.TwoQubitBasisDecomposer(
+            gate_name,
+            Operator(gate).data,
+            basis_fidelity=basis_fidelity,
+            euler_basis=euler_basis,
+            pulse_optimize=pulse_optimize,
+        )
+        self.is_supercontrolled = self._inner_decomposer.super_controlled
+        if not self.is_supercontrolled:
+            warnings.warn(
+                "Only know how to decompose properly for a supercontrolled basis gate.",
+                stacklevel=2,
+            )
+
+    def num_basis_gates(self, unitary):
+        """Computes the number of basis gates needed in
+        a decomposition of input unitary
+        """
+        unitary = np.asarray(unitary, dtype=complex)
+        return self._inner_decomposer.num_basis_gates(unitary)
+
+    @staticmethod
+    def decomp0(target):
+        r"""
+        Decompose target :math:`\sim U_d(x, y, z)` with :math:`0` uses of the basis gate.
+        Result :math:`U_r` has trace:
+
+        .. math::
+
+            \Big\vert\text{Tr}(U_r\cdot U_\text{target}^{\dag})\Big\vert =
+            4\Big\vert (\cos(x)\cos(y)\cos(z)+ j \sin(x)\sin(y)\sin(z)\Big\vert
+
+        which is optimal for all targets and bases
+        """
+
+        return two_qubit_decompose.TwoQubitBasisDecomposer.decomp0(target)
+
+    def decomp1(self, target):
+        r"""Decompose target :math:`\sim U_d(x, y, z)` with :math:`1` use of the basis gate
+        :math:`\sim U_d(a, b, c)`.
+        Result :math:`U_r` has trace:
+
+        .. math::
+
+            \Big\vert\text{Tr}(U_r \cdot U_\text{target}^{\dag})\Big\vert =
+            4\Big\vert \cos(x-a)\cos(y-b)\cos(z-c) + j \sin(x-a)\sin(y-b)\sin(z-c)\Big\vert
+
+        which is optimal for all targets and bases with ``z==0`` or ``c==0``.
+        """
+        return self._inner_decomposer.decomp1(target)
+
+    def decomp2_supercontrolled(self, target):
+        r"""
+        Decompose target :math:`\sim U_d(x, y, z)` with :math:`2` uses of the basis gate.
+
+        For supercontrolled basis :math:`\sim U_d(\pi/4, b, 0)`, all b, result :math:`U_r` has trace
+
+        .. math::
+
+            \Big\vert\text{Tr}(U_r \cdot U_\text{target}^\dag) \Big\vert = 4\cos(z)
+
+        which is the optimal approximation for basis of CNOT-class :math:`\sim U_d(\pi/4, 0, 0)`
+        or DCNOT-class :math:`\sim U_d(\pi/4, \pi/4, 0)` and any target. It may
+        be sub-optimal for :math:`b \neq 0` (i.e. there exists an exact decomposition for any target
+        using :math:`B \sim U_d(\pi/4, \pi/8, 0)`, but it may not be this decomposition).
+        This is an exact decomposition for supercontrolled basis and target :math:`\sim U_d(x, y, 0)`.
+        No guarantees for non-supercontrolled basis.
+        """
+        return self._inner_decomposer.decomp2_supercontrolled(target)
+
+    def decomp3_supercontrolled(self, target):
+        r"""
+        Decompose target with :math:`3` uses of the basis.
+        This is an exact decomposition for supercontrolled basis :math:`\sim U_d(\pi/4, b, 0)`, all b,
+        and any target. No guarantees for non-supercontrolled basis.
+        """
+        return self._inner_decomposer.decomp3_supercontrolled(target)
+
+    def __call__(
+        self,
+        unitary: Operator | np.ndarray,
+        basis_fidelity: float | None = None,
+        approximate: bool = True,
+        use_dag: bool = False,
+        *,
+        _num_basis_uses: int | None = None,
+    ) -> QuantumCircuit | DAGCircuit:
+        r"""Decompose a two-qubit ``unitary`` over fixed basis and :math:`SU(2)` using the best
+        approximation given that each basis application has a finite ``basis_fidelity``.
+
+        Args:
+            unitary (Operator or ndarray): :math:`4 \times 4` unitary to synthesize.
+            basis_fidelity (float or None): Fidelity to be assumed for applications of KAK Gate.
+                If given, overrides ``basis_fidelity`` given at init.
+            approximate (bool): Approximates if basis fidelities are less than 1.0.
+            use_dag (bool): If true a :class:`.DAGCircuit` is returned instead of a
+                :class:`QuantumCircuit` when this class is called.
+            _num_basis_uses (int): force a particular approximation by passing a number in [0, 3].
+
+        Returns:
+            QuantumCircuit: Synthesized quantum circuit.
+
+        Raises:
+            QiskitError: if ``pulse_optimize`` is True but we don't know how to do it.
+        """
+
+        if use_dag:
+            from qiskit.dagcircuit.dagcircuit import DAGCircuit
+            from qiskit.dagcircuit.dagnode import DAGOpNode
+
+            sequence = self._inner_decomposer(
+                np.asarray(unitary, dtype=complex),
+                basis_fidelity,
+                approximate,
+                _num_basis_uses=_num_basis_uses,
+            )
+            q = QuantumRegister(2)
+
+            dag = DAGCircuit()
+            dag.global_phase = sequence.global_phase
+            dag.add_qreg(q)
+            for gate, params, qubits in sequence:
+                if gate is None:
+                    dag.apply_operation_back(self.gate, tuple(q[x] for x in qubits), check=False)
+                else:
+                    op = CircuitInstruction.from_standard(
+                        gate, qubits=tuple(q[x] for x in qubits), params=params
+                    )
+                    node = DAGOpNode.from_instruction(op)
+                    dag._apply_op_node_back(node)
+            return dag
+        else:
+            if getattr(self.gate, "_standard_gate", None):
+                circ_data = self._inner_decomposer.to_circuit(
+                    np.asarray(unitary, dtype=complex),
+                    self.gate,
+                    basis_fidelity,
+                    approximate,
+                    _num_basis_uses=_num_basis_uses,
+                )
+                return QuantumCircuit._from_circuit_data(circ_data, add_regs=True)
+            else:
+                sequence = self._inner_decomposer(
+                    np.asarray(unitary, dtype=complex),
+                    basis_fidelity,
+                    approximate,
+                    _num_basis_uses=_num_basis_uses,
+                )
+                q = QuantumRegister(2)
+                circ = QuantumCircuit(q, global_phase=sequence.global_phase)
+                for gate, params, qubits in sequence:
+                    if gate is None:
+                        circ._append(self.gate, qargs=tuple(q[x] for x in qubits))
+                    else:
+                        inst = CircuitInstruction.from_standard(
+                            gate, qubits=tuple(q[x] for x in qubits), params=params
+                        )
+                        circ._append(inst)
+                return circ
+
+    def traces(self, target):
+        r"""
+        Give the expected traces :math:`\Big\vert\text{Tr}(U \cdot U_\text{target}^{\dag})\Big\vert`
+        for a different number of basis gates.
+        """
+        return self._inner_decomposer.traces(target._inner_decomposition)
+
+
+# This weird duplicated lazy structure is for backwards compatibility; Qiskit has historically
+# always made ``two_qubit_cnot_decompose`` available publicly immediately on import, but it's quite
+# expensive to construct, and we want to defer the object's creation until it's actually used.  We
+# only need to pass through the public methods that take `self` as a parameter.  Using `__getattr__`
+# doesn't work because it is only called if the normal resolution methods fail.  Using
+# `__getattribute__` is too messy for a simple one-off use object.
+
+
+class _LazyTwoQubitCXDecomposer(TwoQubitBasisDecomposer):
+    __slots__ = ("_inner",)
+
+    def __init__(self):  # pylint: disable=super-init-not-called
+        self._inner = None
+
+    def _load(self):
+        if self._inner is None:
+            self._inner = TwoQubitBasisDecomposer(CXGate())
+
+    def __call__(self, *args, **kwargs) -> QuantumCircuit:
+        self._load()
+        return self._inner(*args, **kwargs)
+
+    def traces(self, target):
+        self._load()
+        return self._inner.traces(target)
+
+    def decomp1(self, target):
+        self._load()
+        return self._inner.decomp1(target)
+
+    def decomp2_supercontrolled(self, target):
+        self._load()
+        return self._inner.decomp2_supercontrolled(target)
+
+    def decomp3_supercontrolled(self, target):
+        self._load()
+        return self._inner.decomp3_supercontrolled(target)
+
+    def num_basis_gates(self, unitary):
+        self._load()
+        return self._inner.num_basis_gates(unitary)
+
+
+two_qubit_cnot_decompose = _LazyTwoQubitCXDecomposer()
+"""
+This is an instance of :class:`.TwoQubitBasisDecomposer` that always uses
+``cx`` as the KAK gate for the basis decomposition. You can use this function
+as a quick access to ``cx``-based 2-qubit decompositions.
+
+Args:
+    unitary (Operator or np.ndarray): The 4x4 unitary to synthesize.
+    basis_fidelity (float or None): If given the assumed fidelity for applications of :class:`.CXGate`.
+    approximate (bool): If ``True`` approximate if ``basis_fidelity`` is less than 1.0.
+
+Returns:
+    QuantumCircuit: The synthesized circuit of the input unitary.
+"""

qiskit/synthesis/two_qubit/xx_decompose/__init__.py

@@ -0,0 +1,19 @@
+# This code is part of Qiskit.
+#
+# (C) Copyright IBM 2021
+#
+# 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.
+
+"""
+Submodule symbol exports for XX decomposition.
+"""
+
+from __future__ import annotations
+from .decomposer import XXDecomposer
+from .embodiments import XXEmbodiments