5 citations · 14 across the 7 of their papers we have counts for
Showing 2024Show all
2 papers · 1 filter
quant-ph2024
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…
quant-ph2024★ 1 cited
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…