Kazan Federal University Digital Repository

Quantum Algorithms for the Most Frequently String Search, Intersection of Two String Sequences and Sorting of Strings Problems

Show simple item record

dc.contributor.author Khadiev K.
dc.contributor.author Ilikaev A.
dc.date.accessioned 2020-01-15T21:18:09Z
dc.date.available 2020-01-15T21:18:09Z
dc.date.issued 2019
dc.identifier.issn 0302-9743
dc.identifier.uri https://dspace.kpfu.ru/xmlui/handle/net/155613
dc.description.abstract © 2019, Springer Nature Switzerland AG. We study algorithms for solving three problems on strings. The first one is the Most Frequently String Search Problem. The problem is the following. Assume that we have a sequence of n strings of length k. The problem is finding the string that occurs in the sequence most often. We propose a quantum algorithm that has a query complexity (formula presented). This algorithm shows speed-up comparing with the deterministic algorithm that requires (formula presented) queries. The second one is searching intersection of two sequences of strings. All strings have the same length k. The size of the first set is n and the size of the second set is m. We propose a quantum algorithm that has a query complexity (formula presented). This algorithm shows speed-up comparing with the deterministic algorithm that requires (formula presented) queries. The third problem is sorting of n strings of length k. On the one hand, it is known that quantum algorithms cannot sort objects asymptotically faster than classical ones. On the other hand, we focus on sorting strings that are not arbitrary objects. We propose a quantum algorithm that has a query complexity (formula presented). This algorithm shows speed-up comparing with the deterministic algorithm (radix sort) that requires (formula presented) queries, where d is a size of the alphabet.
dc.relation.ispartofseries Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
dc.subject Quantum algorithm
dc.subject Quantum computation
dc.subject Quantum models
dc.subject Query model
dc.subject Sorting
dc.subject String search
dc.title Quantum Algorithms for the Most Frequently String Search, Intersection of Two String Sequences and Sorting of Strings Problems
dc.type Conference Paper
dc.relation.ispartofseries-volume 11934 LNCS
dc.collection Публикации сотрудников КФУ
dc.relation.startpage 234
dc.source.id SCOPUS03029743-2019-11934-SID85076976055


Files in this item

This item appears in the following Collection(s)

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

Show simple item record

Search DSpace


Advanced Search

Browse

My Account

Statistics