Adiabatic Quantum Search in Open Systems

Dominik S. Wild, Sarang Gopalakrishnan, Michael Knap, Norman Y. Yao, Mikhail D. Lukin

Research output: Contribution to journalArticlepeer-review

20 Scopus citations


Adiabatic quantum algorithms represent a promising approach to universal quantum computation. In isolated systems, a key limitation to such algorithms is the presence of avoided level crossings, where gaps become extremely small. In open quantum systems, the fundamental robustness of adiabatic algorithms remains unresolved. Here, we study the dynamics near an avoided level crossing associated with the adiabatic quantum search algorithm, when the system is coupled to a generic environment. At zero temperature, we find that the algorithm remains scalable provided the noise spectral density of the environment decays sufficiently fast at low frequencies. By contrast, higher order scattering processes render the algorithm inefficient at any finite temperature regardless of the spectral density, implying that no quantum speedup can be achieved. Extensions and implications for other adiabatic quantum algorithms will be discussed.

Original languageEnglish (US)
Article number150501
JournalPhysical review letters
Issue number15
StatePublished - Oct 6 2016

All Science Journal Classification (ASJC) codes

  • General Physics and Astronomy


Dive into the research topics of 'Adiabatic Quantum Search in Open Systems'. Together they form a unique fingerprint.

Cite this