Fast quantum search algorithm and Bounds on it

Details Fast quantum search algorithm and Bounds on it Fast quantum search algorithm and Bounds on it

1998-07-24

arxiv.org/abs/quant-ph/9807067v1

Physics

Quantum Physics

Latex file, Two column, 4 pages, no figures

Scientific paper

We recast Grover's generalised search algorithm in a geometric language even when the states are not approximately orthogonal. We provide a possible search algorithm based on an arbitrary unitary transformation which can speed up the steps still further. We discuss the lower and upper bounds on the transition matrix elements when the unitary operator changes with time, thereby implying that quantum search process can not be too fast or too slow. This is a remarkable feature of quantum computation unlike classical one. Quantum mechanical uncertainty relation puts bounds on search process. Also we mention the problems of perturbation and other issues in time-dependent search operation.

Affiliated with

Also associated with

No associations

Rating

Fast quantum search algorithm and Bounds on it 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 Fast quantum search algorithm and Bounds on it, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Fast quantum search algorithm and Bounds on it will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-243253