On training a classifier of hitting times for quantum walks

Year
2020
Type(s)
Author(s)
Alexey A. Melnikov, Leonid E. Fedichkin, Alexander Alodjants
Source
AIP Conference Proceedings 2241, 020029 (2020)
Url(s)
https://doi.org/10.1063/5.0011365
BibTeX
BibTeX

We study hitting times of quantum walks on graphs from a machine learning perspective. Given a graph it is difficult to decide if quantum walks give an advantage relative to classical random walks. It was shown that machine learning can help to detect quantum advantage even though quantum walk and random walk dynamics on the graph has never been simulated. Here we describe the procedure by which training data is generated for the machine learning approach, and discuss possible future improvements.

Leave a Reply

Your email address will not be published. Required fields are marked *

By continuing to use the site, you agree to the use of cookies. more information

The cookie settings on this website are set to "allow cookies" to give you the best browsing experience possible. If you continue to use this website without changing your cookie settings or you click "Accept" below then you are consenting to this.

Close