Zobrazeno 1 - 10
of 87
pro vyhledávání: '"A. Rivosh"'
Autor:
Khadiev, Kamil, Khadieva, Aliya, Ziatdinov, Mansur, Kravchenko, Dmitry, Rivosh, Alexander, Yamilov, Ramis, Mannapov, Ilnaz
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 algorithms) as a model for online algorithms. We construct problems that can
Externí odkaz:
http://arxiv.org/abs/1802.05134
Autor:
Khadiev, Kamil, Khadieva, Aliya, Kravchenko, Dmitry, Rivosh, Alexander, Yamilov, Ramis, Mannapov, Ilnaz
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 algorithms) as a model for online algorithms. We construct problems that can
Externí odkaz:
http://arxiv.org/abs/1710.09595
Autor:
Nahimovs, Nikolajs, Rivosh, Alexander
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 diffusion transformation - has a wide class of exceptional configuration
Externí odkaz:
http://arxiv.org/abs/1509.06862
Grover's algorithm is a quantum query algorithm solving the unstructured search problem of size $N$ using $O(\sqrt{N})$ queries. It provides a significant speed-up over any classical algorithm \cite{Gro96}. The running time of the algorithm, however,
Externí odkaz:
http://arxiv.org/abs/1508.05108
Autor:
Nahimovs, Nikolajs, Rivosh, Alexander
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 have been studied in a number of papers, the second dependence remains
Externí odkaz:
http://arxiv.org/abs/1507.03788
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 location with probability O(1/log N) for grid of size \sqrt{N} * \sqrt{N}.
Externí odkaz:
http://arxiv.org/abs/1112.3337
Publikováno v:
Proc. 16th ACM-SIAM SODA, p. 1099-1108 (2005)
We show how to search N items arranged on a $\sqrt{N}\times\sqrt{N}$ grid in time $O(\sqrt N \log N)$, using a discrete time quantum walk. This result for the first time exhibits a significant difference between discrete time and continuous time walk
Externí odkaz:
http://arxiv.org/abs/quant-ph/0402107
Autor:
Kamil Khadiev, Aliya Khadieva, Mansur Ziatdinov, Ilnaz Mannapov, Dmitry Kravchenko, Alexander Rivosh, Ramis Yamilov
Publikováno v:
Theoretical Computer Science. 920:76-94
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Publikováno v:
In Theoretical Computer Science 8 July 2013 494:36-48