Zobrazeno 1 - 3
of 3
pro vyhledávání: '"Raitis Ozols"'
Publikováno v:
Theory of Quantum Computation, Communication, and Cryptography ISBN: 9783642356551
TQC
TQC
We study search by quantum walk on a finite two dimensional grid. The algorithm of Ambainis, Kempe, Rivosh [AKR05] uses \(O(\sqrt{N \log{N}})\) steps and finds a marked location with probability O(1 / logN) for grid of size \(\sqrt{N} \times \sqrt{N}
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::89f37982b2d0bcfabd3e61328ff4bc7d
https://doi.org/10.1007/978-3-642-35656-8_7
https://doi.org/10.1007/978-3-642-35656-8_7
Autor:
Andris Ambainis, Kaspars Balodis, Arturs Backurs, Raitis Ozols, Madars Virza, Juris Smotrovs, Dmitrijs Kravčenko
Publikováno v:
Automata, Languages, and Programming ISBN: 9783642315930
ICALP (1)
ICALP (1)
We initiate a study of random instances of nonlocal games. We show that quantum strategies are better than classical for almost any 2-player XOR game. More precisely, for large n, the entangled value of a random 2-player XOR game with n questions to
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::cd718be715b3251a6bbbebe9e32543a0
https://doi.org/10.1007/978-3-642-31594-7_3
https://doi.org/10.1007/978-3-642-31594-7_3
Autor:
Elīna Kalniņa, Jevgeņijs Ivanovs, Lelde Lāce, Daina Taimiņa, Hisayuki Tatsumi, Rūsiņš Freivalds, Raitis Ozols, Masahiro Miyakawa
Publikováno v:
SOFSEM 2005: Theory and Practice of Computer Science ISBN: 9783540243021
SOFSEM
Scopus-Elsevier
SOFSEM
Scopus-Elsevier
The complexity of quantum query algorithms computing Boolean functions is strongly related to the degree of the algebraic polynomial representing this Boolean function. There are two related difficult open problems. First, Boolean functions are sough
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::8ae668799843d68e9a34254016b60dd0
https://doi.org/10.1007/978-3-540-30577-4_50
https://doi.org/10.1007/978-3-540-30577-4_50