Quantum Tree Search with Qiskit

Abstract

We indicate the quantum tree search qiskit implementation by popular examples from symbolical artificial intelligence, the 3-puzzle, 8-puzzle and the ABC blocks world. Qiskit is an open-source software development kit (SDK) for working with quantum computers at the level of circuits and algorithms from IBM. The objects are represented by symbols and adjectives. Two principles are presented. Either the position description (adjective) is fixed and the class descriptors moves (is changed) or, in the reverse interpretation, the class descriptor is fixed and the position descriptor (adjective) moves (is changed). We indicate how to decompose the permutation operator that executes the rules by the two principles. We demonstrate that the the branching factor is reduced by Grover’s amplification to the square root of the average branching factor and not to the maximal branching factor as previously assumed.