Quantum Physics

    

Quantum Search in a Four-Complex-Dimensional Subspace

Authors: Wenliang Jin

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.

Comments: 18 Pages.

Download: PDF

Submission history

[v1] 2013-07-24 04:25:16

Unique-IP document downloads: 217 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.

comments powered by Disqus