Source code for pennylane.templates.subroutines.arithmetic.semi_adder
# Copyright 2025 Xanadu Quantum Technologies Inc.
# Licensed under the Apache License, Version 2.0 (the "License");
# you may not use this file except in compliance with the License.
# You may obtain a copy of the License at
# http://www.apache.org/licenses/LICENSE-2.0
# Unless required by applicable law or agreed to in writing, software
# distributed under the License is distributed on an "AS IS" BASIS,
# WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
# See the License for the specific language governing permissions and
# limitations under the License.
"""Contains the SemiAdder template for performing the semi-out-place addition."""
from pennylane.decomposition import (
add_decomps,
adjoint_resource_rep,
controlled_resource_rep,
register_resources,
)
from pennylane.operation import Operation
from pennylane.ops import CNOT, adjoint, ctrl
from pennylane.queuing import AnnotatedQueue, QueuingManager, apply
from pennylane.wires import Wires, WiresLike
from .temporary_and import TemporaryAND
def _left_ladder(x_wires, y_wires, work_wires):
"""Implement a ladder formed from the left block in figure 2, https://arxiv.org/pdf/1709.06648.
Args:
x_wires(WiresLike): Wires encoding the integer :math:`x` to be added onto :math:`y`.
Must be in non-PennyLane ordering, i.e., little endian.
y_wires(WiresLike): Wires encoding the integer :math:`y` onto which :math:`x` is added.
Must be in non-PennyLane ordering, i.e., little endian.
work_wires(WiresLike): Work wires for the addition.
"""
num_x_wires = len(x_wires)
num_y_wires = len(y_wires)
TemporaryAND([x_wires[0], y_wires[0], work_wires[0]])
crossover = min(num_y_wires - 1, num_x_wires)
for i in range(1, crossover):
# Add the bit of x as well as the previous carry to the bit of y, and compute the next carry
ck, ik, tk, aux = [work_wires[i - 1], x_wires[i], y_wires[i], work_wires[i]]
CNOT([ck, ik])
CNOT([ck, tk])
TemporaryAND([ik, tk, aux])
CNOT([ck, aux])
# From here on, we don't have any bits in x left, so we just need to propagate the carry over y
for i in range(crossover, num_y_wires - 1):
ck, tk, aux = [work_wires[i - 1], y_wires[i], work_wires[i]]
CNOT([ck, tk])
TemporaryAND([ck, tk, aux])
CNOT([ck, aux])
def _right_ladder(x_wires, y_wires, work_wires):
"""Implement a ladder formed from the right block in figure 2, https://arxiv.org/pdf/1709.06648.
Args:
x_wires(WiresLike): Wires encoding the integer :math:`x` to be added onto :math:`y`.
Must be in non-PennyLane ordering, i.e., little endian.
y_wires(WiresLike): Wires encoding the integer :math:`y` onto which :math:`x` is added.
Must be in non-PennyLane ordering, i.e., little endian.
work_wires(WiresLike): Work wires for the addition.
"""
num_x_wires = len(x_wires)
num_y_wires = len(y_wires)
crossover = min(num_y_wires - 1, num_x_wires)
# For these bits, we don't have any bits in x, we only need to uncompute the carry propagation
for i in range(num_y_wires - 2, crossover - 1, -1):
ck, tk, aux = [work_wires[i - 1], y_wires[i], work_wires[i]]
CNOT([ck, aux])
adjoint(TemporaryAND([ck, tk, aux]))
for i in range(crossover - 1, 0, -1):
# Uncompute the carry and the addition of the bit of x and the next less-significant carry
# into the bit of y.
ck, ik, tk, aux = [work_wires[i - 1], x_wires[i], y_wires[i], work_wires[i]]
CNOT([ck, aux])
adjoint(TemporaryAND([ik, tk, aux]))
CNOT([ck, ik])
CNOT([ik, tk])
adjoint(TemporaryAND([x_wires[0], y_wires[0], work_wires[0]]))
CNOT([x_wires[0], y_wires[0]])
def _controlled_right_ladder(x_wires, y_wires, non_ctrl_work_wires, **ctrl_kwargs):
"""Implement a ladder formed from the right block in figure 4, https://arxiv.org/pdf/1709.06648.
Args:
x_wires(WiresLike): Wires encoding the integer :math:`x` to be added onto :math:`y`.
Must be in non-PennyLane ordering, i.e., little endian.
y_wires(WiresLike): Wires encoding the integer :math:`y` onto which :math:`x` is added.
Must be in non-PennyLane ordering, i.e., little endian.
work_wires(WiresLike): Work wires for the addition.
"""
# We need to use a different name for this variable in the function signature because
# work_wires is a key in ctrl_kwargs. This allows us to keep passing ctrl_kwargs around as
# a convenient variable. Here we rename the variable passed to the function to work_wires,
# in order to be more consistent with `_left_ladder` and `_right_ladder`.
work_wires = non_ctrl_work_wires
num_x_wires = len(x_wires)
num_y_wires = len(y_wires)
crossover = min(num_y_wires - 1, num_x_wires)
for i in range(len(y_wires) - 2, crossover - 1, -1):
ck, tk, aux = [work_wires[i - 1], y_wires[i], work_wires[i]]
CNOT([ck, aux])
adjoint(TemporaryAND([ck, tk, aux]))
ctrl(CNOT(wires=[ck, tk]), **ctrl_kwargs)
CNOT([ck, tk])
for i in range(crossover - 1, 0, -1):
ck, ik, tk, aux = [work_wires[i - 1], x_wires[i], y_wires[i], work_wires[i]]
CNOT([ck, aux])
adjoint(TemporaryAND([ik, tk, aux]))
ctrl(CNOT(wires=[ik, tk]), **ctrl_kwargs)
CNOT([ck, tk])
CNOT([ck, ik])
adjoint(TemporaryAND([x_wires[0], y_wires[0], work_wires[0]]))
ctrl(CNOT([x_wires[0], y_wires[0]]), **ctrl_kwargs)
[docs]
class SemiAdder(Operation):
r"""This operator performs the plain addition of two integers :math:`x` and :math:`y` in the computational basis:
.. math::
\text{SemiAdder} |x \rangle | y \rangle = |x \rangle | x + y \rangle,
This operation is also referred to as semi-out-place addition or quantum-quantum in-place addition in the literature.
The implementation is based on `arXiv:1709.06648 <https://arxiv.org/abs/1709.06648>`_.
Args:
x_wires (Sequence[int]): The wires that store the integer :math:`x`. The number of wires must be sufficient to
represent :math:`x` in binary.
y_wires (Sequence[int]): The wires that store the integer :math:`y`. The number of wires must be sufficient to
represent :math:`y` in binary. These wires are also used
to encode the integer :math:`x+y` which is computed modulo :math:`2^{\text{len(y_wires)}}` in the computational basis.
work_wires (Optional(Sequence[int])): The auxiliary wires to use for the addition. At least, ``len(y_wires) - 1`` work
wires should be provided.
**Example**
This example computes the sum of two integers :math:`x=3` and :math:`y=4`.
.. code-block:: python
x = 3
y = 4
wires = qp.registers({"x":3, "y":6, "work":5})
dev = qp.device("default.qubit")
@qp.set_shots(1)
@qp.qnode(dev)
def circuit():
qp.BasisEmbedding(x, wires=wires["x"])
qp.BasisEmbedding(y, wires=wires["y"])
qp.SemiAdder(wires["x"], wires["y"], wires["work"])
return qp.sample(wires=wires["y"])
.. code-block:: pycon
>>> print(circuit())
[[0 0 0 1 1 1]]
The result :math:`[[0 0 0 1 1 1]]`, is the binary representation of :math:`3 + 4 = 7`.
Note that the result is computed modulo :math:`2^{\text{len(y_wires)}}` which makes the computed value dependent on the size of the ``y_wires`` register. This behavior is demonstrated in the following example.
.. code-block:: python
x = 3
y = 1
wires = qp.registers({"x":3, "y":2, "work":1})
dev = qp.device("default.qubit")
@qp.set_shots(1)
@qp.qnode(dev)
def circuit():
qp.BasisEmbedding(x, wires=wires["x"])
qp.BasisEmbedding(y, wires=wires["y"])
qp.SemiAdder(wires["x"], wires["y"], wires["work"])
return qp.sample(wires=wires["y"])
>>> print(circuit())
[[0 0]]
The result :math:`[0\ 0]` is the binary representation of :math:`3 + 1 = 4` where :math:`4 \mod 2^2 = 0`.
"""
grad_method = None
resource_keys = {"num_x_wires", "num_y_wires", "num_work_wires"}
def __init__(
self, x_wires: WiresLike, y_wires: WiresLike, work_wires: WiresLike | None, id=None
):
x_wires = Wires(x_wires)
y_wires = Wires(y_wires)
work_wires = Wires(work_wires if work_wires is not None else [])
if work_wires:
if len(work_wires) < len(y_wires) - 1:
raise ValueError(f"At least {len(y_wires)-1} work_wires should be provided.")
if work_wires.intersection(x_wires):
raise ValueError("None of the wires in work_wires should be included in x_wires.")
if work_wires.intersection(y_wires):
raise ValueError("None of the wires in work_wires should be included in y_wires.")
if x_wires.intersection(y_wires):
raise ValueError("None of the wires in y_wires should be included in x_wires.")
self.hyperparameters["x_wires"] = x_wires
self.hyperparameters["y_wires"] = y_wires
self.hyperparameters["work_wires"] = work_wires
if work_wires:
all_wires = Wires.all_wires([x_wires, y_wires, work_wires])
else:
all_wires = Wires.all_wires([x_wires, y_wires])
super().__init__(wires=all_wires, id=id)
@property
def resource_params(self) -> dict:
return {
"num_x_wires": len(self.hyperparameters["x_wires"]),
"num_y_wires": len(self.hyperparameters["y_wires"]),
"num_work_wires": len(self.hyperparameters["work_wires"]),
}
@property
def num_params(self):
return 0
def _flatten(self):
metadata = tuple((key, value) for key, value in self.hyperparameters.items())
return tuple(), metadata
@classmethod
def _unflatten(cls, data, metadata):
hyperparams_dict = dict(metadata)
return cls(**hyperparams_dict)
[docs]
def map_wires(self, wire_map: dict) -> "SemiAdder":
new_dict = {
key: [wire_map.get(w, w) for w in self.hyperparameters[key]]
for key in ["x_wires", "y_wires", "work_wires"]
}
return SemiAdder(
new_dict["x_wires"],
new_dict["y_wires"],
new_dict["work_wires"],
)
[docs]
def decomposition(self):
r"""Representation of the operator as a product of other operators."""
return self.compute_decomposition(**self.hyperparameters)
@classmethod
def _primitive_bind_call(cls, *args, **kwargs):
return cls._primitive.bind(*args, **kwargs)
[docs]
@staticmethod
def compute_decomposition(x_wires, y_wires, work_wires): # pylint: disable=arguments-differ
r"""Representation of the operator as a product of other operators.
The implementation is based on `arXiv:1709.06648 <https://arxiv.org/abs/1709.06648>`_.
Args:
x_wires (Sequence[int]): The wires that store the integer :math:`x`. The number of wires must be sufficient to
represent :math:`x` in binary.
y_wires (Sequence[int]): The wires that store the integer :math:`y`. The number of wires must be sufficient to
represent :math:`y` in binary. These wires are also used
to encode the integer :math:`x+y` which is computed modulo :math:`2^{\text{len(y_wires)}}` in the computational basis.
work_wires (Sequence[int]): The auxiliary wires to use for the addition. At least, ``len(y_wires) - 1`` work
wires should be provided.
Returns:
list[.Operator]: Decomposition of the operator
"""
with AnnotatedQueue() as q:
_semiadder(x_wires, y_wires, work_wires)
if QueuingManager.recording():
for op in q.queue:
apply(op)
return q.queue
def _semiadder_resources(num_x_wires, num_y_wires, **_):
# Resources extracted from `arXiv:1709.06648 <https://arxiv.org/abs/1709.06648>`_.
# _left_ladder uses (num_y_wires - 1) TemporaryANDs
# and 3 * (crossover - 1) + 2 * (num_y_wires - 1 - crossover) CNOTs
# _left_ladder uses (num_y_wires - 1) Adjoint(TemporaryAND)s
# and 3 * (crossover - 1) + (num_y_wires - 1 - crossover) + 1 CNOTs
# There are 1 + int(num_x_wires>=num_y_wires) additional CNOTs in the main decomp. function
crossover = min(num_y_wires - 1, num_x_wires)
return {
TemporaryAND: num_y_wires - 1,
adjoint_resource_rep(TemporaryAND, {}): num_y_wires - 1,
CNOT: 3 * (crossover + num_y_wires) - 7 + int(num_x_wires >= num_y_wires),
}
@register_resources(_semiadder_resources)
def _semiadder(x_wires, y_wires, work_wires, **_):
num_y_wires = len(y_wires)
num_x_wires = len(x_wires)
if num_y_wires == 1:
CNOT([x_wires[-1], y_wires[0]])
return
# Turn wires from big endian to little endian
# Truncate x_wires, as values larger than 2**num_y_wires-1 can anyways not be stored
x_wires = x_wires[::-1][:num_y_wires]
y_wires = y_wires[::-1]
work_wires = work_wires[: num_y_wires - 1][::-1]
_left_ladder(x_wires, y_wires, work_wires)
CNOT([work_wires[-1], y_wires[-1]])
if num_x_wires >= num_y_wires:
CNOT([x_wires[-1], y_wires[-1]])
_right_ladder(x_wires, y_wires, work_wires)
add_decomps(SemiAdder, _semiadder)
def _controlled_semi_adder_resource(base_params, base_class, **ctrl_kwargs):
r"""
Resources calculated from `arXiv:1709.06648 <https://arxiv.org/abs/1709.06648>`_.
"""
# pylint: disable=unused-argument
num_x_wires = base_params["num_x_wires"]
num_y_wires = base_params["num_y_wires"]
ctrl_kwargs["num_work_wires"] += base_params["num_work_wires"] - (num_y_wires - 1)
crossover = min(num_y_wires - 1, num_x_wires)
# _left_ladder uses (num_y_wires - 1) TemporaryANDs
# and 3 * (crossover - 1) + 2 * (num_y_wires - 1 - crossover) CNOTs
# _controlled_right_ladder uses (num_y_wires - 1) TemporaryANDs, (num_y_wires - 1) controlled
# CNOTs, and 3 * (crossover - 1) + 2 * (num_y_wires - 1 - crossover) CNOTs
# There are 1 + int(num_x_wires>=num_y_wires) additional ctrl-CNOTs in the main function
num_cnots = 2 * crossover + 4 * num_y_wires - 10
num_ctrl_cnots = num_y_wires + int(num_x_wires >= num_y_wires)
return {
TemporaryAND: num_y_wires - 1,
adjoint_resource_rep(TemporaryAND, {}): num_y_wires - 1,
CNOT: num_cnots,
controlled_resource_rep(CNOT, {}, **ctrl_kwargs): num_ctrl_cnots,
}
@register_resources(_controlled_semi_adder_resource)
def _controlled_semi_adder(
base, control_wires, control_values=None, work_wires=None, work_wire_type="borrowed", **_
): # pylint: disable=too-many-arguments
r"""
Decomposition extracted from `arXiv:1709.06648 <https://arxiv.org/abs/1709.06648>`_
using building block described in Figure 4.
"""
y_wires = base.hyperparameters["y_wires"]
x_wires = base.hyperparameters["x_wires"]
base_work_wires = base.hyperparameters["work_wires"]
# Slice out the needed work wires for the left and right ladders, the extra work wires
# will be used as work wires for `ctrl`
extra_work_wires_from_base = base_work_wires[len(y_wires) - 1 :]
base_work_wires = base_work_wires[: len(y_wires) - 1]
work_wires = [] if work_wires is None else work_wires
ctrl_kwargs = {
"control": control_wires,
"control_values": control_values,
"work_wires": Wires.all_wires([work_wires, extra_work_wires_from_base]),
"work_wire_type": work_wire_type,
}
num_y_wires = len(y_wires)
num_x_wires = len(x_wires)
if num_y_wires == 1:
ctrl(CNOT([x_wires[-1], y_wires[0]]), **ctrl_kwargs)
return
# Turn wires from big endian to little endian
# Truncate x_wires, as values larger than 2**num_y_wires-1 can anyways not be stored
x_wires = x_wires[::-1][:num_y_wires]
y_wires = y_wires[::-1]
work_wires = base_work_wires[::-1]
_left_ladder(x_wires, y_wires, work_wires)
ctrl(CNOT([work_wires[-1], y_wires[-1]]), **ctrl_kwargs)
if num_x_wires >= num_y_wires:
ctrl(CNOT([x_wires[-1], y_wires[-1]]), **ctrl_kwargs)
_controlled_right_ladder(x_wires, y_wires, work_wires, **ctrl_kwargs)
add_decomps("C(SemiAdder)", _controlled_semi_adder)
_modules/pennylane/templates/subroutines/arithmetic/semi_adder
Download Python script
Download Notebook
View on GitHub