15 citations · 32 across the 9 of their papers we have counts for
15 papers
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 Lower and Upper Bounds for 2D-Grid and Dyck Language
Andris Ambainis, Kaspars Balodis, Jānis Iraids +6
We study the quantum query complexity of two problems. First, we consider the problem of determining if a sequence of parentheses is a properly balanced one (a Dyck word), with a d…
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…
Classical and Quantum Algorithms for Constructing Text from Dictionary Problem
Kamil Khadiev, Vladislav Remidovskii
We study algorithms for solving the problem of constructing a text (long string) from a dictionary (sequence of small strings). The problem has an application in bioinformatics and…