跳到正文
研踪PaperTrail
← 研踪 PaperTrail

arXiv:2611.17541 · v1

Quantum Algorithm with Quadratic Speedup for 2D Pattern Matching

首次提交 2026-11-13 05:50
版本更新 2026-11-13 05:50
雷达观测 2026-11-17 04:58
arXiv ↗PDF ↗

摘要

We consider the problem of 2 dimensional pattern matching under Quantum Query model. Here, we are given a rectangular text T[0..n1−1][0..n2−1]T[0..n_1-1][0..n_2-1] and a pattern P[0..m1−1][0..m2−1]P[0..m_1 -1][0..m_2-1]. We take N=n1n2N = n_1n_2 and M=m1m2M = m_1m_2 as the sizes of text and the pattern respectively (we assume M<NM < N). Based upon the Quantum Advantage given by Grover's search (and subsequent Dürr-Høyer search), we create a solution which takes O~(N)\tilde{O}(\sqrt{N}) query complexity to answer if the pattern PP exists in TT. Our solution uses deterministic sampling as a primary component. As noted by earlier work in the literature, deterministic sampling is inadequate and witness tables are essential components for 2D matching. In our settings, we assume that the witness table of the pattern is precomputed classically and is available as an oracle to the quantum algorithm. Our main novel component is how to compute and employ a geometric structure called ``skyline" without losing the quantum advantage.

AI 论文解读

基于摘要 · 非全文审阅

此版本尚未生成 AI 解读。解读由后台任务生成并按论文版本保存,登录后共享已有结果。

版本差异

目前只收录了一个版本。收录下一版后,可以对照标题、作者、分类和摘要。

观测到的版本

相邻记录可能跳过中间版本;首次发现 v2 及以上也会标为版本更新。

v1 · 2026-11-13 05:50 · 最新观测版本

Quantum Algorithm with Quadratic Speedup for 2D Pattern Matching

We consider the problem of 2 dimensional pattern matching under Quantum Query model. Here, we are given a rectangular text T[0..n1−1][0..n2−1]T[0..n_1-1][0..n_2-1] and a pattern P[0..m1−1][0..m2−1]P[0..m_1 -1][0..m_2-1]. We take N=n1n2N = n_1n_2 and M=m1m2M = m_1m_2 as the sizes of text and the pattern respectively (we assume M<NM < N). Based upon the Quantum Advantage given by Grover's search (and subsequent Dürr-Høyer search), we create a solution which takes O~(N)\tilde{O}(\sqrt{N}) query complexity to answer if the pattern PP exists in TT. Our solution uses deterministic sampling as a primary component. As noted by earlier work in the literature, deterministic sampling is inadequate and witness tables are essential components for 2D matching. In our settings, we assume that the witness table of the pattern is precomputed classically and is available as an oracle to the quantum algorithm. Our main novel component is how to compute and employ a geometric structure called ``skyline" without losing the quantum advantage.

查看此版本解读 →查看此版本原文 ↗