25 citations · 171 across the 48 of their papers we have counts for
Showing 2019Show all
3 papers · 1 filter
quant-ph2019
Quantum Query Complexity of Dyck Languages with Bounded Height
Kamil Khadiev, Yixin Shen
We consider the problem of determining if a sequence of parentheses is well parenthesized, with a depth of at most h. We denote this language as . We study the quantum quer…
cs.LG2019★ 18 cited
The Quantum Version Of Classification Decision Tree Constructing Algorithm C5.0
Kamil Khadiev, Ilnaz Mannapov, Liliya Safina
In the paper, we focus on complexity of C5.0 algorithm for constructing decision tree classifier that is the models for the classification problem from machine learning. In classic…
quant-ph2019★ 9 cited
Upperbounds on the probability of finding marked connected components using quantum walks
Adam Glos, Nikolajs Nahimovs, Konstantin Balakirev +1
Quantum walk search may exhibit phenomena beyond the intuition from a conventional random walk theory. One of such examples is exceptional configuration phenomenon -- it appears th…