Accuracy vs run time in adiabatic quantum search

Details Accuracy vs run time in adiabatic quantum search Accuracy vs run time in adiabatic quantum search

2010-08-04

arxiv.org/abs/1008.0863v1

Phys. Rev. A 82, 052305 (2010)

Physics

Quantum Physics

20 pages, 4 figures

Scientific paper

10.1103/PhysRevA.82.052305

Adiabatic quantum algorithms are characterized by their run time and accuracy. The relation between the two is essential for quantifying adiabatic algorithmic performance, yet is often poorly understood. We study the dynamics of a continuous time, adiabatic quantum search algorithm, and find rigorous results relating the accuracy and the run time. Proceeding with estimates, we show that under fairly general circumstances the adiabatic algorithmic error exhibits a behavior with two discernible regimes: the error decreases exponentially for short times, then decreases polynomially for longer times. We show that the well known quadratic speedup over classical search is associated only with the exponential error regime. We illustrate the results through examples of evolution paths derived by minimization of the adiabatic error. We also discuss specific strategies for controlling the adiabatic error and run time.

Affiliated with

Also associated with

No associations

Rating

Accuracy vs run time in adiabatic quantum search 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 Accuracy vs run time in adiabatic quantum search, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Accuracy vs run time in adiabatic quantum search will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-437348