Item Infomation

Full metadata record
DC FieldValueLanguage
dc.contributor.authorFrançois Le, Gall-
dc.contributor.authorSaeed, Seddighin-
dc.date.accessioned2023-04-26T06:50:27Z-
dc.date.available2023-04-26T06:50:27Z-
dc.date.issued2022-
dc.identifier.urihttps://link.springer.com/article/10.1007/s00453-022-01066-z-
dc.identifier.urihttps://dlib.phenikaa-uni.edu.vn/handle/PNK/8335-
dc.descriptionCC BYvi
dc.description.abstractLongest 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.vi
dc.language.isoenvi
dc.publisherSpringervi
dc.subjectLCSvi
dc.subjectLPSvi
dc.titleQuantum Meets Fine-Grained Complexity Sublinear Time Quantum Algorithms for String Problemsvi
dc.typeBookvi
Appears in Collections
OER - Công nghệ thông tin

Files in This Item: