2 citations · 2 across the 1 of their papers we have counts for
2 papers
quant-ph2022★ 2 cited
Reducing number of gates in quantum random walk search algorithm via modification of coin operators
Hristo Tonchev, Petar Danev
This paper examines a way to simplify the circuit of quantum random walk search algorithm, when the traversing coin is constructed by both generalized Householder reflection and an…
quant-ph2021
Optimizing the walk coin in the quantum random walk search algorithm through machine learning
Hristo Tonchev, Petar Danev
This paper examines the stability of the quantum random walk search algorithm, when the walk coin is constructed by generalized Householder reflection and additional phase shift, a…