На 14 юли 2022 г. /четвъртък/, от 11:00 ч. в зала 300 на ИЯИЯЕ Петър Данев (ИЯИЯЕ) ще изнесе доклад на тема:
"Study of quantum random walk search algorithm with qudit Householder traversing coin".
- The discrete time quantum random walk search (DTQRWS) algorithm uses quantum walk to find elements in an unordered database. It is quadratically faster than the corresponding classical counterpart. I will present a modification of DTQRWS, constructed by qudit Householder traversing coin, making the algorithm extremely robust to inaccuracies in the coin parameters if a proper relation between them is maintained. Optimal functional dependencies and parameter values are derived for walk coin with size up to one qudit with eleven states. By applying deep neural network, we extrapolate the results for walk coin with arbitrary dimension. The presentation is based on the preprint "High robustness quantum walk search algorithm with qudit Householder traversing coin, machine learning study", with authors Hristo Tonchev and Petar Danev: arXiv:2111.10926.
Поканват се всички интересуващи се.