Semi-empirical method for evaluating the robustness of QRWS algorithm for different coin sizes and functional dependence between coin phases
Year: 2024
Type: conference-paper
Abstract: In this work we study the quantum random walk search algorithm when the walk coin is constructed by generalized Householder reflection and a phase multiplier. We focus on the algorithm’s robustness against errors in the phases – how the probability to find solution decreases with increasing the errors in those phases. The robustness depends on the functional dependence between the reflection phase φ and the phase multiplier ζ. Here we use interpolations by non-linear logistic regression functions to study a particular functional dependence between angles ζ = -2φ + 3π + α sin(2φ) for different coin sizes and parameters alpha. The obtained results in this work are discussed, together with their limitations.
Authors: H Tonchev, P Danev
Language: English
Subfield: Artificial Intelligence
Field: Computer Science
Domain: Physical Sciences
Open Access status: diamond
OpenAlex ID: W4392170355
