Clustering quantum Markov chains on trees associated with open quantum random walks

Abstract

<abstract><p>In networks, the Markov clustering (MCL) algorithm is one of the most efficient approaches in detecting clustered structures. The MCL algorithm takes as input a stochastic matrix, which depends on the adjacency matrix of the graph network under consideration. Quantum clustering algorithms are proven to be superefficient over the classical ones. Motivated by the idea of a potential clustering algorithm based on quantum Markov chains, we prove a clustering property for quantum Markov chains (QMCs) on Cayley trees associated with open quantum random walks (OQRW).</p></abstract>