桥接经典与量子字符串匹配:位并行性的计算重构
Bridging Classical and Quantum String Matching: A Computational Reformulation of Bit-Parallelism
AI总结:
本文提出将位并行字符串匹配算法转换到量子框架,并通过嵌入Grover搜索实现二次加速,以Shift-And和Shift-Add为例验证了该方法的简洁性与适应性。
摘要:
字符串匹配是计算机科学中的一个基本问题,在文本检索、生物信息学和数据分析中具有关键应用。近几十年来,在为该问题涌现的众多解决方案中,位并行性显著提升了它们的实际效率,推动了若干面向精确和近似字符串匹配的优化方法的发展。然而,它们在量子计算中的潜力在很大程度上仍未得到探索。本文提出了一条新路径,不仅将位并行字符串匹配算法转换到量子框架中,还通过Grover搜索增强其性能,实现二次加速。通过将量子搜索嵌入位并行模型,我们降低了字符串匹配的时间复杂度,建立了一条将经典算法转化为具有可证明计算优势的量子解决方案的结构化路径。除精确匹配之外,该技术为解决广泛的非标准字符串匹配问题提供了基础,为量子时代的高效文本搜索开辟了新途径。为展示本文所提技术的简洁性和适应性,我们将这一转换与适配过程应用于两个具有里程碑意义的位并行算法:用于精确模式匹配的Shift-And和用于最多k个错误的近似字符串匹配的Shift-Add。
英文摘要:
String matching is a fundamental problem in computer science, with critical applications in text retrieval, bioinformatics, and data analysis. Among the numerous solutions that have emerged for this problem in recent decades, bit-parallelism has significantly enhanced their practical efficiency, leading to the development of several optimized approaches for both exact and approximate string matching. However, their potential in quantum computing remains largely unexplored. This paper presents a novel pathway that not only translates bit-parallel string matching algorithms into the quantum framework but also enhances their performance to achieve a quadratic speedup through Grover's search. By embedding quantum search within a bit-parallel model, we reduce the time complexity of string matching, establishing a structured pathway for transforming classical algorithms into quantum solutions with provable computational advantages. Beyond exact matching, this technique offers a foundation for tackling a wide range of non-standard string matching problems, opening new avenues for efficient text searching in the quantum era. To demonstrate the simplicity and adaptability of the technique presented in this paper, we apply this translation and adaptation process to two landmark bit-parallel algorithms: Shift-And for exact pattern matching and Shift-Add for approximate string matching with up to k errors.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。