On aggregation-quantization permutability problem for discrete-time Markov chains

TL;DR

This paper explores the conditions under which quantum and classical Markov chain aggregations produce equivalent results, extending existing techniques to quantum walks and applying them to various graph structures and models.

Contribution

It extends aggregation techniques to quantum Markov chains and identifies conditions for equivalence with Szegedy's quantization, including equitable partitions and specific graph classes.

Findings

Conditions for quantum-classical aggregation equivalence established

Examples include walks on Platonic solids and Cayley graphs

Comparison with uniformization of unitary matrices provided

Abstract

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 the level of quantum Markov chains. We provide conditions under which application of these two operations - Szegedy's quantization and aggregation - give the same result. In particular, we show that the conditions are satisfied in the case of the random walk on graphs equipped with equitable partitions. We present several examples, which include the classical/quantum walks on Platonic solids. We discuss also relation of discrete-time classical/quantum walks on $N$-dimensional hypercube and the Ehrenfests urn model with $N$ particles. We apply our technique for of discrete-time walks on Cayley graphs of free groups. We also compare our results with those obtained using Cantero-Moral-Velazquez uniformization of unitary matrices.