Quantum Algorithm for the Longest Trail Problem

12/27/2021

∙

by   Kamil Khadiev, et al.

∙

0

∙

share

We present the quantum algorithm for the Longest Trail Problem. The problem is to search the longest edge-simple path for a graph with n vertexes and m edges. Here edge-simple means no edge occurs in the path twice, but vertexes can occur several times. The running time of our algorithm is O^*(1.728^m).