arXiv · quant-ph/0111032
Adiabatic Quantum Computation and Deutsch's Algorithm
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.
Explore related subjects
Keep this discovery
Explore connections, maps & timelines
Saurya Das, Randy Kobes, Gabor Kunstatter. 2002-09-25. Adiabatic Quantum Computation and Deutsch's Algorithm. https://doi.org/10.1103/physreva.65.062310. https://searcharxiv.com/abs/quant-ph/0111032
Citations retain the original authors and DOI and include this site’s record URL. If this discovery service contributed to your research, you can also cite Searcharxiv by Indiciae: BibTeX · RIS.