Item Infomation


Title: 
Quantum Meets Fine-Grained Complexity Sublinear Time Quantum Algorithms for String Problems
Authors: 
François Le, Gall
Saeed, Seddighin
Issue Date: 
2022
Publisher: 
Springer
Abstract: 
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 results shed light on a very surprising fact: Although the classic solutions for LCS and LPS are almost identical (via suffix trees), their quantum computational complexities are different. While we give an exact O~(n−−√) time algorithm for LPS, we prove that LCS needs at least time Ω~(n2/3) even for 0/1 strings.
Description: 
CC BY
URI: 
https://link.springer.com/article/10.1007/s00453-022-01066-z
https://dlib.phenikaa-uni.edu.vn/handle/PNK/8335
Appears in Collections
OER - Công nghệ thông tin
ABSTRACTS VIEWS

44

FULLTEXT VIEWS

66

Files in This Item: