The Deutsch-Jozsa algorithm is one of the first examples of a quantum algorithm that is exponentially faster than any possible deterministic classical algorithm. It was proposed by Deutsch and Jozsa in 1992 with improvements by Cleve, Ekert, Macchiavello, and Mosca in 1998. The Deutsch-Jozsa problem is a promise problem and we can equivalently describe it as a partial function ${\text{DJ}}_n^0:{\{0,1\}}^n\to \{0,1\}$ defined as ${\text{DJ}}_n^0\left(x\right)=1$ for $\left|x\right|=n/2, {\text{DJ}}_n^0\left(x\right)=0$ for $\left|x\right|=0,n$, and it is undefined for the rest of the cases, where $n$ is even, and $\left|x\right|$ is the Hamming weight of $x$. The optimal quantum algorithm needs only one query to compute ${\text{DJ}}_n^0$ but the classical deterministic algorithm requires $2^{n-1}+1$ queries to compute it in the worse case. In this article, we generalize the Deutsch-Jozsa problem as ${\text{DJ}}_n^k\left(x\right)=1$ for $\left|x\right|=n/2, {\text{DJ}}_n^k\left(x\right)=0$ for $\left|x\right|$ in the set $\{0,1,...,k,n-k,n-k+1,...,n\}$, and it is undefined for the rest of the cases, where $0\le k<n/2$. In particular, we give and prove an optimal exact quantum query algorithm with complexity $k+1$ for computing the generalized Deutsch-Jozsa problem ${\text{DJ}}_n^k$. It is clear that the case of $k=0$ is in accordance with the Deutsch-Jozsa problem. Also, we give a method for finding the approximate and exact degrees of symmetric partial Boolean functions.

• Received 4 February 2018

DOI:https://doi.org/10.1103/PhysRevA.97.062331