Complete Adiabatic Quantum Search in Unsorted Databases

Details Complete Adiabatic Quantum Search in Unsorted Databases Complete Adiabatic Quantum Search in Unsorted Databases

2008-11-05

arxiv.org/abs/0811.0663v1

Physics

Quantum Physics

Scientific paper

We propose a new adiabatic algorithm for the unsorted database search
problem. This algorithm saves two thirds of qubits than Grover's algorithm in
realizations. Meanwhile, we analyze the time complexity of the algorithm by
both perturbative method and numerical simulation. The results show it provides
a better speedup than the previous adiabatic search algorithm.

Affiliated with

Also associated with

No associations

Rating

Complete Adiabatic Quantum Search in Unsorted Databases 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 Complete Adiabatic Quantum Search in Unsorted Databases, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Complete Adiabatic Quantum Search in Unsorted Databases will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-373102