Quantum Algorithms For String Problems
We design near-optimal quantum query algorithms for two important text processing problems: Longest Common Substring and Lexicographically Minimal String Rotation. Specifically, we show that: - Longest Common Substring can be solved by a quantum algorithm in Õ(n²⸍³) time, improving upon the Õ(n⁵⸍...
| Main Author: | |
|---|---|
| Other Authors: | |
| Format: | Thesis |
| Published: |
Massachusetts Institute of Technology
2023
|
| Online Access: | https://hdl.handle.net/1721.1/147440 |