- Martins Kokainis, Krišjānis Prūsis, Jevgēnijs Vihrovs, Vyacheslavs Kashcheyevs, Andris Ambainis, “Strong dispersion property for the quantum walk on the hypercube,”
- Özlem Salehi, Abuzer Yakaryılmaz, “State-efficient QFA Algorithm for Quantum Computers,”
- Jānis Iraids, Juris Smotrovs, “Representing polynomial of CONNECTIVITY,”
- Utku Birkan, Özlem Salehi, Viktor Olejar, Cem Nurlu, Abuzer Yakaryýlmaz,”Implementing Quantum Finite Automata Algorithms on Noisy Devices,”
- Adam Glos, Martins Kokainis, Ryuhei Mori, Jevgēnijs Vihrovs, “Quantum speedups for dynamic programming on n-dimensional lattice graphs,”
- Duarte Magano, Akshat Kumar, Mārtiņš Kālis, Andris Locāns, Adam Glos, Sagar Pratapsi, Gonçalo Quinta, Maksims Dimitrijevs, Aleksander Rivošs, Pedrame Bargassa, João Seixas, Andris Ambainis, Yasser Omar, “Quantum speedup for track reconstruction in particle accelerators,”
- Nikolajs Nahimovs, Raqueline A. M. Santos, “Lackadaisical quantum walks on 2D grids with multiple marked vertices,”
- Andris Ambainis, Kaspars Balodis, Jānis Iraids, “A note about claw function with a small range,”
- Kaspars Balodis, Shalev Ben-David, Mika Göös, Siddhartha Jain, Robin Kothari, “Unambiguous DNFs and Alon-Saks-Seymour,”
- Andris Ambainis, Kaspars Balodis, Jānis Iraids, Kamil Khadiev, Vladislavs Kļevickis, Krišjānis Prūsis, Yixin Shen, Juris Smotrovs, Jevgēnijs Vihrovs, “Quantum Lower and Upper Bounds for 2D-Grid and Dyck Language,”
- Aleksandrs Belovs, Arturo Castellanos, François Le Gall, Guillaume Malod, Alexander A. Sherstov, “Quantum Communication Complexity of Distribution Testing,”
- Aleksandrs Belovs, Troy Lee, “The quantum query complexity of composition with a relation,”
Skip to content
Center for Quantum Computing Science
University of Latvia, Faculty of Computing