Quantum search by partial adiabatic evolution

Details Quantum search by partial adiabatic evolution Quantum search by partial adiabatic evolution

2010-07-09

arxiv.org/abs/1007.1528v1

Computer Science

Data Structures and Algorithms

Scientific paper

A quantum search algorithm based on the partial adiabatic
evolution\cite{Tulsi2009} is provided. We calculate its time complexity by
studying the Hamiltonian in a two-dimensional Hilbert space. It is found that
the algorithm improves the time complexity, which is $O(\sqrt{N/M})$, of the
local adiabatic search algorithm\cite{Roland2002}, to $O(\sqrt{N}/M)$.

Affiliated with

Also associated with

No associations

Rating

Quantum search by partial adiabatic evolution 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 Quantum search by partial adiabatic evolution, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Quantum search by partial adiabatic evolution will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-644801