Zobrazeno 1 - 10
of 277
pro vyhledávání: '"A. Belovs"'
Autor:
R. Riekstins, A. Dorogojs, J. Jansons, A. Belovs, J. Berzins, A. Freimanis, S. Silina, V. Lietuvietis
Publikováno v:
European Urology Open Science, Vol 63, Iss , Pp S3- (2024)
Externí odkaz:
https://doaj.org/article/9829ae0498c646f1860b1e73520311de
In this work we study quantum algorithms for Hopcroft's problem which is a fundamental problem in computational geometry. Given $n$ points and $n$ lines in the plane, the task is to determine whether there is a point-line incidence. The classical com
Externí odkaz:
http://arxiv.org/abs/2405.01160
Autor:
Belovs, Aleksandrs
Up to now, relatively few exponential quantum speed-ups have been achieved. Out of them, the welded tree problem (Childs, Cleve, Deotto, Farhi, Gutmann, and Spielman'2003) is one of the unusual examples, as the exponential speed-up is attained by a q
Externí odkaz:
http://arxiv.org/abs/2404.19476
Publikováno v:
Quantum 8, 1444 (2024)
Quantum query complexity has several nice properties with respect to composition. First, bounded-error quantum query algorithms can be composed without incurring log factors through error reduction (exactness). Second, through careful accounting (thr
Externí odkaz:
http://arxiv.org/abs/2311.15873
We derive equations of motion for paramagnetic and ferromagnetic particles fully accounting for gyromagnetic effects. Considering the Einstein-de Haas effect for an ellipsoidal paramagnetic particle we find that starting from a quiescent non-magnetiz
Externí odkaz:
http://arxiv.org/abs/2310.14674
Autor:
Belovs, Aleksandrs
The polynomial and the adversary methods are the two main tools for proving lower bounds on query complexity of quantum algorithms. Both methods have found a large number of applications, some problems more suitable for one method, some for the other
Externí odkaz:
http://arxiv.org/abs/2301.10317
Autor:
Ambainis, Andris, Belovs, Aleksandrs
While it is known that there is at most a polynomial separation between quantum query complexity and the polynomial degree for total functions, the precise relationship between the two is not clear for partial functions. In this paper, we demonstrate
Externí odkaz:
http://arxiv.org/abs/2301.09218
Autor:
Belovs, Aleksandrs, Yolcu, Duyal
We propose a new definition of quantum Las Vegas query complexity. We show that it is exactly equal to the quantum adversary bound. This is achieved by a new and very simple way of transforming a feasible solution to the adversary optimisation proble
Externí odkaz:
http://arxiv.org/abs/2301.02003
Autor:
Belovs, Aleksandrs, Castellanos, Arturo, Gall, François Le, Malod, Guillaume, Sherstov, Alexander A.
Publikováno v:
Quantum Information and Computation, Vol.21 No.15&16, pp.1261-1273, 2021
The classical communication complexity of testing closeness of discrete distributions has recently been studied by Andoni, Malkin and Nosatzki (ICALP'19). In this problem, two players each receive $t$ samples from one distribution over $[n]$, and the
Externí odkaz:
http://arxiv.org/abs/2006.14870
Autor:
Belovs, Aleksandrs, Lee, Troy
The negative weight adversary method, $\mathrm{ADV}^\pm(g)$, is known to characterize the bounded-error quantum query complexity of any Boolean function $g$, and also obeys a perfect composition theorem $\mathrm{ADV}^\pm(f \circ g^n) = \mathrm{ADV}^\
Externí odkaz:
http://arxiv.org/abs/2004.06439