Year: 2024
Type: article
Abstract: 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 and a space complexity of , demonstrating a clear advantage in quantum computational efficiency.
Source: Advanced Quantum Technologies
Institution: Aristotle University of Thessaloniki
Language: English
Subfield: Artificial Intelligence
Field: Computer Science
Domain: Physical Sciences
Open Access status: hybrid
Estimated APC paid: $4,220
OpenAlex ID: W4403473691