Adiabatic quantum computation and Deutsch’s algorithm
- 5 June 2002
- journal article
- research article
- Published by American Physical Society (APS) in Physical Review A
- Vol. 65 (6) , 062310
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.Keywords
All Related Versions
This publication has 3 references indexed in Scilit:
- Quantum algorithms revisitedProceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences, 1998
- Rapid solution of problems by quantum computationProceedings of the Royal Society of London. Series A: Mathematical and Physical Sciences, 1992
- Quantum theory, the Church–Turing principle and the universal quantum computerProceedings of the Royal Society of London. A. Mathematical and Physical Sciences, 1985