arXiv · 2611.17541
Quantum Algorithm with Quadratic Speedup for 2D Pattern Matching
Abstract
We consider the problem of 2 dimensional pattern matching under Quantum Query model. Here, we are given a rectangular text $T[0..n_1-1][0..n_2-1]$ and a pattern $P[0..m_1 -1][0..m_2-1]$. We take $N = n_1n_2$ and $M = m_1m_2$ as the sizes of text and the pattern respectively (we assume $M < N$). Based upon the Quantum Advantage given by Grover's search (and subsequent Dürr-Høyer search), we create a solution which takes $\tilde{O}(\sqrt{N})$ query complexity to answer if the pattern $P$ exists in $T$. 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.
Explore related subjects
Keep this discovery
Explore connections, maps & timelines
Rishabh Gala, Rahul Shah. 2026-11-12. Quantum Algorithm with Quadratic Speedup for 2D Pattern Matching. https://searcharxiv.com/abs/2611.17541
Citations retain the original authors and DOI and include this site’s record URL. If this discovery service contributed to your research, you can also cite Searcharxiv by Indiciae: BibTeX · RIS.