Corpus ID: 225061978

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

@article{Gall2020QuantumMF,
  title={Quantum Meets Fine-grained Complexity: Sublinear Time Quantum Algorithms for String Problems},
  author={Franccois Le Gall and Saeed Seddighin},
  journal={ArXiv},
  year={2020},
  volume={abs/2010.12122}
}

Franccois Le Gall, Saeed Seddighin

Published 2020

Mathematics, Computer Science, Physics

ArXiv

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… CONTINUE READING

View PDF on arXiv

Save to Library

Create Alert

Cite

Launch Research Feed