DOE OSTI · 21027980
Nonadiabatic quantum search algorithms
Abstract
We present two continuous-time quantum search algorithms similar to the adiabatic search algorithm, but now without the requirement of adiabatic evolution. Both algorithms can find the marked state in a time proportional to {radical}(N). The behavior of the first algorithm is, essentially, similar to Grover's algorithm, but the second model possesses the important property that one does not need to single out a given time in order to find the searched state. After a well-defined transition time, this second algorithm will converge towards the marked state with a high probability, provided the parameters of the Hamiltonian are chosen appropriately. This convergence shows a resemblance to quantum search algorithms with a fixed point [L. K. Grover, Phys. Rev. Lett. 95, 150501 (2005)].
Explore related subjects
Keep this discovery
Explore connections, maps & timelines
Perez, A, Romanelli, A. 2007-11-15. Nonadiabatic quantum search algorithms. https://doi.org/10.1103/physreva.76.052318. https://engineeringpapers.com/record/osti%3A21027980/nonadiabatic-quantum-search-algorithms
Citations retain the original authors and DOI and include this site’s record URL. If this discovery service contributed to your research, you can also cite Engineering Papers by Indiciae: BibTeX · RIS.