A
Aleksandrs Belovs
Researcher at University of Latvia
Publications - 75
Citations - 1287
Aleksandrs Belovs is an academic researcher from University of Latvia. The author has contributed to research in topics: Quantum algorithm & Upper and lower bounds. The author has an hindex of 19, co-authored 72 publications receiving 1140 citations. Previous affiliations of Aleksandrs Belovs include Centrum Wiskunde & Informatica & University of Waterloo.
Papers
More filters
Posted Content
Span Programs for Functions with Constant-Sized 1-certificates
TL;DR: The power of the approach is proved by designing a quantum algorithm for the triangle problem with query complexity O(n35/27) that is better than O( n13/10) of the best previously known algorithm by Magniez et al.
Proceedings ArticleDOI
Learning-Graph-Based Quantum Algorithm for k-Distinctness
TL;DR: In this paper, a quantum algorithm for the k-distinctness problem is presented, which solves the problem in a less number of queries than the previous algorithm by Ambainis.
Proceedings ArticleDOI
A polynomial lower bound for testing monotonicity
Aleksandrs Belovs,Eric Blais +1 more
TL;DR: In this paper, it was shown that there is an exponential gap between the query complexity of adaptive and non-adaptive algorithms for testing regular linear threshold functions (LTFs) for monotonicity.
Book ChapterDOI
Span programs and quantum algorithms for st -connectivity and claw detection
TL;DR: An algorithm is given that uses O(n) queries to the adjacency matrix of an n-vertex graph to decide if vertices s and t are connected, under the promise that they either are connected by a path of length at most d, or are disconnected.
Proceedings ArticleDOI
Separations in query complexity based on pointer functions
TL;DR: In this article, it was shown that the quantum query complexity of the same function is O(n 1/4 ) while the deterministic query complexity is Ω(n/log(n)) and bounded-error randomized query complexity R(g) = O(√n).