10 citations · 25 across the 6 of their papers we have counts for
4 papers · 1 filter
Robustness of Quantum Random Walk Search with multi-phase matching
Hristo Tonchev, Petar Danev
In our previous works, we have studied quantum random walk search algorithm on hypercube, with traversing coin constructed by using generalized Householder reflection and a phase m…
Robustness of different modifications of Grovers algorithm based on generalized Householder reflections with different phases
Hristo Tonchev, Petar Danev
In this work we study five Grovers algorithm modifications, where each iteration is constructed by two generalized Householder reflections, against inaccuracies in the phases. By u…
Robustness of Quantum Random Walk Search Algorithm in Hypercube when only first or both first and second neighbors are measured
Hristo Tonchev, Petar Danev
In this work we study the robustness of two modifications of quantum random walk search algorithm on hypercube. In the first previously suggested modification, on each even iterati…
High robustness quantum walk search algorithm with qudit Householder traversing coin, machine learning study
Hristo Tonchev, Petar Danev
In this work the quantum random walk search algorithm with walk coin constructed by generalized Householder reflection and phase multiplier has been studied. The coin register is o…