Adiabatic quantum computation and Deutsch’s algorithm

Saurya Das; Randy Kobes; Gabor Kunstatter

doi:10.1103/PhysRevA.65.062310

Adiabatic quantum computation and Deutsch’s algorithm

Saurya Das, Randy Kobes, and Gabor Kunstatter

Phys. Rev. A 65, 062310 – Published 5 June 2002

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.

Received 21 November 2001

DOI:https://doi.org/10.1103/PhysRevA.65.062310

Authors & Affiliations

Saurya Das^*, Randy Kobes^†, and Gabor Kunstatter^‡

Physics Department, The University of Winnipeg and Winnipeg Institute for Theoretical Physics, 515 Portage Avenue, Winnipeg, Manitoba, Canada R3B 2E9

^*Electronic address: saurya@theory.uwinnipeg.ca
^†Electronic address: randy@theory.uwinnipeg.ca
^‡Electronic address: gabor@theory.uwinnipeg.ca

References (Subscription Required)

Click to Expand

Issue

Vol. 65, Iss. 6 — June 2002

Reuse & Permissions

Access Options

Author publication services for translation and copyediting assistance advertisement

Physical Review A

covering atomic, molecular, and optical physics and quantum information