Parameterized Quantum Query Complexity of Graph Collision
Ambainis, Andris, Balodis, Kaspars, Iraids, Jānis, Ozols, Raitis, Smotrovs, Juris
Year of Publication 05.05.2013
Year of Publication 05.05.2013
Get full text
Journal Article
Boolean Functions with a Low Polynomial Degree and Quantum Query Algorithms
Ozols, Raitis, Freivalds, Rūsiņš, Ivanovs, Jevgeņijs, Kalniņa, Elīna, Lāce, Lelde, Miyakawa, Masahiro, Tatsumi, Hisayuki, Taimiņa, Daina
Published in SOFSEM 2005: Theory and Practice of Computer Science
Published in SOFSEM 2005: Theory and Practice of Computer Science
Get full text
Book Chapter
Search by quantum walks on two-dimensional grid without amplitude amplification
Ambainis, Andris, Backurs, Arturs, Nahimovs, Nikolajs, Ozols, Raitis, Rivosh, Alexander
Year of Publication 14.12.2011
Year of Publication 14.12.2011
Get full text
Journal Article
Quantum strategies are better than classical in almost any XOR game
Ambainis, Andris, Backurs, Arturs, Balodis, Kaspars, Kravcenko, Dmitry, Ozols, Raitis, Smotrovs, Juris, Virza, Madars
Year of Publication 14.12.2011
Year of Publication 14.12.2011
Get full text
Journal Article
Parameterized Quantum Query Complexity of Graph Collision
Ambainis, Andris, Balodis, Kaspars, Iraids, Jānis, Ozols, Raitis, Smotrovs, Juris
Published in arXiv.org (05.05.2013)
Get full text
Published in arXiv.org (05.05.2013)
Paper