Quick Navigation
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.728m\).
Why This Paper Matters
- This paper contributes to the Quantum Simulation research area in the Quantum Articles archive.
- It adds a 2021 reference point for readers tracking recent quantum research.
- We present the quantum algorithm for the Longest Trail Problem.
Paper Tools
Become a member to use research tools
Sign in to open papers, visit source links, share, cite, compare, copy DOI links, request category corrections, and build your reading list.
Show Paper arXiv Publisher Share
Cite This Paper
Copy URL
Compare
Copy DOI Add to Reading List
Category Correction Request
Category Correction Request
Help us improve classification quality by proposing a better category. Every request is reviewed by an admin.
Sign in to submit a category correction request for this paper.
Log In to SubmitReferences & Citation Signals
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.