## The Generalized Bernstein-Vazirani Algorithm for Determining an Integer String

**Authors:** Koji Nagata, Tadao Nakamura, Han Geurdes, Josep Batle, Ahmed Farouk, Do Ngoc Diep

We present the generalized
Bernstein-Vazirani algorithm for determining a restricted integer string.
Given the set of real values $\{a_1,a_2,a_3,\ldots,a_N\}$ and
a function $g:{\bf R}\rightarrow {\bf Z}$,
we shall determine the following
values $\{g(a_1),g(a_2),g(a_3),\ldots, g(a_N)\}$ simultaneously.
The speed of determining the values is shown
to outperform
the classical case by a factor of $N$.
The method determines the maximum of and the minimum of
the function $g$ that the finite domain is $\{a_1,a_2,a_3,\ldots,a_N\}$.

**Comments:** 3 pages

**Download:** **PDF**

### Submission history

[v1] 2018-03-09 08:22:53

**Unique-IP document downloads:** 12 times

Vixra.org is a pre-print repository rather than a journal. Articles hosted may not yet have been verified by peer-review and should be treated as preliminary.
In particular, anything that appears to include financial or legal advice or proposed medical treatments should be treated with due caution.
Vixra.org will not be responsible for any consequences of actions that result from any form of use of any documents on this website.

**Add your own feedback and questions here:**

*You are equally welcome to be positive or negative about any paper but please be polite. If you are being critical you must mention at least one specific error, otherwise your comment will be deleted as unhelpful.*

*
*