Adiabatic Quantum Computation and Deutsch's Algorithm

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.Comment: 6 Pages, Revtex. Typos corrected, references added. Published versio

Energy and Efficiency of Adiabatic Quantum Search Algorithms

We present the results of a detailed analysis of a general, unstructured adiabatic quantum search of a data base of $N$ items. In particular we examine the effects on the computation time of adding energy to the system. We find that by increasing the lowest eigenvalue of the time dependent Hamiltonian {\it temporarily} to a maximum of $\propto \sqrt{N}$, it is possible to do the calculation in constant time. This leads us to derive the general theorem which provides the adiabatic analogue of the $\sqrt{N}$ bound of conventional quantum searches. The result suggests that the action associated with the oracle term in the time dependent Hamiltonian is a direct measure of the resources required by the adiabatic quantum search.Comment: 6 pages, Revtex, 1 figure. Theorem modified, references and comments added, sections introduced, typos corrected. Version to appear in J. Phys.

The Thermal Beta-Function in Yang-Mills Theory

Previous calculations of the thermal beta-function in a hot Yang--Mills gas at the one--loop level have exposed problems with the gauge dependence and with the sign, which is opposite to what one would expect for asymptotic freedom. We show that inclusion of higher--loop effects through a static Braaten--Pisarski resummation is necessary to consistently obtain the leading term, but alters the results only quantitatively. The sign, in particular, remains the same. We also explore, by a crude parameterization, the effects a (non--perturbative) magnetic mass may have on these results.Comment: 16pp,latex + epsf.sty, Nordita-94/36