Search an unsorted database with quantum mechanics |
| |
Authors: | Long Guilu and Liu Yang |
| |
Affiliation: | (1) Key Laboratory for Atomic and Molecular Nanosciences of Ministry of Education, Department of Physics, Tsinghua University, Beijing, 100084, China;(2) Tsinghua National Laboratory for Information Science and Technology, Tsinghua University, Beijing, 100084, China |
| |
Abstract: | In this article, we review quantum search algorithms for unsorted database search problem. Unsorted database search is a very
important problem in science and technology. In a quantum computer, a marked state can be found with very high probability
using the Grover’s algorithm, or exactly with the Long algorithm. We review the Grover algorithm and related generalizations.
In particular, we review the phase matching conditions in quantum search algorithm. Several issues that may cause confusion
about the quantum search algorithm are also clarified. |
| |
Keywords: | quantum search algorithm Grover algorithm Long algorithm Phase matching quantum amplitude amplification duality computer |
本文献已被 万方数据 SpringerLink 等数据库收录! |
|