General framework for quantum search algorithms

Physics – Quantum Physics

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

revised version

Scientific paper

Grover's quantum search algorithm drives a quantum computer from a prepared initial state to a desired final state by using selective transformations of these states. Here, we analyze a framework when one of the selective trasformations is replaced by a more general unitary transformation. Our framework encapsulates several previous generalizations of the Grover's algorithm. We show that the general quantum search algorithm can be improved by controlling the transformations through an ancilla qubit. As a special case of this improvement, we get a faster quantum algorithm for the two-dimensional spatial search.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

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

Rate now

     

Profile ID: LFWR-SCP-O-11621

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.