Lecture notes on quantum algorithms
K Khadiev - arxiv preprint arxiv:2212.14205, 2022 - arxiv.org
The lecture notes contain three parts. The first part is Grover's Search Algorithm with
modifications, generalizations, and applications. The second part is a discussion on the …
modifications, generalizations, and applications. The second part is a discussion on the …
Classical and quantum computations with restricted memory
Abstract Automata and branching programs are known models of computation with restricted
memory. These models of computation were in focus of a large number of researchers …
memory. These models of computation were in focus of a large number of researchers …
Reordering method and hierarchies for quantum and classical ordered binary decision diagrams
K Khadiev, A Khadieva - International computer science symposium in …, 2017 - Springer
We consider Quantum OBDD model. It is restricted version of read-once Quantum Branching
Programs, with respect to “width” complexity. It is known that maximal complexity gap …
Programs, with respect to “width” complexity. It is known that maximal complexity gap …
Quantum online algorithms with respect to space and advice complexity
K Khadiev, A Khadieva, I Mannapov - Lobachevskii Journal of …, 2018 - Springer
Online computation is a well-known area of computer science. We introduce quantum online
algorithms and investigate them with respect to a competitive ratio in two points of view …
algorithms and investigate them with respect to a competitive ratio in two points of view …
Quantum online streaming algorithms with logarithmic memory
K Khadiev, A Khadieva - International Journal of Theoretical Physics, 2021 - Springer
We consider quantum and classical (deterministic or randomize) streaming online
algorithms with respect to competitive ratio. We show that there is a problem that can be …
algorithms with respect to competitive ratio. We show that there is a problem that can be …
On the quantum and classical complexity of solving subtraction games
D Kravchenko, K Khadiev, D Serov - … 2019, Novosibirsk, Russia, July 1–5 …, 2019 - Springer
We study algorithms for solving Subtraction games, which are sometimes referred as one-
heap Nim games. We describe a quantum algorithm which is applicable to any game on …
heap Nim games. We describe a quantum algorithm which is applicable to any game on …
[PDF][PDF] Quantum request-answer game with buffer model for online algorithms. Application for The Most Frequent Keyword Problem.
K Khadiev - QuaInT+ doors, 2021 - ceur-ws.org
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 …
input requests, and an online algorithm answers. We consider a generalized version of the …
Lower bounds and hierarchies for quantum memoryless communication protocols and quantum ordered binary decision diagrams with repeated test
We explore multi-round quantum memoryless communication protocols. These are restricted
version of multi-round quantum communication protocols. The “memoryless” term means …
version of multi-round quantum communication protocols. The “memoryless” term means …
Two-way and one-way quantum and classical automata with advice for online minimization problems
We consider online algorithms. Typically, the model is investigated with respect to the
competitive ratio. In this paper, we explore two-way automata and one-way automata as …
competitive ratio. In this paper, we explore two-way automata and one-way automata as …
Two-way quantum and classical machines with small memory for online minimization problems
K Khadiev, A Khadieva - … on Micro-and Nano-Electronics 2018, 2019 - spiedigitallibrary.org
We consider online algorithms. Typically the model is investigated with respect to
competitive ratio. In this paper, we explore algorithms with small memory. We investigate two …
competitive ratio. In this paper, we explore algorithms with small memory. We investigate two …