Adiabatic Quantum Search in Open Systems
Author
Wild, Dominik S.
Gopalakrishnan, Sarang
Knap, Michael
Yao, Norman Y.
Lukin, Mikhail D.
Published Version
https://doi.org/10.1103/PhysRevLett.117.150501Metadata
Show full item recordCitation
Wild, Dominik S., Sarang Gopalakrishnan, Michael Knap, Norman Y. Yao, and Mikhail D. Lukin. 2016. “Adiabatic Quantum Search in Open Systems.” Physical Review Letters 117 (15). https://doi.org/10.1103/physrevlett.117.150501.Abstract
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.Terms of Use
This article is made available under the terms and conditions applicable to Other Posted Material, as set forth at http://nrs.harvard.edu/urn-3:HUL.InstRepos:dash.current.terms-of-use#LAACitable link to this page
http://nrs.harvard.edu/urn-3:HUL.InstRepos:41461278
Collections
- FAS Scholarly Articles [17563]
Contact administrator regarding this item (to report mistakes or request changes)