zoom link: https://unipd.zoom.us/j/367589168
Abstract:
Quantum walks are the quantum counterpart of classical random walks.
In several cases, quantum walks technique outperform classical algorithms in
the goal of searching a marked vertex in a graph.
We will give a look at the general theory of quantum walks and, then, we
will focus on the studying of unique sink orientation problem on n-hypercubes
and the issues that come from its geometrical and combinatorial structure.
Simone Notarnicola