arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2411.02421quant-ph
收藏

近最优量子算法:在游程编码字符串间寻找最长公共子串

Near-Optimal Quantum Algorithm for Finding the Longest Common Substring between Run-Length Encoded Strings

Tzu-Ching Lee, Han-Hsuan Lin

AI总结:

提出近最优量子算法,在给定前缀和预言机下,以近最优查询复杂度解决游程编码字符串的最长公共子串问题,并证明无预言机时存在下界,算法也适用于最长重复子串。

摘要:

我们给出了一种近最优的量子算法,用于解决两个游程编码(RLE)字符串之间的最长公共子串(LCS)问题,并假设游程长度的前缀和是已知的。我们的算法耗时 $\tilde{\mathcal{O}}(n^{2/3}/d^{1/6-o(1)}\cdot\mathrm{polylog}(\tilde{n}))$,而该问题的查询下界为 $\tilde\Omega(n^{2/3}/d^{1/6})$,其中 $n$ 和 $\tilde{n}$ 分别是输入的编码长度和解码长度,$d$ 是LCS的编码长度。我们为使用前缀和预言机提供了两个理由。首先,我们注意到创建前缀和预言机在RLE压缩中仅产生常数开销。其次,我们证明,在没有预言机的情况下,通过将 $\mathsf{PARITY}$ 归约到该问题,给定两个RLE字符串寻找LCS的量子查询复杂度存在 $\Omega(n/\log^2n)$ 的下界。通过一个小修改,我们的算法还解决了RLE字符串的最长重复子串问题。

英文摘要:

We give a near-optimal quantum algorithm for the longest common substring (LCS) problem between two run-length encoded (RLE) strings, with the assumption that the prefix-sums of the run-lengths are given. Our algorithm costs $\tilde{\mathcal{O}}(n^{2/3}/d^{1/6-o(1)}\cdot\mathrm{polylog}(\tilde{n}))$ time, while the query lower bound for the problem is $\tildeΩ(n^{2/3}/d^{1/6})$, where $n$ and $\tilde{n}$ are the encoded and decoded length of the inputs, respectively, and $d$ is the encoded length of the LCS. We justify the use of prefix-sum oracles for two reasons. First, we note that creating the prefix-sum oracle only incurs a constant overhead in the RLE compression. Second, we show that, without the oracles, there is a $Ω(n/\log^2n)$ lower bound on the quantum query complexity of finding the LCS given two RLE strings due to a reduction of $\mathsf{PARITY}$ to the problem. With a small modification, our algorithm also solves the longest repeated substring problem for an RLE string.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑