Adiabatic quantum computation is equivalent to standard quantum computation

Dorit Aharonov, Wim Van Dam, Julia Kempe, Zeph Landau, Seth Lloyd, Oded Regev

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

The model of adiabatic quantum computation has recently attracted attention in the physics and computer science communities, but its exact computational power has been unknown. We settle this question and describe an efficient adiabatic simulation of any given quantum algorithm. This implies that the adiabatic computation model and the standard quantum circuit model are polynomially equivalent. We also describe an extension of this result with implications to physical implementations of adiabatic computation. We believe that our result highlights the potential importance of the adiabatic computation model in the design of quantum algorithms and in their experimental realization.

Original languageEnglish (US)
Title of host publicationProceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS
Pages42-51
Number of pages10
Publication statusPublished - 2004
EventProceedings - 45th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2004 - Rome, Italy
Duration: Oct 17 2004Oct 19 2004

Other

OtherProceedings - 45th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2004
CountryItaly
CityRome
Period10/17/0410/19/04

    Fingerprint

ASJC Scopus subject areas

  • Engineering(all)

Cite this

Aharonov, D., Van Dam, W., Kempe, J., Landau, Z., Lloyd, S., & Regev, O. (2004). Adiabatic quantum computation is equivalent to standard quantum computation. In Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS (pp. 42-51)