A fast quantum mechanical algorithm for database search
STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
A framework for structured quantum search
PhysComp96 Proceedings of the fourth workshop on Physics and computation
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
Exponential algorithmic speedup by a quantum walk
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
Quantum Walk on the Line
Quantum Computing (Natural Computing Series)
Quantum Computing (Natural Computing Series)
An Introduction to Quantum Computing
An Introduction to Quantum Computing
Tree search and quantum computation
Quantum Information Processing
| Hi-index | 0.00 |
Classical tree search algorithms mimic the problem solving capabilities traditionally performed by humans. In this work we propose a unitary operator, based on the principles of reversible computation, focusing on hierarchical tree search concepts for sorting purposes. These concepts are then extended in order to build a quantum oracle which, combined with Grover's quantum algorithm, can be employed as a quantum hierarchical search mechanism whilst taking advantage of a quadratic speedup. Finally, we show how the developed model can be extended in order to perform a N-level depth-limited search.