Driving Hamiltonian in a Quantum Search Problem

Simple item page
dc.creatorOshima, Kazuto
dc.date2001-11-04
dc.date.accessioned2026-07-07T06:02:57Z
dc.date.available2026-07-07T06:02:57Z
dc.descriptionWe 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.
dc.description3pages, LaTex
dc.identifierhttps://arxiv.org/abs/quant-ph/0111021
dc.identifierhttp://arxiv.org/abs/quant-ph/0111021
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/89812
dc.subjectQuantum Physics
dc.titleDriving Hamiltonian in a Quantum Search Problem
dc.typetext

Files

Collections

arXiv