1 hasil untuk "Zalewski Adam"
Menampilkan 1–1 · 0,92 detik · RSS
-
Preprint Teks lengkap
On aggregation-quantization permutability problem for discrete-time Markov chains
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 of states of a Markov chain, one can study the corresponding aggregated process. We extend the aggregation technique to…