Quantum Search in a Four-Complex-Dimensional Subspace
Wenliang Jin
Abstract
For there to be $M> 1$ target items to be searched in an unsorted database of size $N$, with $M/N\ll 1$ for a sufficiently large $N$, we explore the performance of Grover's search algorithm when considering some possible situations that may arise in a four-complex-dimensional subspace, for which in the case of identical rotation angles $\phi=\theta$, we give the maximum success probabilities of finding a desired state and their corresponding numbers of Grover iterations in an approximate fashion. Our analysis reveals that the case of identical rotation angles $\phi=\theta$ is energetically favorable compared to the case $\left| {\theta - \phi } \right|\gg 0$ for boosting the probability to detect a desired state.