Author:
Sun Jie,Cai Dunbo,Lu Songfeng,Qian Ling,Zhang Runqing
Abstract
AbstractIn this paper, we further verify the validity of the quantum partial adiabatic search algorithm which was initialized in the previous related works by revisiting its quantum circuit model. The main results got here are as follows. When considering implementing quantum partial adiabatic evolution on a quantum circuit, a correction is given for the time slice estimation for the first stage during this approximation in the previous related works, new evidence is provided for a time complexity cost $O(\sqrt{N}/M)$
O
(
N
/
M
)
of quantum partial adiabatic algorithm is impossible, and the correct time complexity $O(\sqrt{N/M})$
O
(
N
/
M
)
of it is emphasized once more according to its circuit correspondence, in which N is the total number of elements in the search problem of which M of them are the marked ones. The findings exposed are hopeful for revisiting quantum partial adiabatic evolution and its connection with the quantum circuit model.
Funder
the General Program of Educational Commission of Anhui Province of China
the Research Start-up Funds of Anhui University
Publisher
Springer Science and Business Media LLC
Reference38 articles.
1. Farhi E, Goldstone J, Gutmann S, et al. Quantum computation by adiabatic evolution. 2000. arXiv:quant-ph/0001106 [quant-ph].
2. Farhi E, Goldstone J, Gutmann S et al.. A quantum adiabatic evolution algorithm applied to random instances of an NP-complete problem. Science. 2001;292:472.
3. Aharonov D, van Dam W, Kempe J et al.. Adiabatic quantum computation is equivalent to standard quantum computation. SIAM J Comput. 2007;37:166–94.
4. Mizel A, Lidar DA, Mitchell M. Simple proof of equivalence between adiabatic quantum computation and the circuit model. Phys Rev Lett. 2007;99:070502.
5. Albash T, Lidar DA. Adiabatic quantum computation. Rev Mod Phys. 2018;90:015002.