| Abstract | 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. | |
| Year | 2011 | |
| Keywords | quantum search; tree search; artificial intelligence;Miscellaneous; | |
| Authors | Luis Tarrataca, Andreas Wichert | |
| Volume | 7052 | |
| Pages | 172-181 | |
| Pdf File |
|
|
| BibTex |
or see it here
@article { tarrataca11, abstract = {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.}, keywords = {quantum search; tree search; artificial intelligence;Miscellaneous;}, pages = {172-181}, title = {A Hierarchical Sorting Oracle}, volume = {7052}, year = {2011}, author = {Luis Tarrataca and Andreas Wichert} } |
A Hierarchical Sorting Oracle
hide this content
