Abstract
In this paper, we explore experimentally the use of the commute time of the continuous-time quantum walk for graph drawing. For the classical random walk, the commute time has been shown to be robust to errors in edge weight structure and to lead to spectral clustering algorithms with improved performance. We analyse the quantum commute times with reference to their classical counterpart. Specifically, we explore the graph embeddings that preserve commute-time.