Quantum search for a given substring in the text using a hashing technique
The problem of searching for a given substring in the text was considered. It is known that classical algorithms solve this problem in a linear time depending on the length of the text and the specified template. Quantum algorithms speed up the search by “square root times”. In this paper, we pro...
Saved in:
Main Author: | N.M. Salikhova |
---|---|
Format: | Article |
Language: | English |
Published: |
Kazan Federal University
2020-09-01
|
Series: | Учёные записки Казанского университета: Серия Физико-математические науки |
Subjects: | |
Online Access: | https://kpfu.ru/uz-eng-phm-2020-3-1.html |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
Quantum-Enhanced Generalized Pattern Search Optimization
by: Colton Mikes, et al.
Published: (2024-09-01) -
Shallow-Depth Quantum Circuit for Unstructured Database Search
by: Junpeng Zhan
Published: (2024-10-01) -
Quantum Circuit Architecture Search on a Superconducting Processor
by: Kehuan Linghu, et al.
Published: (2024-11-01) -
Characterizing Grover search algorithm on large-scale superconducting quantum computers
by: Muhammad AbuGhanem
Published: (2025-01-01) -
Hierarchical Quantum Architecture Search for Variational Quantum Algorithms
by: Tong Zhao, et al.
Published: (2024-01-01)