Quick Navigation
Topics
Quantum Error Correction Fault Tolerance
Quantum Simulation
Entanglement Theory Quantum Correlations
Quantum Pattern Matching in Generalised Degenerate Strings
arXiv
Authors: Massimo Equi, Md Rabiul Islam Khan, Veli Mäkinen
Year
2026
Paper ID
30707
Status
Preprint
Abstract Read
~2 min
Abstract Words
101
Citations
N/A
Abstract
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 {O}\(sqrt{mnN}\).
Why This Paper Matters
- This paper contributes to the Quantum Simulation research area in the Quantum Articles archive.
- It adds a 2026 reference point for readers tracking recent quantum research.
- A degenerate string is a sequence of sets of characters.
Paper Tools
Become a member to use research tools
Sign in to open papers, visit source links, share, cite, compare, copy DOI links, request category corrections, and build your reading list.
Show Paper arXiv Publisher Share
Cite This Paper
Copy URL
Compare
Copy DOI Add to Reading List
Category Correction Request
Category Correction Request
Help us improve classification quality by proposing a better category. Every request is reviewed by an admin.
Sign in to submit a category correction request for this paper.
Log In to SubmitReferences & Citation Signals
Community Reactions
Quick sentiment from readers on this paper.
Score:
0
Likes: 0
Dislikes: 0
Sign in to react to this paper.
Discussion & Reviews (Moderated)
Average Rating: 0.0 / 5 (0 ratings)
No written reviews yet.