Quantum Pattern Matching in Generalised Degenerate Strings

Fuente: arXiv
Saved in:
Bibliographic Details
Main Authors: Equi, Massimo, Khan, Md Rabiul Islam, Mäkinen, Veli
Format: Preprint
Published: 2026
Subjects:
Online Access:
Tags: Add Tag
No Tags, Be the first to tag this record!
_version_ 1866914401969242112
author Equi, Massimo
Khan, Md Rabiul Islam
Mäkinen, Veli
author_facet Equi, Massimo
Khan, Md Rabiul Islam
Mäkinen, Veli
contents A degenerate string is a sequence of sets of characters. A generalized degenerate (GD) string extends this notion to the sequence of sets of strings, where strings of the same set are of equal length. Finding an exact match for a pattern string inside a GD string can be done in $O(mn+N)$ time (Ascone et al., WABI 2024), where $m$ is the pattern length, $n$ is the number of strings and $N$ the total length of strings constituting the GD string. We modify this algorithm to work under a quantum model of computation, achieving running time $\tilde{O}(\sqrt{mnN})$.
format Preprint
id arxiv_https___arxiv_org_abs_2603_16297
institution arXiv
publishDate 2026
record_format arxiv
spellingShingle Quantum Pattern Matching in Generalised Degenerate Strings
Equi, Massimo
Khan, Md Rabiul Islam
Mäkinen, Veli
Quantum Physics
Data Structures and Algorithms
A degenerate string is a sequence of sets of characters. A generalized degenerate (GD) string extends this notion to the sequence of sets of strings, where strings of the same set are of equal length. Finding an exact match for a pattern string inside a GD string can be done in $O(mn+N)$ time (Ascone et al., WABI 2024), where $m$ is the pattern length, $n$ is the number of strings and $N$ the total length of strings constituting the GD string. We modify this algorithm to work under a quantum model of computation, achieving running time $\tilde{O}(\sqrt{mnN})$.
title Quantum Pattern Matching in Generalised Degenerate Strings
topic Quantum Physics
Data Structures and Algorithms
url https://arxiv.org/abs/2603.16297