Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:2404.05084 · Quantum Information Processing

Robustness of quantum random walk search with multi-phase matching

Hristo Tonchev, Petar Danev

Published May 3, 2025• 1 citation
arXivHTMLPDF
DOI
10.1007/s11128-025-04736-3

Related papers

Robustness of Quantum Walk Search with Neighbors Measurement

Hristo Tonchev, Petar Danev

Geometry Integrability and Quantization•Jan 1, 2024•0 citations

Multi-target quantum walk search on Johnson graph

Pulak Ranjan Giri

arXiv:2510.04424•Physics Letters A•Jun 19, 2025•4 citations

Optimizing the walk coin in the quantum random walk search algorithm

Hristo Tonchev, Petar Danev

This paper examines quantum random walk search algorithm with walk coin constructed by generalized Householder reflection and additional phase shift factor. The results from numerical simulations with neural network show that, with such a construction of the walk coin, the algorithm is more robust to inaccuracies in the specific values of its parameters, as long as it is possible to control the phase difference between the phase shift factor and the phase involved in the Householder reflection. This paper explicitly shows how achieving a properly designed phase difference would make quantum random walk search on a hypercube more robust for coin register consisting of one, two and three qubits.

International Journal of Quantum Information•Jun 19, 2023•2 citations

Behavior of quantum search algorithm with small phase rotations

Xin Li, Cheng Cheng, Chuntian +4 more

高技术通讯:英文版•Jan 1, 2011•0 citations

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 iteration only quantum walk is applied. And in the second, the closest neighbors of the solution are measured classically. In our approach the traversing coin is constructed by both generalized Householder reflection and an additional phase multiplier and we investigate the stability of the algorithm to deviations in those phases. We have shown that the unmodified algorithm becomes more robust when a certain relation between those phases is preserved. The first modification we study here does not lead to any change in the robustness of quantum random walk search algorithm. However, when a measurement of the first and second neighbors is included, there are some differences. The most important one, in view of our study of the robustness, is an increase in the stability of the algorithm, especially for large coin dimensions.

arXiv:2305.15073•May 24, 2023•2 citations

Studying the robustness of quantum random walk search on Hypercube against phase errors in the traversing coin by semi-empirical methods

Hristo Tonchev, Petar Danev

In this work we obtain semi-empirical expressions for the probability to find solution of Quantum random walk search algorithm on hypercube when the traversing coin is constructed by generalized Householder reflection and an additional phase shift. Calculations are made for specific relations between coin phases (first from the reflection and second from the shift), that are obtained in our previous works. The quantum algorithm could be made more robust against phase errors, if an experimental implementation preserves those relations. The results from numerical simulations of quantum random walk search algorithm on hypercube are used to find an empirical formulas for algorithm’s probability to find solution. Those formulas, obtained by fitting data to a suitable function, are used to make prognosis about the algorithm’s robustness when dimension of the coin is too large to be simulated on classical computer. Here, we explicitly show all steps of the method used in the paper, while also discuss its advantages and limitations. The goal of this work is to help the experimental implementation of the quantum random walk search algorithm by giving evaluation of the algorithm’s robustness and the obtained probability to find a solution when our design of the walking coin is used.

International Conference of the Balkan Physical Union (BPU)•Oct 2, 2023•3 citations
This paper examines quantum random walk search algorithm with walk coin constructed by generalized Householder reflection and additional phase shift factor. The results from numerical simulations with neural network show that, with such a construction of the walk coin, the algorithm is more robust to inaccuracies in the specific values of its parameters, as long as it is possible to control the phase difference between the phase shift factor and the phase involved in the Householder reflection. This paper explicitly shows how achieving a properly designed phase difference would make quantum random walk search on a hypercube more robust for coin register consisting of one, two and three qubits.
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 iteration only quantum walk is applied. And in the second, the closest neighbors of the solution are measured classically. In our approach the traversing coin is constructed by both generalized Householder reflection and an additional phase multiplier and we investigate the stability of the algorithm to deviations in those phases. We have shown that the unmodified algorithm becomes more robust when a certain relation between those phases is preserved. The first modification we study here does not lead to any change in the robustness of quantum random walk search algorithm. However, when a measurement of the first and second neighbors is included, there are some differences. The most important one, in view of our study of the robustness, is an increase in the stability of the algorithm, especially for large coin dimensions.
In this work we obtain semi-empirical expressions for the probability to find solution of Quantum random walk search algorithm on hypercube when the traversing coin is constructed by generalized Householder reflection and an additional phase shift. Calculations are made for specific relations between coin phases (first from the reflection and second from the shift), that are obtained in our previous works. The quantum algorithm could be made more robust against phase errors, if an experimental implementation preserves those relations. The results from numerical simulations of quantum random walk search algorithm on hypercube are used to find an empirical formulas for algorithm’s probability to find solution. Those formulas, obtained by fitting data to a suitable function, are used to make prognosis about the algorithm’s robustness when dimension of the coin is too large to be simulated on classical computer. Here, we explicitly show all steps of the method used in the paper, while also discuss its advantages and limitations. The goal of this work is to help the experimental implementation of the quantum random walk search algorithm by giving evaluation of the algorithm’s robustness and the obtained probability to find a solution when our design of the walking coin is used.