qiskit 1.0.0b1__cp38-abi3-manylinux_2_17_aarch64.manylinux2014_aarch64.whl

qiskit/synthesis/evolution/product_formula.py

@@ -0,0 +1,328 @@
+# 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.
+
+"""A product formula base for decomposing non-commuting operator exponentials."""
+
+from typing import Callable, Optional, Union, Any, Dict
+from functools import partial
+import numpy as np
+from qiskit.circuit.parameterexpression import ParameterExpression
+from qiskit.circuit.quantumcircuit import QuantumCircuit
+from qiskit.quantum_info import SparsePauliOp, Pauli
+
+from .evolution_synthesis import EvolutionSynthesis
+
+
+class ProductFormula(EvolutionSynthesis):
+    """Product formula base class for the decomposition of non-commuting operator exponentials.
+
+    :obj:`.LieTrotter` and :obj:`.SuzukiTrotter` inherit from this class.
+    """
+
+    def __init__(
+        self,
+        order: int,
+        reps: int = 1,
+        insert_barriers: bool = False,
+        cx_structure: str = "chain",
+        atomic_evolution: Optional[
+            Callable[[Union[Pauli, SparsePauliOp], float], QuantumCircuit]
+        ] = None,
+    ) -> None:
+        """
+        Args:
+            order: The order of the product formula.
+            reps: The number of time steps.
+            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.
+        """
+        super().__init__()
+        self.order = order
+        self.reps = reps
+        self.insert_barriers = insert_barriers
+
+        # user-provided atomic evolution, stored for serialization
+        self._atomic_evolution = atomic_evolution
+        self._cx_structure = cx_structure
+
+        # if atomic evolution is not provided, set a default
+        if atomic_evolution is None:
+            atomic_evolution = partial(_default_atomic_evolution, cx_structure=cx_structure)
+
+        self.atomic_evolution = atomic_evolution
+
+    @property
+    def settings(self) -> Dict[str, Any]:
+        """Return the settings in a dictionary, which can be used to reconstruct the object.
+
+        Returns:
+            A dictionary containing the settings of this product formula.
+
+        Raises:
+            NotImplementedError: If a custom atomic evolution is set, which cannot be serialized.
+        """
+        if self._atomic_evolution is not None:
+            raise NotImplementedError(
+                "Cannot serialize a product formula with a custom atomic evolution."
+            )
+
+        return {
+            "order": self.order,
+            "reps": self.reps,
+            "insert_barriers": self.insert_barriers,
+            "cx_structure": self._cx_structure,
+        }
+
+
+def evolve_pauli(
+    pauli: Pauli,
+    time: Union[float, ParameterExpression] = 1.0,
+    cx_structure: str = "chain",
+    label: Optional[str] = None,
+) -> QuantumCircuit:
+    r"""Construct a circuit implementing the time evolution of a single Pauli string.
+
+    For a Pauli string :math:`P = \{I, X, Y, Z\}^{\otimes n}` on :math:`n` qubits and an
+    evolution time :math:`t`, the returned circuit implements the unitary operation
+
+    .. math::
+
+        U(t) = e^{-itP}.
+
+    Since only a single Pauli string is evolved the circuit decomposition is exact.
+
+    Args:
+        pauli: The Pauli to evolve.
+        time: The evolution time.
+        cx_structure: Determine the structure of CX gates, can be either "chain" for
+            next-neighbor connections or "fountain" to connect directly to the top qubit.
+        label: A label for the gate.
+
+    Returns:
+        A quantum circuit implementing the time evolution of the Pauli.
+    """
+    num_non_identity = len([label for label in pauli.to_label() if label != "I"])
+
+    # first check, if the Pauli is only the identity, in which case the evolution only
+    # adds a global phase
+    if num_non_identity == 0:
+        definition = QuantumCircuit(pauli.num_qubits, global_phase=-time)
+    # if we evolve on a single qubit, if yes use the corresponding qubit rotation
+    elif num_non_identity == 1:
+        definition = _single_qubit_evolution(pauli, time)
+    # same for two qubits, use Qiskit's native rotations
+    elif num_non_identity == 2:
+        definition = _two_qubit_evolution(pauli, time, cx_structure)
+    # otherwise do basis transformation and CX chains
+    else:
+        definition = _multi_qubit_evolution(pauli, time, cx_structure)
+
+    definition.name = f"exp(it {pauli.to_label()})"
+
+    return definition
+
+
+def _single_qubit_evolution(pauli, time):
+    definition = QuantumCircuit(pauli.num_qubits)
+    # Note that all phases are removed from the pauli label and are only in the coefficients.
+    # That's because the operators we evolved have all been translated to a SparsePauliOp.
+    for i, pauli_i in enumerate(reversed(pauli.to_label())):
+        if pauli_i == "X":
+            definition.rx(2 * time, i)
+        elif pauli_i == "Y":
+            definition.ry(2 * time, i)
+        elif pauli_i == "Z":
+            definition.rz(2 * time, i)
+
+    return definition
+
+
+def _two_qubit_evolution(pauli, time, cx_structure):
+    # Get the Paulis and the qubits they act on.
+    # Note that all phases are removed from the pauli label and are only in the coefficients.
+    # That's because the operators we evolved have all been translated to a SparsePauliOp.
+    labels_as_array = np.array(list(reversed(pauli.to_label())))
+    qubits = np.where(labels_as_array != "I")[0]
+    labels = np.array([labels_as_array[idx] for idx in qubits])
+
+    definition = QuantumCircuit(pauli.num_qubits)
+
+    # go through all cases we have implemented in Qiskit
+    if all(labels == "X"):  # RXX
+        definition.rxx(2 * time, qubits[0], qubits[1])
+    elif all(labels == "Y"):  # RYY
+        definition.ryy(2 * time, qubits[0], qubits[1])
+    elif all(labels == "Z"):  # RZZ
+        definition.rzz(2 * time, qubits[0], qubits[1])
+    elif labels[0] == "Z" and labels[1] == "X":  # RZX
+        definition.rzx(2 * time, qubits[0], qubits[1])
+    elif labels[0] == "X" and labels[1] == "Z":  # RXZ
+        definition.rzx(2 * time, qubits[1], qubits[0])
+    else:  # all the others are not native in Qiskit, so use default the decomposition
+        definition = _multi_qubit_evolution(pauli, time, cx_structure)
+
+    return definition
+
+
+def _multi_qubit_evolution(pauli, time, cx_structure):
+    # get diagonalizing clifford
+    cliff = diagonalizing_clifford(pauli)
+
+    # get CX chain to reduce the evolution to the top qubit
+    if cx_structure == "chain":
+        chain = cnot_chain(pauli)
+    else:
+        chain = cnot_fountain(pauli)
+
+    # determine qubit to do the rotation on
+    target = None
+    # Note that all phases are removed from the pauli label and are only in the coefficients.
+    # That's because the operators we evolved have all been translated to a SparsePauliOp.
+    for i, pauli_i in enumerate(reversed(pauli.to_label())):
+        if pauli_i != "I":
+            target = i
+            break
+
+    # build the evolution as: diagonalization, reduction, 1q evolution, followed by inverses
+    definition = QuantumCircuit(pauli.num_qubits)
+    definition.compose(cliff, inplace=True)
+    definition.compose(chain, inplace=True)
+    definition.rz(2 * time, target)
+    definition.compose(chain.inverse(), inplace=True)
+    definition.compose(cliff.inverse(), inplace=True)
+
+    return definition
+
+
+def diagonalizing_clifford(pauli: Pauli) -> QuantumCircuit:
+    """Get the clifford circuit to diagonalize the Pauli operator.
+
+    Args:
+        pauli: The Pauli to diagonalize.
+
+    Returns:
+        A circuit to diagonalize.
+    """
+    cliff = QuantumCircuit(pauli.num_qubits)
+    for i, pauli_i in enumerate(reversed(pauli.to_label())):
+        if pauli_i == "Y":
+            cliff.sdg(i)
+        if pauli_i in ["X", "Y"]:
+            cliff.h(i)
+
+    return cliff
+
+
+def cnot_chain(pauli: Pauli) -> QuantumCircuit:
+    """CX chain.
+
+    For example, for the Pauli with the label 'XYZIX'.
+
+    .. parsed-literal::
+
+                       ┌───┐
+        q_0: ──────────┤ X ├
+                       └─┬─┘
+        q_1: ────────────┼──
+                  ┌───┐  │
+        q_2: ─────┤ X ├──■──
+             ┌───┐└─┬─┘
+        q_3: ┤ X ├──■───────
+             └─┬─┘
+        q_4: ──■────────────
+
+    Args:
+        pauli: The Pauli for which to construct the CX chain.
+
+    Returns:
+        A circuit implementing the CX chain.
+    """
+
+    chain = QuantumCircuit(pauli.num_qubits)
+    control, target = None, None
+
+    # iterate over the Pauli's and add CNOTs
+    for i, pauli_i in enumerate(pauli.to_label()):
+        i = pauli.num_qubits - i - 1
+        if pauli_i != "I":
+            if control is None:
+                control = i
+            else:
+                target = i
+
+        if control is not None and target is not None:
+            chain.cx(control, target)
+            control = i
+            target = None
+
+    return chain
+
+
+def cnot_fountain(pauli: Pauli) -> QuantumCircuit:
+    """CX chain in the fountain shape.
+
+    For example, for the Pauli with the label 'XYZIX'.
+
+    .. parsed-literal::
+
+             ┌───┐┌───┐┌───┐
+        q_0: ┤ X ├┤ X ├┤ X ├
+             └─┬─┘└─┬─┘└─┬─┘
+        q_1: ──┼────┼────┼──
+               │    │    │
+        q_2: ──■────┼────┼──
+                    │    │
+        q_3: ───────■────┼──
+                         │
+        q_4: ────────────■──
+
+    Args:
+        pauli: The Pauli for which to construct the CX chain.
+
+    Returns:
+        A circuit implementing the CX chain.
+    """
+
+    chain = QuantumCircuit(pauli.num_qubits)
+    control, target = None, None
+    for i, pauli_i in enumerate(reversed(pauli.to_label())):
+        if pauli_i != "I":
+            if target is None:
+                target = i
+            else:
+                control = i
+
+        if control is not None and target is not None:
+            chain.cx(control, target)
+            control = None
+
+    return chain
+
+
+def _default_atomic_evolution(operator, time, cx_structure):
+    if isinstance(operator, Pauli):
+        # single Pauli operator: just exponentiate it
+        evolution_circuit = evolve_pauli(operator, time, cx_structure)
+    else:
+        # sum of Pauli operators: exponentiate each term (this assumes they commute)
+        pauli_list = [(Pauli(op), np.real(coeff)) for op, coeff in operator.to_list()]
+        name = f"exp(it {[pauli.to_label() for pauli, _ in pauli_list]})"
+        evolution_circuit = QuantumCircuit(operator.num_qubits, name=name)
+        for pauli, coeff in pauli_list:
+            evolution_circuit.compose(evolve_pauli(pauli, coeff * time, cx_structure), inplace=True)
+
+    return evolution_circuit

qiskit/synthesis/evolution/qdrift.py

@@ -0,0 +1,102 @@
+# 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.
+
+"""QDrift Class"""
+
+from typing import Union, Optional, Callable
+import numpy as np
+from qiskit.circuit.quantumcircuit import QuantumCircuit
+from qiskit.quantum_info.operators import SparsePauliOp, Pauli
+
+from .product_formula import ProductFormula
+from .lie_trotter import LieTrotter
+
+
+class QDrift(ProductFormula):
+    r"""The QDrift Trotterization method, which selects each each term in the
+    Trotterization randomly, with a probability proportional to its weight. Based on the work
+    of Earl Campbell in Ref. [1].
+
+    References:
+        [1]: E. Campbell, "A random compiler for fast Hamiltonian simulation" (2018).
+        `arXiv:quant-ph/1811.08017 <https://arxiv.org/abs/1811.08017>`_
+    """
+
+    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,
+    ) -> None:
+        r"""
+        Args:
+            reps: The number of times to repeat the Trotterization circuit.
+            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.
+            seed: An optional seed for reproducibility of the random sampling process.
+        """
+        super().__init__(1, reps, insert_barriers, cx_structure, atomic_evolution)
+        self.sampled_ops = None
+        self.rng = np.random.default_rng(seed)
+
+    def synthesize(self, evolution):
+        # get operators and time to evolve
+        operators = evolution.operator
+        time = evolution.time
+
+        if not isinstance(operators, list):
+            pauli_list = [(Pauli(op), coeff) for op, coeff in operators.to_list()]
+            coeffs = [np.real(coeff) for op, coeff in operators.to_list()]
+        else:
+            pauli_list = [(op, 1) for op in operators]
+            coeffs = [1 for op in operators]
+
+        # We artificially make the weights positive
+        weights = np.abs(coeffs)
+        lambd = np.sum(weights)
+
+        num_gates = int(np.ceil(2 * (lambd**2) * (time**2) * self.reps))
+        # The protocol calls for the removal of the individual coefficients,
+        # and multiplication by a constant evolution time.
+        evolution_time = lambd * time / num_gates
+
+        self.sampled_ops = self.rng.choice(
+            np.array(pauli_list, dtype=object),
+            size=(num_gates,),
+            p=weights / lambd,
+        )
+        # Update the coefficients of sampled_ops
+        self.sampled_ops = [(op, evolution_time) for op, coeff in self.sampled_ops]
+
+        # pylint: disable=cyclic-import
+        from qiskit.circuit.library.pauli_evolution import PauliEvolutionGate
+
+        # Build the evolution circuit using the LieTrotter synthesis with the sampled operators
+        lie_trotter = LieTrotter(
+            insert_barriers=self.insert_barriers, atomic_evolution=self.atomic_evolution
+        )
+        evolution_circuit = PauliEvolutionGate(
+            sum(SparsePauliOp(op) for op, coeff in self.sampled_ops),
+            time=evolution_time,
+            synthesis=lie_trotter,
+        ).definition
+
+        return evolution_circuit

qiskit/synthesis/evolution/suzuki_trotter.py

@@ -0,0 +1,145 @@
+# 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.
+
+"""The Suzuki-Trotter product formula."""
+
+from typing import Callable, Optional, Union
+
+import numpy as np
+
+from qiskit.circuit.quantumcircuit import QuantumCircuit
+from qiskit.quantum_info.operators import SparsePauliOp, Pauli
+
+
+from .product_formula import ProductFormula
+
+
+class SuzukiTrotter(ProductFormula):
+    r"""The (higher order) Suzuki-Trotter product formula.
+
+    The Suzuki-Trotter formulas improve the error of the Lie-Trotter approximation.
+    For example, the second order decomposition is
+
+    .. math::
+
+        e^{A + B} \approx e^{B/2} e^{A} e^{B/2}.
+
+    Higher order decompositions are based on recursions, see Ref. [1] for more details.
+
+    In this implementation, the operators are provided as sum terms of a Pauli operator.
+    For example, in the second order Suzuki-Trotter decomposition we approximate
+
+    .. math::
+
+        e^{-it(XX + ZZ)} = e^{-it/2 ZZ}e^{-it XX}e^{-it/2 ZZ} + \mathcal{O}(t^3).
+
+    References:
+        [1]: D. Berry, G. Ahokas, R. Cleve and B. Sanders,
+        "Efficient quantum algorithms for simulating sparse Hamiltonians" (2006).
+        `arXiv:quant-ph/0508139 <https://arxiv.org/abs/quant-ph/0508139>`_
+        [2]: N. Hatano and M. Suzuki,
+        "Finding Exponential Product Formulas of Higher Orders" (2005).
+        `arXiv:math-ph/0506007 <https://arxiv.org/pdf/math-ph/0506007.pdf>`_
+    """
+
+    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,
+    ) -> None:
+        """
+        Args:
+            order: The order of the product formula.
+            reps: The number of time steps.
+            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.
+        Raises:
+            ValueError: If order is not even
+        """
+
+        if order % 2 == 1:
+            raise ValueError(
+                "Suzuki product formulae are symmetric and therefore only defined "
+                "for even orders."
+            )
+        super().__init__(order, reps, insert_barriers, cx_structure, atomic_evolution)
+
+    def synthesize(self, evolution):
+        # get operators and time to evolve
+        operators = evolution.operator
+        time = evolution.time
+
+        if not isinstance(operators, list):
+            pauli_list = [(Pauli(op), np.real(coeff)) for op, coeff in operators.to_list()]
+        else:
+            pauli_list = [(op, 1) for op in operators]
+
+        ops_to_evolve = self._recurse(self.order, time / self.reps, pauli_list)
+
+        # 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)
+
+        return evolution_circuit
+
+    @staticmethod
+    def _recurse(order, time, pauli_list):
+        if order == 1:
+            return pauli_list
+
+        elif order == 2:
+            halves = [(op, coeff * time / 2) for op, coeff in pauli_list[:-1]]
+            full = [(pauli_list[-1][0], time * pauli_list[-1][1])]
+            return halves + full + list(reversed(halves))
+
+        else:
+            reduction = 1 / (4 - 4 ** (1 / (order - 1)))
+            outer = 2 * SuzukiTrotter._recurse(
+                order - 2, time=reduction * time, pauli_list=pauli_list
+            )
+            inner = SuzukiTrotter._recurse(
+                order - 2, time=(1 - 4 * reduction) * time, pauli_list=pauli_list
+            )
+            return outer + inner + outer

qiskit/synthesis/linear/__init__.py

@@ -0,0 +1,25 @@
+# This code is part of Qiskit.
+#
+# (C) Copyright IBM 2017 - 2023.
+#
+# 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.
+
+"""Module containing cnot circuits"""
+
+from .cnot_synth import synth_cnot_count_full_pmh
+from .linear_depth_lnn import synth_cnot_depth_line_kms
+from .linear_matrix_utils import (
+    random_invertible_binary_matrix,
+    calc_inverse_matrix,
+    check_invertible_binary_matrix,
+)
+
+# This is re-import is kept for compatibility with Terra 0.23. Eligible for deprecation in 0.25+.
+# pylint: disable=cyclic-import,wrong-import-order
+from qiskit.synthesis.linear_phase import synth_cnot_phase_aam as graysynth