Quantum adiabatic evolutions that can't be used to design efficient algorithms

Details Quantum adiabatic evolutions that can't be used to design efficient algorithms Quantum adiabatic evolutions that can't be used to design efficient algorithms

2006-04-11

arxiv.org/abs/quant-ph/0604077v2

Physics

Quantum Physics

4 pages, 1 figure

Scientific paper

Quantum adiabatic computation is a novel paradigm for the design of quantum algorithms, which is usually used to find the minimum of a classical function. In this paper, we show that if the initial hamiltonian of a quantum adiabatic evolution with a interpolation path is too simple, the minimal gap between the ground state and the first excited state of this quantum adiabatic evolution is an inverse exponential distance. Thus quantum adiabatic evolutions of this kind can't be used to design efficient quantum algorithms. Similarly, we show that a quantum adiabatic evolution with a simple final hamiltonian also has a long running time, which suggests that some functions can't be minimized efficiently by any quantum adiabatic evolution with a interpolation path.

Affiliated with

Also associated with

No associations

Rating

Quantum adiabatic evolutions that can't be used to design efficient algorithms 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 adiabatic evolutions that can't be used to design efficient algorithms, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Quantum adiabatic evolutions that can't be used to design efficient algorithms will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-286856