qiskit 1.3.0b1__cp39-abi3-macosx_10_9_x86_64.whl

qiskit/circuit/library/generalized_gates/unitary.py

@@ -0,0 +1,215 @@
+# 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.
+
+"""Arbitrary unitary circuit instruction."""
+
+from __future__ import annotations
+import math
+
+import typing
+import numpy
+
+from qiskit import _numpy_compat
+from qiskit.circuit.gate import Gate
+from qiskit.circuit.controlledgate import ControlledGate
+from qiskit.circuit.annotated_operation import AnnotatedOperation, ControlModifier
+from qiskit.circuit.quantumcircuit import QuantumCircuit
+from qiskit.circuit.quantumregister import QuantumRegister
+from qiskit.circuit.exceptions import CircuitError
+from qiskit.circuit._utils import _compute_control_matrix
+from qiskit.circuit.library.standard_gates.u import UGate
+from qiskit.quantum_info.operators.predicates import matrix_equal
+from qiskit.quantum_info.operators.predicates import is_unitary_matrix
+
+from .isometry import Isometry
+
+if typing.TYPE_CHECKING:
+    from qiskit.quantum_info.operators.base_operator import BaseOperator
+
+
+class UnitaryGate(Gate):
+    """Class quantum gates specified by a unitary matrix.
+
+    Example:
+
+        We can create a unitary gate from a unitary matrix then add it to a
+        quantum circuit. The matrix can also be directly applied to the quantum
+        circuit, see :meth:`.QuantumCircuit.unitary`.
+
+        .. code-block:: python
+
+            from qiskit import QuantumCircuit
+            from qiskit.circuit.library import UnitaryGate
+
+            matrix = [[0, 0, 0, 1],
+                      [0, 0, 1, 0],
+                      [1, 0, 0, 0],
+                      [0, 1, 0, 0]]
+            gate = UnitaryGate(matrix)
+
+            circuit = QuantumCircuit(2)
+            circuit.append(gate, [0, 1])
+    """
+
+    def __init__(
+        self,
+        data: numpy.ndarray | Gate | BaseOperator,
+        label: str | None = None,
+        check_input: bool = True,
+        *,
+        num_qubits: int | None = None,
+    ) -> None:
+        """Create a gate from a numeric unitary matrix.
+
+        Args:
+            data: Unitary operator.
+            label: Unitary name for backend [Default: ``None``].
+            check_input: If set to ``False`` this asserts the input
+                is known to be unitary and the checking to validate this will
+                be skipped. This should only ever be used if you know the
+                input is unitary, setting this to ``False`` and passing in
+                a non-unitary matrix will result unexpected behavior and errors.
+            num_qubits: If given, the number of qubits in the matrix.  If not given, it is inferred.
+
+        Raises:
+            ValueError: If input data is not an N-qubit unitary operator.
+        """
+        if hasattr(data, "to_matrix"):
+            # If input is Gate subclass or some other class object that has
+            # a to_matrix method this will call that method.
+            data = data.to_matrix()
+        elif hasattr(data, "to_operator"):
+            # If input is a BaseOperator subclass this attempts to convert
+            # the object to an Operator so that we can extract the underlying
+            # numpy matrix from `Operator.data`.
+            data = data.to_operator().data
+        # Convert to numpy array in case not already an array
+        data = numpy.asarray(data, dtype=complex)
+        input_dim, output_dim = data.shape
+        num_qubits = num_qubits if num_qubits is not None else int(math.log2(input_dim))
+        if check_input:
+            # Check input is unitary
+            if not is_unitary_matrix(data):
+                raise ValueError("Input matrix is not unitary.")
+            # Check input is N-qubit matrix
+            if input_dim != output_dim or 2**num_qubits != input_dim:
+                raise ValueError("Input matrix is not an N-qubit operator.")
+        # Store instruction params
+        super().__init__("unitary", num_qubits, [data], label=label)
+
+    def __eq__(self, other):
+        if not isinstance(other, UnitaryGate):
+            return False
+        if self.label != other.label:
+            return False
+        return matrix_equal(self.params[0], other.params[0])
+
+    def __array__(self, dtype=None, copy=_numpy_compat.COPY_ONLY_IF_NEEDED):
+        """Return matrix for the unitary."""
+        dtype = self.params[0].dtype if dtype is None else dtype
+        return numpy.array(self.params[0], dtype=dtype, copy=copy)
+
+    def inverse(self, annotated: bool = False):
+        """Return the adjoint of the unitary."""
+        return self.adjoint()
+
+    def conjugate(self):
+        """Return the conjugate of the unitary."""
+        return UnitaryGate(numpy.conj(self.to_matrix()))
+
+    def adjoint(self):
+        """Return the adjoint of the unitary."""
+        return self.transpose().conjugate()
+
+    def transpose(self):
+        """Return the transpose of the unitary."""
+        return UnitaryGate(numpy.transpose(self.to_matrix()))
+
+    def _define(self):
+        """Calculate a subcircuit that implements this unitary."""
+        if self.num_qubits == 1:
+            from qiskit.synthesis.one_qubit.one_qubit_decompose import OneQubitEulerDecomposer
+
+            q = QuantumRegister(1, "q")
+            qc = QuantumCircuit(q, name=self.name)
+            theta, phi, lam, global_phase = OneQubitEulerDecomposer("U").angles_and_phase(
+                self.to_matrix()
+            )
+            qc._append(UGate(theta, phi, lam), [q[0]], [])
+            qc.global_phase = global_phase
+            self.definition = qc
+        elif self.num_qubits == 2:
+            from qiskit.synthesis.two_qubit.two_qubit_decompose import (  # pylint: disable=cyclic-import
+                two_qubit_cnot_decompose,
+            )
+
+            self.definition = two_qubit_cnot_decompose(self.to_matrix())
+        else:
+            from qiskit.synthesis.unitary.qsd import (  # pylint: disable=cyclic-import
+                qs_decomposition,
+            )
+
+            self.definition = qs_decomposition(self.to_matrix())
+
+    def control(
+        self,
+        num_ctrl_qubits: int = 1,
+        label: str | None = None,
+        ctrl_state: int | str | None = None,
+        annotated: bool | None = None,
+    ) -> ControlledGate | AnnotatedOperation:
+        """Return controlled version of gate.
+
+        Args:
+            num_ctrl_qubits: Number of controls to add to gate (default is 1).
+            label: Optional gate label.
+            ctrl_state: The control state in decimal or as a bit string (e.g. ``"1011"``).
+                If ``None``, use ``2**num_ctrl_qubits - 1``.
+            annotated: indicates whether the controlled gate should be implemented
+                as an annotated gate. If ``None``, this is handled as ``False``.
+
+        Returns:
+            Controlled version of gate.
+        """
+        if not annotated:
+            mat = self.to_matrix()
+            cmat = _compute_control_matrix(mat, num_ctrl_qubits, ctrl_state=None)
+            iso = Isometry(cmat, 0, 0)
+            gate = ControlledGate(
+                "c-unitary",
+                num_qubits=self.num_qubits + num_ctrl_qubits,
+                params=[mat],
+                label=label,
+                num_ctrl_qubits=num_ctrl_qubits,
+                definition=iso.definition,
+                ctrl_state=ctrl_state,
+                base_gate=self.copy(),
+            )
+        else:
+            gate = AnnotatedOperation(
+                self, ControlModifier(num_ctrl_qubits=num_ctrl_qubits, ctrl_state=ctrl_state)
+            )
+        return gate
+
+    def _qasm2_decomposition(self):
+        """Return an unparameterized version of ourselves, so the OQ2 exporter doesn't choke on the
+        non-standard things in our `params` field."""
+        out = self.definition.to_gate()
+        out.name = self.name
+        return out
+
+    def validate_parameter(self, parameter):
+        """Unitary gate parameter has to be an ndarray."""
+        if isinstance(parameter, numpy.ndarray):
+            return parameter
+        else:
+            raise CircuitError(f"invalid param type {type(parameter)} in gate {self.name}")

qiskit/circuit/library/graph_state.py

@@ -0,0 +1,86 @@
+# This code is part of Qiskit.
+#
+# (C) Copyright IBM 2017, 2020.
+#
+# 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.
+
+"""Graph State circuit."""
+
+from __future__ import annotations
+
+import numpy as np
+from qiskit.circuit.quantumcircuit import QuantumCircuit
+from qiskit.circuit.exceptions import CircuitError
+
+
+class GraphState(QuantumCircuit):
+    r"""Circuit to prepare a graph state.
+
+    Given a graph G = (V, E), with the set of vertices V and the set of edges E,
+    the corresponding graph state is defined as
+
+    .. math::
+
+        |G\rangle = \prod_{(a,b) \in E} CZ_{(a,b)} {|+\rangle}^{\otimes V}
+
+    Such a state can be prepared by first preparing all qubits in the :math:`+`
+    state, then applying a :math:`CZ` gate for each corresponding graph edge.
+
+    Graph state preparation circuits are Clifford circuits, and thus
+    easy to simulate classically. However, by adding a layer of measurements
+    in a product basis at the end, there is evidence that the circuit becomes
+    hard to simulate [2].
+
+    **Reference Circuit:**
+
+    .. plot::
+
+       from qiskit.circuit.library import GraphState
+       from qiskit.visualization.library import _generate_circuit_library_visualization
+       import rustworkx as rx
+       G = rx.generators.cycle_graph(5)
+       circuit = GraphState(rx.adjacency_matrix(G))
+       _generate_circuit_library_visualization(circuit)
+
+    **References:**
+
+    [1] M. Hein, J. Eisert, H.J. Briegel, Multi-party Entanglement in Graph States,
+        `arXiv:0307130 <https://arxiv.org/pdf/quant-ph/0307130.pdf>`_
+    [2] D. Koh, Further Extensions of Clifford Circuits & their Classical Simulation Complexities.
+        `arXiv:1512.07892 <https://arxiv.org/pdf/1512.07892.pdf>`_
+    """
+
+    def __init__(self, adjacency_matrix: list | np.ndarray) -> None:
+        """Create graph state preparation circuit.
+
+        Args:
+            adjacency_matrix: input graph as n-by-n list of 0-1 lists
+
+        Raises:
+            CircuitError: If adjacency_matrix is not symmetric.
+
+        The circuit prepares a graph state with the given adjacency
+        matrix.
+        """
+
+        adjacency_matrix = np.asarray(adjacency_matrix)
+        if not np.allclose(adjacency_matrix, adjacency_matrix.transpose()):
+            raise CircuitError("The adjacency matrix must be symmetric.")
+
+        num_qubits = len(adjacency_matrix)
+        circuit = QuantumCircuit(num_qubits, name=f"graph: {adjacency_matrix}")
+
+        circuit.h(range(num_qubits))
+        for i in range(num_qubits):
+            for j in range(i + 1, num_qubits):
+                if adjacency_matrix[i][j] == 1:
+                    circuit.cz(i, j)
+
+        super().__init__(*circuit.qregs, name=circuit.name)
+        self.compose(circuit.to_gate(), qubits=self.qubits, inplace=True)

qiskit/circuit/library/grover_operator.py

@@ -0,0 +1,311 @@
+# This code is part of Qiskit.
+#
+# (C) Copyright IBM 2017, 2020.
+#
+# 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 Grover operator."""
+
+from __future__ import annotations
+from typing import List, Optional, Union
+import numpy
+
+from qiskit.circuit import QuantumCircuit, QuantumRegister, AncillaRegister
+from qiskit.exceptions import QiskitError
+from qiskit.quantum_info import Statevector, Operator, DensityMatrix
+from .standard_gates import MCXGate
+
+
+class GroverOperator(QuantumCircuit):
+    r"""The Grover operator.
+
+    Grover's search algorithm [1, 2] consists of repeated applications of the so-called
+    Grover operator used to amplify the amplitudes of the desired output states.
+    This operator, :math:`\mathcal{Q}`, consists of the phase oracle, :math:`\mathcal{S}_f`,
+    zero phase-shift or zero reflection, :math:`\mathcal{S}_0`, and an
+    input state preparation :math:`\mathcal{A}`:
+
+    .. math::
+        \mathcal{Q} = \mathcal{A} \mathcal{S}_0 \mathcal{A}^\dagger \mathcal{S}_f
+
+    In the standard Grover search we have :math:`\mathcal{A} = H^{\otimes n}`:
+
+    .. math::
+        \mathcal{Q} = H^{\otimes n} \mathcal{S}_0 H^{\otimes n} \mathcal{S}_f
+                    = D \mathcal{S_f}
+
+    The operation :math:`D = H^{\otimes n} \mathcal{S}_0 H^{\otimes n}` is also referred to as
+    diffusion operator. In this formulation we can see that Grover's operator consists of two
+    steps: first, the phase oracle multiplies the good states by -1 (with :math:`\mathcal{S}_f`)
+    and then the whole state is reflected around the mean (with :math:`D`).
+
+    This class allows setting a different state preparation, as in quantum amplitude
+    amplification (a generalization of Grover's algorithm), :math:`\mathcal{A}` might not be
+    a layer of Hardamard gates [3].
+
+    The action of the phase oracle :math:`\mathcal{S}_f` is defined as
+
+    .. math::
+        \mathcal{S}_f: |x\rangle \mapsto (-1)^{f(x)}|x\rangle
+
+    where :math:`f(x) = 1` if :math:`x` is a good state and 0 otherwise. To highlight the fact
+    that this oracle flips the phase of the good states and does not flip the state of a result
+    qubit, we call :math:`\mathcal{S}_f` a phase oracle.
+
+    Note that you can easily construct a phase oracle from a bitflip oracle by sandwiching the
+    controlled X gate on the result qubit by a X and H gate. For instance
+
+    .. parsed-literal::
+
+        Bitflip oracle     Phaseflip oracle
+        q_0: ──■──         q_0: ────────────■────────────
+             ┌─┴─┐              ┌───┐┌───┐┌─┴─┐┌───┐┌───┐
+        out: ┤ X ├         out: ┤ X ├┤ H ├┤ X ├┤ H ├┤ X ├
+             └───┘              └───┘└───┘└───┘└───┘└───┘
+
+    There is some flexibility in defining the oracle and :math:`\mathcal{A}` operator. Before the
+    Grover operator is applied in Grover's algorithm, the qubits are first prepared with one
+    application of the :math:`\mathcal{A}` operator (or Hadamard gates in the standard formulation).
+    Thus, we always have operation of the form
+    :math:`\mathcal{A} \mathcal{S}_f \mathcal{A}^\dagger`. Therefore it is possible to move
+    bitflip logic into :math:`\mathcal{A}` and leaving the oracle only to do phaseflips via Z gates
+    based on the bitflips. One possible use-case for this are oracles that do not uncompute the
+    state qubits.
+
+    The zero reflection :math:`\mathcal{S}_0` is usually defined as
+
+    .. math::
+        \mathcal{S}_0 = 2 |0\rangle^{\otimes n} \langle 0|^{\otimes n} - \mathbb{I}_n
+
+    where :math:`\mathbb{I}_n` is the identity on :math:`n` qubits.
+    By default, this class implements the negative version
+    :math:`2 |0\rangle^{\otimes n} \langle 0|^{\otimes n} - \mathbb{I}_n`, since this can simply
+    be implemented with a multi-controlled Z sandwiched by X gates on the target qubit and the
+    introduced global phase does not matter for Grover's algorithm.
+
+    Examples:
+        >>> from qiskit.circuit import QuantumCircuit
+        >>> from qiskit.circuit.library import GroverOperator
+        >>> oracle = QuantumCircuit(2)
+        >>> oracle.z(0)  # good state = first qubit is |1>
+        >>> grover_op = GroverOperator(oracle, insert_barriers=True)
+        >>> grover_op.decompose().draw()
+                 ┌───┐ ░ ┌───┐ ░ ┌───┐          ┌───┐      ░ ┌───┐
+        state_0: ┤ Z ├─░─┤ H ├─░─┤ X ├───────■──┤ X ├──────░─┤ H ├
+                 └───┘ ░ ├───┤ ░ ├───┤┌───┐┌─┴─┐├───┤┌───┐ ░ ├───┤
+        state_1: ──────░─┤ H ├─░─┤ X ├┤ H ├┤ X ├┤ H ├┤ X ├─░─┤ H ├
+                       ░ └───┘ ░ └───┘└───┘└───┘└───┘└───┘ ░ └───┘
+
+        >>> oracle = QuantumCircuit(1)
+        >>> oracle.z(0)  # the qubit state |1> is the good state
+        >>> state_preparation = QuantumCircuit(1)
+        >>> state_preparation.ry(0.2, 0)  # non-uniform state preparation
+        >>> grover_op = GroverOperator(oracle, state_preparation)
+        >>> grover_op.decompose().draw()
+                 ┌───┐┌──────────┐┌───┐┌───┐┌───┐┌─────────┐
+        state_0: ┤ Z ├┤ RY(-0.2) ├┤ X ├┤ Z ├┤ X ├┤ RY(0.2) ├
+                 └───┘└──────────┘└───┘└───┘└───┘└─────────┘
+
+        >>> oracle = QuantumCircuit(4)
+        >>> oracle.z(3)
+        >>> reflection_qubits = [0, 3]
+        >>> state_preparation = QuantumCircuit(4)
+        >>> state_preparation.cry(0.1, 0, 3)
+        >>> state_preparation.ry(0.5, 3)
+        >>> grover_op = GroverOperator(oracle, state_preparation,
+        ... reflection_qubits=reflection_qubits)
+        >>> grover_op.decompose().draw()
+                                              ┌───┐          ┌───┐
+        state_0: ──────────────────────■──────┤ X ├───────■──┤ X ├──────────■────────────────
+                                       │      └───┘       │  └───┘          │
+        state_1: ──────────────────────┼──────────────────┼─────────────────┼────────────────
+                                       │                  │                 │
+        state_2: ──────────────────────┼──────────────────┼─────────────────┼────────────────
+                 ┌───┐┌──────────┐┌────┴─────┐┌───┐┌───┐┌─┴─┐┌───┐┌───┐┌────┴────┐┌─────────┐
+        state_3: ┤ Z ├┤ RY(-0.5) ├┤ RY(-0.1) ├┤ X ├┤ H ├┤ X ├┤ H ├┤ X ├┤ RY(0.1) ├┤ RY(0.5) ├
+                 └───┘└──────────┘└──────────┘└───┘└───┘└───┘└───┘└───┘└─────────┘└─────────┘
+
+        >>> mark_state = Statevector.from_label('011')
+        >>> diffuse_operator = 2 * DensityMatrix.from_label('000') - Operator.from_label('III')
+        >>> grover_op = GroverOperator(oracle=mark_state, zero_reflection=diffuse_operator)
+        >>> grover_op.decompose().draw(fold=70)
+                 ┌─────────────────┐      ┌───┐                          »
+        state_0: ┤0                ├──────┤ H ├──────────────────────────»
+                 │                 │┌─────┴───┴─────┐     ┌───┐          »
+        state_1: ┤1 UCRZ(0,pi,0,0) ├┤0              ├─────┤ H ├──────────»
+                 │                 ││  UCRZ(pi/2,0) │┌────┴───┴────┐┌───┐»
+        state_2: ┤2                ├┤1              ├┤ UCRZ(-pi/4) ├┤ H ├»
+                 └─────────────────┘└───────────────┘└─────────────┘└───┘»
+        «         ┌─────────────────┐      ┌───┐
+        «state_0: ┤0                ├──────┤ H ├─────────────────────────
+        «         │                 │┌─────┴───┴─────┐    ┌───┐
+        «state_1: ┤1 UCRZ(pi,0,0,0) ├┤0              ├────┤ H ├──────────
+        «         │                 ││  UCRZ(pi/2,0) │┌───┴───┴────┐┌───┐
+        «state_2: ┤2                ├┤1              ├┤ UCRZ(pi/4) ├┤ H ├
+        «         └─────────────────┘└───────────────┘└────────────┘└───┘
+
+    References:
+        [1]: L. K. Grover (1996), A fast quantum mechanical algorithm for database search,
+            `arXiv:quant-ph/9605043 <https://arxiv.org/abs/quant-ph/9605043>`_.
+        [2]: I. Chuang & M. Nielsen, Quantum Computation and Quantum Information,
+            Cambridge: Cambridge University Press, 2000. Chapter 6.1.2.
+        [3]: Brassard, G., Hoyer, P., Mosca, M., & Tapp, A. (2000).
+            Quantum Amplitude Amplification and Estimation.
+            `arXiv:quant-ph/0005055 <http://arxiv.org/abs/quant-ph/0005055>`_.
+    """
+
+    def __init__(
+        self,
+        oracle: Union[QuantumCircuit, Statevector],
+        state_preparation: Optional[QuantumCircuit] = None,
+        zero_reflection: Optional[Union[QuantumCircuit, DensityMatrix, Operator]] = None,
+        reflection_qubits: Optional[List[int]] = None,
+        insert_barriers: bool = False,
+        mcx_mode: str = "noancilla",
+        name: str = "Q",
+    ) -> None:
+        r"""
+        Args:
+            oracle: The phase oracle implementing a reflection about the bad state. Note that this
+                is not a bitflip oracle, see the docstring for more information.
+            state_preparation: The operator preparing the good and bad state.
+                For Grover's algorithm, this is a n-qubit Hadamard gate and for amplitude
+                amplification or estimation the operator :math:`\mathcal{A}`.
+            zero_reflection: The reflection about the zero state, :math:`\mathcal{S}_0`.
+            reflection_qubits: Qubits on which the zero reflection acts on.
+            insert_barriers: Whether barriers should be inserted between the reflections and A.
+            mcx_mode: The mode to use for building the default zero reflection.
+            name: The name of the circuit.
+        """
+        super().__init__(name=name)
+
+        # store inputs
+        if isinstance(oracle, Statevector):
+            from qiskit.circuit.library import Diagonal  # pylint: disable=cyclic-import
+
+            oracle = Diagonal((-1) ** oracle.data)
+        self._oracle = oracle
+
+        if isinstance(zero_reflection, (Operator, DensityMatrix)):
+            from qiskit.circuit.library import Diagonal  # pylint: disable=cyclic-import
+
+            zero_reflection = Diagonal(zero_reflection.data.diagonal())
+        self._zero_reflection = zero_reflection
+
+        self._reflection_qubits = reflection_qubits
+        self._state_preparation = state_preparation
+        self._insert_barriers = insert_barriers
+        self._mcx_mode = mcx_mode
+
+        # build circuit
+        self._build()
+
+    @property
+    def reflection_qubits(self):
+        """Reflection qubits, on which S0 is applied (if S0 is not user-specified)."""
+        if self._reflection_qubits is not None:
+            return self._reflection_qubits
+
+        num_state_qubits = self.oracle.num_qubits - self.oracle.num_ancillas
+        return list(range(num_state_qubits))
+
+    @property
+    def zero_reflection(self) -> QuantumCircuit:
+        """The subcircuit implementing the reflection about 0."""
+        if self._zero_reflection is not None:
+            return self._zero_reflection
+
+        num_state_qubits = self.oracle.num_qubits - self.oracle.num_ancillas
+        return _zero_reflection(num_state_qubits, self.reflection_qubits, self._mcx_mode)
+
+    @property
+    def state_preparation(self) -> QuantumCircuit:
+        """The subcircuit implementing the A operator or Hadamards."""
+        if self._state_preparation is not None:
+            return self._state_preparation
+
+        num_state_qubits = self.oracle.num_qubits - self.oracle.num_ancillas
+        hadamards = QuantumCircuit(num_state_qubits, name="H")
+        # apply Hadamards only on reflection qubits, rest will cancel out
+        hadamards.h(self.reflection_qubits)
+        return hadamards
+
+    @property
+    def oracle(self):
+        """The oracle implementing a reflection about the bad state."""
+        return self._oracle
+
+    def _build(self):
+        num_state_qubits = self.oracle.num_qubits - self.oracle.num_ancillas
+        circuit = QuantumCircuit(QuantumRegister(num_state_qubits, name="state"), name="Q")
+        num_ancillas = numpy.max(
+            [
+                self.oracle.num_ancillas,
+                self.zero_reflection.num_ancillas,
+                self.state_preparation.num_ancillas,
+            ]
+        )
+        if num_ancillas > 0:
+            circuit.add_register(AncillaRegister(num_ancillas, name="ancilla"))
+
+        circuit.compose(self.oracle, list(range(self.oracle.num_qubits)), inplace=True)
+        if self._insert_barriers:
+            circuit.barrier()
+        circuit.compose(
+            self.state_preparation.inverse(),
+            list(range(self.state_preparation.num_qubits)),
+            inplace=True,
+        )
+        if self._insert_barriers:
+            circuit.barrier()
+        circuit.compose(
+            self.zero_reflection, list(range(self.zero_reflection.num_qubits)), inplace=True
+        )
+        if self._insert_barriers:
+            circuit.barrier()
+        circuit.compose(
+            self.state_preparation, list(range(self.state_preparation.num_qubits)), inplace=True
+        )
+
+        # minus sign
+        circuit.global_phase = numpy.pi
+
+        self.add_register(*circuit.qregs)
+        try:
+            circuit_wrapped = circuit.to_gate()
+        except QiskitError:
+            circuit_wrapped = circuit.to_instruction()
+
+        self.compose(circuit_wrapped, qubits=self.qubits, inplace=True)
+
+
+# TODO use the oracle compiler or the bit string oracle
+def _zero_reflection(
+    num_state_qubits: int, qubits: List[int], mcx_mode: Optional[str] = None
+) -> QuantumCircuit:
+    qr_state = QuantumRegister(num_state_qubits, "state")
+    reflection = QuantumCircuit(qr_state, name="S_0")
+
+    num_ancillas = MCXGate.get_num_ancilla_qubits(len(qubits) - 1, mcx_mode)
+    if num_ancillas > 0:
+        qr_ancilla = AncillaRegister(num_ancillas, "ancilla")
+        reflection.add_register(qr_ancilla)
+    else:
+        qr_ancilla = AncillaRegister(0)
+
+    reflection.x(qubits)
+    if len(qubits) == 1:
+        reflection.z(0)  # MCX does not allow 0 control qubits, therefore this is separate
+    else:
+        reflection.h(qubits[-1])
+        reflection.mcx(qubits[:-1], qubits[-1], qr_ancilla[:], mode=mcx_mode)
+        reflection.h(qubits[-1])
+    reflection.x(qubits)
+
+    return reflection