Showing quant-phShow all
3 papers · 1 filter
quant-ph2021
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…
quant-ph2020
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…
quant-ph2018
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…