We are an internationally regarded quantum computing research group in the Faculty of Computing at the University of Latvia. Our group is currently led by Andris Ambainis, and we focus on the theoretical aspects of quantum information including quantum algorithms, computational complexity, communications, and cryptography.
- Aleksandrs Belovs, "Quantum Algorithms for Classical Probability Distributions," arXiv:1904.02192.
- Aleksejs Naumovs, Maksims Dimitrijevs, Abuzer Yakaryılmaz, "The minimal probabilistic and quantum finite automata recognizing uncountably many languages with fixed cutpoints," arXiv:1904.01381.
- Aleksandrs Belovs, "Quantum Algorithm for Distribution-Free Junta Testing," arXiv:1903.08462.
- Andris Ambainis, András Gilyén, Stacey Jeffery and Martins Kokainis, "Quadratic speedup for finding marked vertices by quantum walks," arXiv:1903.07493.
- Adam Glos, Nikolajs Nahimovs, Konstantin Balakirev, and Kamil Khadiev, "Upperbounds on the probability of finding marked connected components using quantum walks," arXiv:1903.01482.
- Balthazar Bauer, Jevgēnijs Vihrovs and Hoeteck Wee, "On the Inner Product Predicate and a Generalization of Matching Vector Families," arXiv:1810.02396.
- Andris Ambainis, Krišjānis Prūsis and Jevgēnijs Vihrovs, "On Block Sensitivity and Fractional Block Sensitivity," arXiv:1810.02393.
- Raqueline A. M. Santos, "The role of tessellation intersection in staggered quantum walks," arXiv:1810.02387.
- Andris Ambainis, Mike Hamburg and Dominique Unruh, "Quantum security proofs using semi-classical oracles," ia.cr/2018/904.
- Kamil Khadiev and Dmitry Kravchenko, "On the Complexity of Solving Subtraction Games," arXiv:1808.03494.