5 citations · 13 across the 7 of their papers we have counts for
7 papers
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…
Security of a Grover's Algorithm-based secret sharing protocol, generalized for an arbitrary number of participants, against interception attacks
Hristo Tonchev, Rosen Bahtev
In this work, we study interception attacks against a secret sharing protocol based on Grovers search algorithm. Unlike previous works that only give the algorithm for two and thre…
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…
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…
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…
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…