Continuous-Time Quantum Markov Chains And Discretizations Of p-Adic Schrödinger Equations: Comparisons And Simulations

The continuous-time quantum walks (CTQWs) are a fundamental tool in the development of quantum algorithms. Recently, it was shown that discretizations of p-adic Schrödinger equations give rise to continuous-time quantum Markov chains (CTQMCs); this type of Markov chain includes the CTQWs constructed using adjacency matrices of graphs as a particular case. In this paper, we study a large class of p-adic Schrödinger equations and the associated CTQMCs by comparing them with p-adic heat equations and the associated continuous-time Markov chains (CTMCs). The comparison is done by a mathematical study of the mentioned equations, which requires, for instance, solving the initial value problems attached to the mentioned equations, and through numerical simulations. We conducted multiple simulations, including numerical approximations of the limiting distribution. Our simulations show that the limiting distribution of quantum Markov chains is greater than the stationary probability of their classical counterparts, for a large class of CTQMCs.