Quantum jumbled pattern matching
Julio Ju\'arez-Xochitemol, Edgar Ch\'avez

TL;DR
This paper introduces a quantum algorithm that significantly improves the efficiency of online jumbled pattern matching, reducing the query time to square root of the text size, surpassing classical limitations.
Contribution
The paper presents the first quantum algorithm for online jumbled pattern matching with $O(\sqrt{N})$ query time, outperforming classical bounds.
Findings
Quantum algorithm achieves $O(\sqrt{N})$ query time for JPM.
Classical JPM conjecture suggests higher complexity for similar tasks.
Quantum approach surpasses classical lower bounds for online JPM.
Abstract
Let strings, we say that {\em jumble match} if they are permutations of each other. Given a text of size and a string , the problem of \emph{Jumbled Pattern Matching} (JPM) is to determine all substrings in jumbled matching . In classical computing, a widespread conjecture is that JPM requires preprocessing time and space for query time, or query time in the online version, with . In this paper, we present a quantum algorithm for the online JPM in time.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAlgorithms and Data Compression · DNA and Biological Computing · Network Packet Processing and Optimization
