Driving Hamiltonian in a Quantum Search Problem

Kazuto Oshima

Driving Hamiltonian in a Quantum Search Problem

量子物理 2007-05-23 v1

作者: Kazuto Oshima

摘要

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.

关键词

quantum hamiltonian simulation and dynamics

引用

@article{arxiv.quant-ph/0111021,
  title  = {Driving Hamiltonian in a Quantum Search Problem},
  author = {Kazuto Oshima},
  journal= {arXiv preprint arXiv:quant-ph/0111021},
  year   = {2007}
}

备注

3pages, LaTex

相关论文

查看更多相关论文 →