Phase transitions and the search problem
Artificial Intelligence - Special volume on frontiers in problem solving: phase transitions and complexity
A fast quantum mechanical algorithm for database search
STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
Strengths and Weaknesses of Quantum Computing
SIAM Journal on Computing
An Improved Exponential-Time Algorithm for k-SAT
FOCS '98 Proceedings of the 39th Annual Symposium on Foundations of Computer Science
| Hi-index | 0.01 |
Search is one of the most pervasive problem-solving techniques in computer science. Search-based problem solvers work by enumerating and examining the candidate solutions to some computational problem in an exhaustive, random or intelligent manner. A great deal is known about the efficiency of different kinds of classical search algorithms. However, the existing complexity analyses are predicated on the assumption that the algorithms are being run on some kind of classical computer, such as a PC, a UNIX workstation, or even a supercomputer. However, em quantu computers have ways of representing and manipulating information that are not available to any classical digital computer. Consequently, the kinds of search algorithms that can be run on quantum computers are qualitatively different from those that can be run of classical computers. As a result, quantum searches are vastly more efficient than classical searches on certain kinds of problems. This article reviews the ideas behind quantum search and describe its applications in science and engineering.