High robustness quantum walk search algorithm with qudit Householder traversing coin, machine learning study
Quantum Physics
2021-12-06 v2 Atomic Physics
Abstract
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 one qudit with arbitrary dimension. Monte Carlo simulations, in combination with supervised machine learning, are used to find walk coins making the quantum algorithm more robust to deviations in the coin's parameters. By applying deep neural network we make prediction for the parameters of an optimal coin with arbitrary size and estimate the stability for such coin.
Cite
@article{arxiv.2111.10926,
title = {High robustness quantum walk search algorithm with qudit Householder traversing coin, machine learning study},
author = {Hristo Tonchev and Petar Danev},
journal= {arXiv preprint arXiv:2111.10926},
year = {2021}
}
Comments
31 pages, 19 figures, added two paragraphs and two figures to better explain our results