Электронный архив

ПросмотрПубликации сотрудников КФУ Scopus по теме "Quantum algorithms"

ПросмотрПубликации сотрудников КФУ Scopus по теме "Quantum algorithms"

Отсортировать по:Сортировать:Результаты поиска на странице:

  • Khadiev K.; Kravchenko D. (2021)
    We consider the recognition problem of the Dyck Language generalized for multiple types of brackets. We provide an algorithm with quantum query complexity O(n(logn)0.5k), where n is the length of input and k is the maximal ...
  • Ambainis A.; Balodis K.; Iraids J.; Khadiev K.; Kļevickis V.; Prūsis K.; Shen Y.; Smotrovs J.; Vihrovs J. (2020)
    © Nathalie Bertrand; licensed under Creative Commons License CC-BY 45th International Symposium on Mathematical Foundations of Computer Science (MFCS 2020). We study the quantum query complexity of two problems. First, we ...
  • Ablayev M.F.; Salikhova N.M. (2020)
    © 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 ...
  • Khadiev K.; Safina L. (2021)
    We suggest the quantum version of prediction using random forest model for binary classification problem. The idea of the paper is to combine quantum amplitude amplification algorithm and the probabilistic aggregation of ...

Поиск в электронном архиве


Расширенный поиск

Просмотр

Моя учетная запись