Continuous-time quantum walks have received much attention in the recent past, especially because of their useful applications in several fields. One of them is the problem of quantum spatial search, in which an analog of Grover's search algorithm is run over a structured database, i.e. a graph. In this talk we overview the subject and we show how the presence of dynamical noise on the graph can affect the performance of the search, correlating the results to the graph topology. Finally, we discuss possible paths toward the implementation of continuous-time quantum spatial search, at present still missing.
Contact details:
Roberta Zambrini Contact form