Abstract
This article presents efficient quantum solutions for exact multiple pattern matching to process the biological sequences. The classical solution takesΟ(mN) time for matching m patterns overNsized text database. The quantum search mechanism is a core for pattern matching, as this reduces time complexity and achieves computational speedup. Few quantum methods are available for multiple pattern matching, which executes search oracle for each pattern in successive iterations. Such solutions are likely acceptable because of classical equivalent quantum designs. However, these methods are constrained with the inclusion of multiplicative factor m in their complexities. An optimal quantum design is to execute multiple search oracle in parallel on the quantum processing unit with a single-core that completely removes the multiplicative factorm, however, this method is impractical to design. We have no effective quantum solutions to process multiple patterns at present. Therefore, we propose quantum algorithms using quantum processing unit withCquantum cores working on shared quantum memory. This quantum parallel design would be effective for searching alltexact occurrences of each pattern. To our knowledge, no attempts have been made to design multiple pattern matching algorithms on quantum multicore processor. Thus, some quantum remarkable exact single pattern matching algorithms are enhanced here with their equivalent versions, namely enhanced quantum memory processing based exact algorithm and enhanced quantum-based combined exact algorithm for multiple pattern matching. Our quantum solutions find alltexact occurrences of each pattern inside the biological sequence in $O((m/C)\sqrt{N})$ and $O((m/C)\sqrt{t})$ time complexities. This article shows the hybrid simulation of quantum algorithms to validate quantum solutions. Our theoretical–experimental results justify the significant improvements that these algorithms outperform over the existing classical solutions and are proven effective in quantum counterparts.
Reference57 articles.
1. Quantum algorithms for string processing;Ablayev,2020
2. Quantum approximate string matching for large alphabets;Aborot;Theory & Practice of Computation,2017
3. Biological sequences and the exact string matching problem;Basel,2006
4. Representation of Boolean function in terms of quantum computations;Bogdanova,2018
5. Tight bounds on quantum searching;Boyer;Fortschritte der Physik,1998
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献