9 citations · 17 across the 7 of their papers we have counts for
7 papers
Quantum versus Classical Online Streaming Algorithms with Advice
Kamil Khadiev, Aliya Khadieva, Mansur Ziatdinov +4
We consider online algorithms with respect to the competitive ratio. Here, we investigate quantum and classical one-way automata with non-constant size of memory (streaming algorit…
Quantum versus Classical Online Streaming Algorithms with Logarithmic Size of Memory
Kamil Khadiev, Aliya Khadieva, Dmitry Kravchenko +3
We consider online algorithms with respect to the competitive ratio. Here, we investigate quantum and classical one-way automata with non-constant size of memory (streaming algorit…
Exceptional configurations of quantum walks with Grover's coin
Nikolajs Nahimovs, Alexander Rivosh
We study search by quantum walk on a two-dimensional grid using the algorithm of Ambainis, Kempe and Rivosh [AKR05]. We show what the most natural coin transformation - Grover's di…
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…
Quantum walks on two-dimensional grids with multiple marked locations
Nikolajs Nahimovs, Alexander Rivosh
The running time of a quantum walk search algorithm depends on both the structure of the search space (graph) and the configuration of marked locations. While the first dependence…
Search by quantum walks on two-dimensional grid without amplitude amplification
Andris Ambainis, Arturs Backurs, Nikolajs Nahimovs +2
We study search by quantum walk on a finite two dimensional grid. The algorithm of Ambainis, Kempe, Rivosh (quant-ph/0402107) takes O(\sqrt{N log N}) steps and finds a marked locat…