1 citations · 1 across the 4 of their papers we have counts for
4 papers · 1 filter
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-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…
On the Complexity of Solving Subtraction Games
Kamil Khadiev, Dmitry Kravchenko
We study algorithms for solving Subtraction games, which sometimes are referred to as one-heap Nim games. We describe a quantum algorithm which is applicable to any game on DAG, an…
Grover's search with faults on some marked elements
Dmitry Kravchenko, Nikolajs Nahimovs, Alexander Rivosh
Grover's algorithm is a quantum query algorithm solving the unstructured search problem of size using queries. It provides a significant speed-up over any classic…