Adiabatic quantum search algorithm for structured problems

Details Adiabatic quantum search algorithm for structured problems Adiabatic quantum search algorithm for structured problems

2003-04-04

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

Phys. Rev. A 68, 062312 (2003).

Physics

Quantum Physics

7 pages, 0 figure

Scientific paper

10.1103/PhysRevA.68.062312

The study of quantum computation has been motivated by the hope of finding efficient quantum algorithms for solving classically hard problems. In this context, quantum algorithms by local adiabatic evolution have been shown to solve an unstructured search problem with a quadratic speed-up over a classical search, just as Grover's algorithm. In this paper, we study how the structure of the search problem may be exploited to further improve the efficiency of these quantum adiabatic algorithms. We show that by nesting a partial search over a reduced set of variables into a global search, it is possible to devise quantum adiabatic algorithms with a complexity that, although still exponential, grows with a reduced order in the problem size.

Affiliated with

Also associated with

No associations

Rating

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

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-385584