Kazan Federal University Digital Repository

Quantum search for a given substring in the text using a hashing technique

Show simple item record

dc.contributor.author Ablayev M.F.
dc.contributor.author Salikhova N.M.
dc.date.accessioned 2021-02-26T20:51:15Z
dc.date.available 2021-02-26T20:51:15Z
dc.date.issued 2020
dc.identifier.issn 2541-7746
dc.identifier.uri https://dspace.kpfu.ru/xmlui/handle/net/163244
dc.description.abstract © 2020, Kazan Federal University. All rights reserved. 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 proposed a quantum algorithm that solves the search problem a) with a high probability of getting the correct result and b) with the same acceleration (by “square root times”) as compared with the classical one, but it c) requires much less memory (based on the number of qubits used) than the previously known quantum algorithms.
dc.relation.ispartofseries Uchenye Zapiski Kazanskogo Universiteta. Seriya Fiziko-Matematicheskie Nauki
dc.subject Quantum algorithms
dc.subject Quantum search
dc.subject String search
dc.title Quantum search for a given substring in the text using a hashing technique
dc.type Article
dc.relation.ispartofseries-issue 3
dc.relation.ispartofseries-volume 162
dc.collection Публикации сотрудников КФУ
dc.relation.startpage 241
dc.source.id SCOPUS25417746-2020-162-3-SID85098996858


Files in this item

This item appears in the following Collection(s)

  • Публикации сотрудников КФУ Scopus [22633]
    Коллекция содержит публикации сотрудников Казанского федерального (до 2010 года Казанского государственного) университета, проиндексированные в БД Scopus, начиная с 1970г.

Show simple item record

Search DSpace


Advanced Search

Browse

My Account