Quick Navigation
Topics
Quantum Optimization
Quantum Machine Learning
A Note on Quantum Divide and Conquer for Minimal String Rotation
arXiv
Authors: Qisheng Wang
Year
2022
Paper ID
58320
Status
Preprint
Abstract Read
~2 min
Abstract Words
87
Citations
N/A
Abstract
Lexicographically minimal string rotation is a fundamental problem in string processing that has recently garnered significant attention in quantum computing. Near-optimal quantum algorithms have been proposed for solving this problem, utilizing a divide-and-conquer structure. In this note, we show that its quantum query complexity is sqrt{n} cdot 2^{O\(sqrt{log n}\)}, improving the prior result of sqrt{n} cdot 2^{\(log n\)1/2+varepsilon} due to Akmal and Jin (SODA 2022). Notably, this improvement is quasi-polylogarithmic, which is achieved by only logarithmic level-wise optimization using fault-tolerant quantum minimum finding.
Why This Paper Matters
- This paper contributes to the Quantum Machine Learning research area in the Quantum Articles archive.
- It adds a 2022 reference point for readers tracking recent quantum research.
- Lexicographically minimal string rotation is a fundamental problem in string processing that has recently garnered significant attention in quantum computing.
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.