Adiabatic Quantum Computation and Deutsch's Algorithm
Quantum Physics
2009-11-07 v2 High Energy Physics - Theory
Abstract
We show that by a suitable choice of a time dependent Hamiltonian, Deutsch's algorithm can be implemented by an adiabatic quantum computer. We extend our analysis to the Deutsch-Jozsa problem and estimate the required running time for both global and local adiabatic evolutions.
Cite
@article{arxiv.quant-ph/0111032,
title = {Adiabatic Quantum Computation and Deutsch's Algorithm},
author = {Saurya Das and Randy Kobes and Gabor Kunstatter},
journal= {arXiv preprint arXiv:quant-ph/0111032},
year = {2009}
}
Comments
6 Pages, Revtex. Typos corrected, references added. Published version