The current work is being developed in both research directions discussed above. For (1) we seek a formal proof of the quadratic enhancement for non-constant trees. The algorithm is also being tested in various goal-based agents, and simulated in IBM’s quantum platform [1]}. For (2) the quantum pruning strategy is being applied in the context of informed tree search for an arbitrary number of qubits scheme. Moreover, a quantum greedy best-first algorithm that uses amplitude amplification and exponential search as subroutines is being developed.
