Show Paper arXiv Publisher

Quick Navigation

Overview Topics Abstract Paper Tools References Reactions Discussion Publication Related

Topics

Quantum Error Correction Fault Tolerance Quantum Optimization Quantum Simulation

Quantum Algorithm for the Longest Trail Problem

arXiv
Authors: Kamil Khadiev, Ruslan Kapralov

Year

2021

Paper ID

40240

Status

Preprint

Abstract Read

~2 min

Abstract Words

53

Citations

N/A

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

Paper Tools

Show Paper arXiv Publisher Compare Add to Reading List

References & Citation Signals

[1] DOI https://doi.org/arXiv:2112.13847 [2] arXiv https://arxiv.org/abs/2112.13847 [3] Publisher https://arxiv.org/abs/2112.13847

Local Citation Graph (Related-Paper Links)

Current Paper #40240 #41479 Energy Landscape Structure of S... #41475 Stochastic optimization for lea... #41469 Differentiable quantum computat... #41465 Confined Klein-Gordon oscillato...

External citation index: OpenAlex citation signal

Community Reactions

Quick sentiment from readers on this paper.

Score: 0
Likes: 0 Dislikes: 0

Sign in to react to this paper.

Discussion & Reviews (Moderated)

Average Rating: 0.0 / 5 (0 ratings)

No written reviews yet.