A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2022; you can also visit the original URL.
The file type is application/pdf
.
Reducing number of gates in quantum random walk search algorithm via modification of coin operators
[article]
2022
arXiv
pre-print
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 additional phase multiplier. If an appropriate relation between corresponding parameters is realized, our algorithm becomes more robust to deviations in the phases. In this modification marking coin is not needed, and all advantages from above mentioned optimization to the stability, are preserved. It is shown
arXiv:2204.12858v1
fatcat:kdvfb34pmzcdrd3zmxdnq3thku