Comparisons of Classic and Quantum String Matching Algorithms
In this project, we study the string matching problem. We design a quantum string-matching algorithm for noisy intermediate-scale quantum (NISQ) computers, given the current leading quantum processing units (QPUs) having no more than a few hundred qubits. We also compare the performance of classic algorithms and quantum algorithms under various settings. Our study provides a comprehensive and quantitative guide for users to choose appropriate classic or quantum algorithms for their string-matching problems.
This work is licensed under a Creative Commons Attribution-ShareAlike 4.0 International License.