Lower bounds for adiabatic quantum algorithms by quantum speed limits

研究成果: 雜誌貢獻期刊論文同行評審

摘要

We introduce a simple framework for estimating lower bounds on the runtime of a broad class of adiabatic quantum algorithms. The central formula consists of calculating the variance of the final Hamiltonian with respect to the initial state. After examining adiabatic versions of certain keystone circuit-based quantum algorithms, this technique is applied to adiabatic quantum algorithms with undetermined speedup. In particular, we analytically obtain lower bounds on adiabatic algorithms for finding k-clique in random graphs. Additionally, for a particular class of Hamiltonian, it is straightforward to prove the equivalence between our framework and the conventional approach based on spectral gap analysis.

原文???core.languages.en_GB???
文章編號033175
期刊Physical Review Research
5
發行號3
DOIs
出版狀態已出版 - 7月 2023

指紋

深入研究「Lower bounds for adiabatic quantum algorithms by quantum speed limits」主題。共同形成了獨特的指紋。

引用此