For , its modular-addition oracle is the unitary operator
For each fixed , addition by permutes the answer register's computational basis. This preserves inner products, even when is not injective.
Let . The modular-addition quantum oracle obeys
The three steps replace by , then , then . Thus a query to the inverse costs one forward query and two known unitary operators. The negation operator is a permutation matrix with .

Articles by others on the same topic (0)

There are currently no matching articles.