Quantum Meets Fine-Grained Complexity: Sublinear Time Quantum Algorithms for String Problems

Longest common substring (LCS), longest palindrome substring (LPS), and Ulam distance (UL) are three fundamental string problems that can be classically solved in near linear time. In this work, we present sublinear time quantum algorithms for these problems along with quantum lower bounds. Our resu...

Full description

Bibliographic Details

Published in:	Algorithmica Vol. 85; no. 5; pp. 1251 - 1286
Main Authors:	Le Gall, François, Seddighin, Saeed
Format:	Journal Article
Language:	English
Published:	New York Springer US 01.05.2023 Springer Nature B.V
Subjects:	Algorithm Analysis and Problem Complexity Algorithms Computer Science Computer Systems Organization and Communication Networks Data Structures and Information Theory Lower bounds Mathematics of Computing Strings Suffix trees Theory of Computation String algorithms Quantum algorithms Sublinear-time algorithms Fine-grained complexity
ISSN:	0178-4617, 1432-0541
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!