Adiabatic Quantum Computation and Deutsch's Algorithm
classification
🪐 quant-ph
hep-th
keywords
adiabaticalgorithmdeutschquantumtimeanalysischoicecomputation
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.