Work

Quantum Algorithm for the Longest Trail Problem

Year: 2021

Type: preprint

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 $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)$.

Source: arXiv (Cornell University)

DOI: 10.48550/arxiv.2112.13847

Authors: Khadiev, Kamil, Kapralov, Ruslan

Institution: Kazan Federal University

Language: English

Topic: Quantum Computing Algorithms and Architecture

Subfield: Artificial Intelligence

Field: Computer Science

Domain: Physical Sciences

Open Access status: green

Funder: Kazan Federal University

OpenAlex ID: W4226255989

Cites: 1

Cited by: 2

Related to: 10