Nonadiabatic Quantum Search Algorithm with Analytical Success Rate

In nonadiabatic quantum search algorithm, it is difficult to calculate the success rate analytically. We develop the nonadiabatic quantum search algorithm by adding a counterdiabatic driving term to the original time-dependent Hamiltonian. The Hamiltonian we structured is diagonal in eigen picture a...

Full description

Saved in:
Bibliographic Details
Published in:International journal of theoretical physics 2019-03, Vol.58 (3), p.939-949
Main Authors: Li, Feng-Guang, Bao, Wan-Su, Li, Tan, Huang, He-liang, Zhang, Shuo, Fu, Xiang-Qun
Format: Article
Language:English
Subjects:
Algorithms
Elementary Particles
Mathematical analysis
Mathematical and Computational Physics
Physics
Physics and Astronomy
Quantum computing
Quantum Field Theory
Quantum Physics
Schrodinger equation
Search algorithms
Success
Theoretical
Time dependence
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:In nonadiabatic quantum search algorithm, it is difficult to calculate the success rate analytically. We develop the nonadiabatic quantum search algorithm by adding a counterdiabatic driving term to the original time-dependent Hamiltonian. The Hamiltonian we structured is diagonal in eigen picture and the time-independent Schrödinger equation is solved analytically. Then, we get an accurate analytical expression of success rate in nonadiabatic quantum search algorithm. Utilizing this expression, a sufficient condition, which can ensure the success rate be one with arbitrary evolution time, was found. Moreover, we can choose the better parameters by calculating the precise success rate according to the expression.
ISSN:0020-7748
1572-9575
DOI:10.1007/s10773-018-3986-x