Quantum Algorithm for the Longest Trail Problem
Quantum Physics
2021-12-30 v1 Data Structures and Algorithms
Abstract
We present the quantum algorithm for the Longest Trail Problem. The problem is to search the longest edge-simple path for a graph with vertexes and 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 .
Keywords
Cite
@article{arxiv.2112.13847,
title = {Quantum Algorithm for the Longest Trail Problem},
author = {Kamil Khadiev and Ruslan Kapralov},
journal= {arXiv preprint arXiv:2112.13847},
year = {2021}
}
Comments
RuFiDim 2021. arXiv admin note: substantial text overlap with arXiv:2112.13319