Driving Hamiltonian in a Quantum Search Problem

Details Driving Hamiltonian in a Quantum Search Problem Driving Hamiltonian in a Quantum Search Problem

2001-11-04

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

Physics

Quantum Physics

3pages, LaTex

Scientific paper

We examine the driving Hamiltonian in the analog analogue of Grover's algorithm by Farhi and Gutmann. For a quantum system with a given Hamiltonian $E|w> < w|$, we explicitly show that while the driving Hamiltonian $E|s> < s|$ optimally produces the state $|w>$ from an initial state $|s>$, the driving Hamiltonian $E^{\prime}|s> < s|(E^{\prime} \ne E)$ does not provide any speedup compared even with a classical computation.

Affiliated with

Also associated with

No associations

Rating

Driving Hamiltonian in a Quantum Search Problem 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 Driving Hamiltonian in a Quantum Search Problem, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Driving Hamiltonian in a Quantum Search Problem will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-332338