2026-09-18T23:43:47Zhttps://dspace.mit.edu/server/oai/requestoai:dspace.mit.edu:1721.1/1474402023-01-20T03:25:57Zcom_1721.1_7582com_1721.1_7581col_1721.1_131023
Williams, Virginia Vassilevska
Williams, R. Ryan
Jin, Ce
Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science
2023-01-19T19:50:29Z
2023-01-19T19:50:29Z
2022-09
2022-10-19T18:57:24.615Z
https://hdl.handle.net/1721.1/147440
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⁵⸍⁶)-time algorithm by Le Gall and Seddighin (2022). Moreover, given a length threshold 1 ≤ d ≤ n, our algorithm decides in n²⸍³⁺⁰⁽¹⁾/d¹⸍⁶ time whether the longest common substring has length at least d, almost matching the Omega(n²⸍³/d¹⸍⁶) quantum query lower bound.
- Lexicographically Minimal String Rotation can be solved by a quantum algorithm in n¹⸍²⁺⁰⁽¹⁾ time, improving upon the Õ(n³⸍⁴)-time algorithm by Wang and Ying (2020), and almost matching the Ω(√n) quantum query lower bound.
Our algorithm for Lexicographically Minimal String Rotation is obtained by speeding up a divide-and-conquer algorithm using nested Grover search and quantum minimum finding. Combining this divide-and-conquer idea with the deterministic sampling algorithm of Vishkin (1991) and Ramesh and Vinay (2003), we achieve a quantum speed-up of the String Synchronizing Set technique introduced by Kempa and Kociumaka (2019). Our algorithm for Longest Common Substring applies this string synchronizing set in the quantum walk framework.
S.M.
Massachusetts Institute of Technology
In Copyright - Educational Use Permitted
Copyright MIT
http://rightsstatements.org/page/InC-EDU/1.0/
Quantum Algorithms For String Problems
Thesis
application/pdf
Master
Master of Science in Electrical Engineering and Computer Science
Publication
unknown
unknown
<Publication xmlns="https://www.openaire.eu/cerif-profile/1.1/" id="a660fa8d-9692-4ac2-8072-26333fa167ae">
<Type xmlns="https://www.openaire.eu/cerif-profile/vocab/COAR_Publication_Types">http://purl.org/coar/resource_type/c_1843</Type>
<Title>Quantum Algorithms For String Problems</Title>
<PublishedIn>
<Publication>
</Publication>
</PublishedIn>
<PublicationDate>2022-09</PublicationDate>
<Authors>
<Author>
<DisplayName>Jin, Ce</DisplayName>
<Affiliation>
<OrgUnit>
</OrgUnit>
</Affiliation>
</Author>
</Authors>
<Editors>
</Editors>
<Publishers>
<Publisher>
<DisplayName>Massachusetts Institute of Technology</DisplayName>
<OrgUnit />
</Publisher>
</Publishers>
<License>http://rightsstatements.org/page/InC-EDU/1.0/</License>
<Abstract>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⁵⸍⁶)-time algorithm by Le Gall and Seddighin (2022). Moreover, given a length threshold 1 ≤ d ≤ n, our algorithm decides in n²⸍³⁺⁰⁽¹⁾/d¹⸍⁶ time whether the longest common substring has length at least d, almost matching the Omega(n²⸍³/d¹⸍⁶) quantum query lower bound.
- Lexicographically Minimal String Rotation can be solved by a quantum algorithm in n¹⸍²⁺⁰⁽¹⁾ time, improving upon the Õ(n³⸍⁴)-time algorithm by Wang and Ying (2020), and almost matching the Ω(√n) quantum query lower bound.
Our algorithm for Lexicographically Minimal String Rotation is obtained by speeding up a divide-and-conquer algorithm using nested Grover search and quantum minimum finding. Combining this divide-and-conquer idea with the deterministic sampling algorithm of Vishkin (1991) and Ramesh and Vinay (2003), we achieve a quantum speed-up of the String Synchronizing Set technique introduced by Kempa and Kociumaka (2019). Our algorithm for Longest Common Substring applies this string synchronizing set in the quantum walk framework.</Abstract>
<Access xmlns="http://purl.org/coar/access_right"
>
</Access>
</Publication>