In the original Grover algorithm, an exact or almost exact search such that the success probability is unity or infinitesimally close to unity is possible only for certain values of the fraction λ = M/N where M is the number of marked items that are stored in an unsorted database of N items. There are various modified algorithms with an adjustable phase or phases such that an exact search can be done for any value of λ by means of a finite number of Grover-type operations. Among them, the algorithm proposed by Long is the simplest in the sense that it has only one adjustable phase and that the phase can be obtained in a closed form. We show that other more general algorithms with additional phases are not more efficient than Long’s version with a single phase.
Quantum Information Processing – Springer Journals
Published: Oct 30, 2012
It’s your single place to instantly
discover and read the research
that matters to you.
Enjoy affordable access to
over 18 million articles from more than
15,000 peer-reviewed journals.
All for just $49/month
Query the DeepDyve database, plus search all of PubMed and Google Scholar seamlessly
Save any article or search result from DeepDyve, PubMed, and Google Scholar... all in one place.
Get unlimited, online access to over 18 million full-text articles from more than 15,000 scientific journals.
Read from thousands of the leading scholarly journals from SpringerNature, Elsevier, Wiley-Blackwell, Oxford University Press and more.
All the latest content is available, no embargo periods.
“Hi guys, I cannot tell you how much I love this resource. Incredible. I really believe you've hit the nail on the head with this site in regards to solving the research-purchase issue.”Daniel C.
“Whoa! It’s like Spotify but for academic articles.”@Phil_Robichaud
“I must say, @deepdyve is a fabulous solution to the independent researcher's problem of #access to #information.”@deepthiw
“My last article couldn't be possible without the platform @deepdyve that makes journal papers cheaper.”@JoseServera