A summary on two new algorithms for Grover's unsorted database search problem

Details A summary on two new algorithms for Grover's unsorted database search problem A summary on two new algorithms for Grover's unsorted database search problem

2006-03-23

arxiv.org/abs/quant-ph/0603210v2

Physics

Quantum Physics

2 pages. LaTex revtex4. APS twocolumn

Scientific paper

In this summary we discuss two new algorithms for Grover's unsorted database search problem that claimed to have reached exponential speedup over Grover's original algorithm. One is in the quantum setting with "power queries" that allow for exponential reduction in the number of queries over Grover's original algorithm with "bit queries". The other is to use "dubit queries" on a duality computer - a new computing model uses a quantum system's wave-particle duality, which is able to achieve even greater computing power and better capability than existent quantum computers we have been discussing. We discuss the shortages and difficulties of both schemes as well.

Affiliated with

Also associated with

No associations

Rating

A summary on two new algorithms for Grover's unsorted database search problem does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with A summary on two new algorithms for Grover's unsorted database search problem, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A summary on two new algorithms for Grover's unsorted database search problem will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-306349