Generalised Quantum Tree Search

TL;DR

This research explores quantum algorithms for generalized tree search problems, aiming to achieve quantum speedup even with variable branching factors, and discusses two strategies and ongoing work.

Contribution

It introduces quantum algorithmic approaches tailored for generalized tree search with non-constant branching, highlighting two strategies and current developments.

Findings

Potential for quantum speedup in generalized tree search

Two strategies summarized for quantum tree search

Ongoing research on quantum algorithms for complex trees

Abstract

This extended abstract reports on on-going research on quantum algorithmic approaches to the problem of generalised tree search that may exhibit effective quantum speedup, even in the presence of non-constant branching factors. Two strategies are briefly summarised and current work outlined.