15 citations · 32 across the 9 of their papers we have counts for
8 papers · 1 filter
Exponential Separation between Quantum and Classical Ordered Binary Decision Diagrams, Reordering Method and Hierarchies
Kamil Khadiev, Aliya Khadieva, Alexander Knop
In this paper, we study quantum Ordered Binary Decision Diagrams() model; it is a restricted version of read-once quantum branching programs, with respect to "width" complexi…
Quantum algorithm for Dyck Language with Multiple Types of Brackets
Kamil Khadiev, Dmitry Kravchenko
We consider the recognition problem of the Dyck Language generalized for multiple types of brackets. We provide an algorithm with quantum query complexity $O(\sqrt{n}(\log n)^{0.5k…
Quantum Request-Answer Game with Buffer Model for Online Algorithms
Kamil Khadiev
We consider online algorithms as a request-answer game. An adversary that generates input requests, and an online algorithm answers. We consider a generalized version of the game t…
Quantum-over-classical Advantage in Solving Multiplayer Games
Dmitry Kravchenko, Kamil Khadiev, Danil Serov +1
We study the applicability of quantum algorithms in computational game theory and generalize some results related to Subtraction games, which are sometimes referred to as one-heap…
Quantum Algorithms for the Most Frequently String Search, Intersection of Two String Sequences and Sorting of Strings Problems
Kamil Khadiev, Artem Ilikaev
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…
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…