A Quantum String‐Matching Algorithm

A novel quantum algorithm for string‐matching is introduced that significantly enhances the complexity of this fundamental operation, essential in numerous computing applications. The algorithm is designed as a composite quantum denoising procedure applied to a quantum‐generated dot‐matrix plot, whi...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Advanced quantum technologies (Online) Jg. 8; H. 3
Hauptverfasser: Prousalis, Konstantinos, Kydros, Asimakis, Konofaos, Nikos
Format: Journal Article
Sprache:Englisch
Veröffentlicht: 01.03.2025
Schlagworte:
quantum algorithm
quantum dot‐matrix plot
quantum image noise filtering
quantum line pattern extraction
quantum string searching
ISSN:2511-9044, 2511-9044
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:A novel quantum algorithm for string‐matching is introduced that significantly enhances the complexity of this fundamental operation, essential in numerous computing applications. The algorithm is designed as a composite quantum denoising procedure applied to a quantum‐generated dot‐matrix plot, which is treated as an image. This approach effectively identifies regions of similarity between two input strings of lengths N and M. For strings of equal length, the algorithm achieves a time complexity of O(N+log(N)+6N2)$O( {N + log( N ) + 6{{N}^2}} )$ and a space complexity of O(log(2N))$O( {log( {2N} )} )$, demonstrating a clear advantage in quantum computational efficiency. A string‐matching quantum algorithm is introduced, offering significant improvements in computational complexity. The algorithm employs a quantum image denoising method applied to a quantum‐generated dot‐matrix plot view, to identify regions of similarity between two input strings of lengths N and M. For strings of equal length, the algorithm achieves an improved time complexity of O(N+log(N)+6N2)$O( {N + log( N ) + 6{{N}^2}} )$ and space complexity of O(log(2N))$O( {log( {2N} )} )$.
Bibliographie:The publication of the article in OA mode was financially supported by HEAL‐Link.
ISSN:2511-9044
2511-9044
DOI:10.1002/qute.202400250