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

François Le Gall Saeed Seddighin

Published in: ITCS (2022)

Keyphrases

fine grained
computational complexity
optimization problems
coarse grained
data structure
worst case
decision problems
quantum computing
access control
np complete
binary search trees
data lineage
knowledge base
tightly coupled
parallel algorithm
np hard
metadata