On the efficiency of Hamiltonian-based quantum computation for low-rank matrices

Details On the efficiency of Hamiltonian-based quantum computation for low-rank matrices On the efficiency of Hamiltonian-based quantum computation for low-rank matrices

2010-04-27

arxiv.org/abs/1004.4911v3

Physics

Mathematical Physics

17 pages, no figures, to appear in JMP

Scientific paper

We present an extension of Adiabatic Quantum Computing (AQC) algorithm for the unstructured search to the case when the number of marked items is unknown. The algorithm maintains the optimal Grover speedup and includes a small counting subroutine. Our other results include a lower bound on the amount of time needed to perform a general Hamiltonian-based quantum search, a lower bound on the evolution time needed to perform a search that is valid in the presence of control error and a generic upper bound on the minimum eigenvalue gap for evolutions. In particular, we demonstrate that quantum speedup for the unstructured search using AQC type algorithms may only be achieved under very rigid control precision requirements.

Affiliated with

Also associated with

No associations

Rating

On the efficiency of Hamiltonian-based quantum computation for low-rank matrices 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 On the efficiency of Hamiltonian-based quantum computation for low-rank matrices, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and On the efficiency of Hamiltonian-based quantum computation for low-rank matrices will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-67411