Tree Search and Quantum Computation
arXiv:1502.01951 · doi:10.1007/s11128-010-0212-z
Abstract
Traditional tree search algorithms supply a blueprint for modeling problem solving behaviour. A diverse spectrum of problems can be formulated in terms of tree search. Quantum computation, in particular Grover's algorithm, has aroused a great deal of interest since it allows for a quadratic speedup to be obtained in search procedures. In this work we consider the impact of incorporating classical search concepts alongside Grover's algorithm into a hybrid quantum search system. Some of the crucial points examined include: (1) the reverberations of contemplating the use of non-constant branching factors; (2) determining the consequences of incorporating an heuristic perspective into a quantum tree search model.
References in corpus (11)
- Quantum Computation and Decision Trees
- A Quantum Random Walk Search Algorithm
- Exponential algorithmic speedup by quantum walk
- Quantum computers can search rapidly by using almost any transformation
- From quantum cellular automata to quantum lattice gases
- Grover Algorithm with zero theoretical failure rate
- An example of the difference between quantum and classical random walks
- A different kind of quantum search
- Tradeoffs in the Quantum Search Algorithm
- Simple Algorithm for Partial Quantum Search
- A family of sure-success quantum algorithms for solving a generalized Grover search problem