10 citations · 10 across the 2 of their papers we have counts for
1 paper · 1 filter
Adam Doliwa, Artur Siemaszko, Adam Zalewski
Given random walk on a graph, the corresponding discrete-time quantum walk can be constructed using the method proposed by Szegedy. On the other hand, given a partition of the set…