caa a22 4500 445886676 CHVBK 20180317145601.0 cr unu---uuuuu 170323e20110801xx s 000 0 eng 10.1007/s11128-010-0212-z doi (NATIONALLICENCE)springer-10.1007/s11128-010-0212-z Tree search and quantum computation [Elektronische Daten] [Luís Tarrataca, Andreas Wichert] 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, namely 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. Springer Science+Business Media, LLC, 2010 Quantum computation nationallicence Tree search nationallicence Heuristic nationallicence Tarrataca Luís GAIPS/INESC-ID, Lisbon, Portugal aut Wichert Andreas GAIPS/INESC-ID, Lisbon, Portugal aut Quantum Information Processing Springer US; http://www.springer-ny.com 10/4(2011-08-01), 475-500 1570-0755 10:4<475 2011 10 11128 https://doi.org/10.1007/s11128-010-0212-z text/html Onlinezugriff via DOI 1 research-article jats NATIONALLICENCE 856 40 https://doi.org/10.1007/s11128-010-0212-z text/html Onlinezugriff via DOI NATIONALLICENCE 700 1- Tarrataca Luís GAIPS/INESC-ID, Lisbon, Portugal aut NATIONALLICENCE 700 1- Wichert Andreas GAIPS/INESC-ID, Lisbon, Portugal aut NATIONALLICENCE 773 0- Quantum Information Processing Springer US; http://www.springer-ny.com 10/4(2011-08-01), 475-500 1570-0755 10:4<475 2011 10 11128 Metadata rights reserved Springer special CC-BY-NC licence nationallicence BK010053 XK010053 XK010000 NATIONALLICENCE NATIONALLICENCE NL-springer